java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-6b94a2f
[2018-01-24 15:43:01,771 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-24 15:43:01,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-24 15:43:01,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-24 15:43:01,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-24 15:43:01,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-24 15:43:01,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-24 15:43:01,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-24 15:43:01,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-24 15:43:01,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-24 15:43:01,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-24 15:43:01,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-24 15:43:01,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-24 15:43:01,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-24 15:43:01,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-24 15:43:01,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-24 15:43:01,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-24 15:43:01,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-24 15:43:01,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-24 15:43:01,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-24 15:43:01,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-24 15:43:01,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-24 15:43:01,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-24 15:43:01,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-24 15:43:01,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-24 15:43:01,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-24 15:43:01,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-24 15:43:01,812 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-24 15:43:01,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-24 15:43:01,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-24 15:43:01,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-24 15:43:01,813 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf
[2018-01-24 15:43:01,823 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-24 15:43:01,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-24 15:43:01,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-24 15:43:01,824 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-24 15:43:01,824 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-24 15:43:01,824 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-24 15:43:01,825 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-24 15:43:01,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-24 15:43:01,825 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-24 15:43:01,826 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-24 15:43:01,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-24 15:43:01,826 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-24 15:43:01,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-24 15:43:01,826 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-24 15:43:01,826 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-24 15:43:01,827 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-24 15:43:01,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-24 15:43:01,827 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-24 15:43:01,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-24 15:43:01,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-01-24 15:43:01,828 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-24 15:43:01,828 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-24 15:43:01,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-24 15:43:01,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-24 15:43:01,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-24 15:43:01,829 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-24 15:43:01,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-24 15:43:01,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-24 15:43:01,829 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN
[2018-01-24 15:43:01,829 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-24 15:43:01,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-24 15:43:01,830 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-24 15:43:01,830 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES
[2018-01-24 15:43:01,831 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-24 15:43:01,831 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-24 15:43:01,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-24 15:43:01,878 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-24 15:43:01,882 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-24 15:43:01,883 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-24 15:43:01,884 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-24 15:43:01,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i
[2018-01-24 15:43:02,045 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-24 15:43:02,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-24 15:43:02,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-24 15:43:02,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-24 15:43:02,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-24 15:43:02,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1e8e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02, skipping insertion in model container
[2018-01-24 15:43:02,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,080 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-24 15:43:02,117 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-24 15:43:02,229 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-24 15:43:02,250 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-24 15:43:02,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02 WrapperNode
[2018-01-24 15:43:02,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-24 15:43:02,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-24 15:43:02,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-24 15:43:02,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-24 15:43:02,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
[2018-01-24 15:43:02,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-24 15:43:02,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-24 15:43:02,300 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-24 15:43:02,300 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-24 15:43:02,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-24 15:43:02,348 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-24 15:43:02,348 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-24 15:43:02,349 INFO L136 BoogieDeclarations]: Found implementation of procedure append
[2018-01-24 15:43:02,349 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-24 15:43:02,349 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-24 15:43:02,349 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-24 15:43:02,349 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-24 15:43:02,349 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-24 15:43:02,349 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-24 15:43:02,349 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-24 15:43:02,349 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-24 15:43:02,350 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-24 15:43:02,350 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2018-01-24 15:43:02,350 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-24 15:43:02,350 INFO L128 BoogieDeclarations]: Found specification of procedure append
[2018-01-24 15:43:02,350 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-24 15:43:02,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-24 15:43:02,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-24 15:43:02,829 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-24 15:43:02,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:43:02 BoogieIcfgContainer
[2018-01-24 15:43:02,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-24 15:43:02,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-24 15:43:02,831 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-24 15:43:02,834 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-24 15:43:02,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:43:02" (1/3) ...
[2018-01-24 15:43:02,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e9a534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:43:02, skipping insertion in model container
[2018-01-24 15:43:02,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:43:02" (2/3) ...
[2018-01-24 15:43:02,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e9a534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:43:02, skipping insertion in model container
[2018-01-24 15:43:02,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:43:02" (3/3) ...
[2018-01-24 15:43:02,838 INFO L105 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i
[2018-01-24 15:43:02,845 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-24 15:43:02,851 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations.
[2018-01-24 15:43:02,899 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-24 15:43:02,899 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-24 15:43:02,899 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-24 15:43:02,899 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-24 15:43:02,900 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-24 15:43:02,900 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-24 15:43:02,900 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-24 15:43:02,900 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-24 15:43:02,900 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-24 15:43:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states.
[2018-01-24 15:43:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-01-24 15:43:02,925 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:02,926 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:02,926 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times
[2018-01-24 15:43:02,932 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:02,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:02,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:02,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:02,987 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:03,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:03,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:03,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 15:43:03,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:03,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-24 15:43:03,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-24 15:43:03,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-24 15:43:03,114 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states.
[2018-01-24 15:43:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:03,538 INFO L93 Difference]: Finished difference Result 268 states and 291 transitions.
[2018-01-24 15:43:03,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-24 15:43:03,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-01-24 15:43:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:03,549 INFO L225 Difference]: With dead ends: 268
[2018-01-24 15:43:03,549 INFO L226 Difference]: Without dead ends: 158
[2018-01-24 15:43:03,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-24 15:43:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-01-24 15:43:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126.
[2018-01-24 15:43:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2018-01-24 15:43:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions.
[2018-01-24 15:43:03,593 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8
[2018-01-24 15:43:03,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:03,594 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions.
[2018-01-24 15:43:03,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-24 15:43:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions.
[2018-01-24 15:43:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-01-24 15:43:03,594 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:03,594 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:03,594 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times
[2018-01-24 15:43:03,595 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:03,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:03,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:03,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:03,596 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:03,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:03,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:03,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 15:43:03,672 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:03,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-24 15:43:03,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-24 15:43:03,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-24 15:43:03,674 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states.
[2018-01-24 15:43:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:03,849 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions.
[2018-01-24 15:43:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-24 15:43:03,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-01-24 15:43:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:03,852 INFO L225 Difference]: With dead ends: 128
[2018-01-24 15:43:03,853 INFO L226 Difference]: Without dead ends: 126
[2018-01-24 15:43:03,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-24 15:43:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2018-01-24 15:43:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124.
[2018-01-24 15:43:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states.
[2018-01-24 15:43:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions.
[2018-01-24 15:43:03,866 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8
[2018-01-24 15:43:03,866 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:03,866 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions.
[2018-01-24 15:43:03,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-24 15:43:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions.
[2018-01-24 15:43:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-01-24 15:43:03,867 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:03,867 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:03,867 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times
[2018-01-24 15:43:03,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:03,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:03,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:03,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:03,869 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:03,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:03,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:03,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 15:43:03,941 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:03,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-24 15:43:03,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-24 15:43:03,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-24 15:43:03,942 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states.
[2018-01-24 15:43:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:04,070 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions.
[2018-01-24 15:43:04,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-24 15:43:04,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2018-01-24 15:43:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:04,072 INFO L225 Difference]: With dead ends: 139
[2018-01-24 15:43:04,072 INFO L226 Difference]: Without dead ends: 136
[2018-01-24 15:43:04,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-24 15:43:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2018-01-24 15:43:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126.
[2018-01-24 15:43:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2018-01-24 15:43:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions.
[2018-01-24 15:43:04,083 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12
[2018-01-24 15:43:04,083 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:04,083 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions.
[2018-01-24 15:43:04,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-24 15:43:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions.
[2018-01-24 15:43:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-01-24 15:43:04,084 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:04,084 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:04,085 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times
[2018-01-24 15:43:04,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:04,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:04,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,086 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:04,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:04,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:04,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 15:43:04,192 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:04,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-24 15:43:04,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-24 15:43:04,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-24 15:43:04,194 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states.
[2018-01-24 15:43:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:04,293 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions.
[2018-01-24 15:43:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-24 15:43:04,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2018-01-24 15:43:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:04,295 INFO L225 Difference]: With dead ends: 128
[2018-01-24 15:43:04,295 INFO L226 Difference]: Without dead ends: 126
[2018-01-24 15:43:04,295 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-24 15:43:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2018-01-24 15:43:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124.
[2018-01-24 15:43:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states.
[2018-01-24 15:43:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions.
[2018-01-24 15:43:04,305 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12
[2018-01-24 15:43:04,305 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:04,305 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions.
[2018-01-24 15:43:04,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-24 15:43:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions.
[2018-01-24 15:43:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-24 15:43:04,306 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:04,306 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:04,306 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times
[2018-01-24 15:43:04,306 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:04,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:04,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,307 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:04,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:04,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:04,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 15:43:04,364 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:04,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-24 15:43:04,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-24 15:43:04,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-24 15:43:04,365 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states.
[2018-01-24 15:43:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:04,480 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions.
[2018-01-24 15:43:04,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-24 15:43:04,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-24 15:43:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:04,509 INFO L225 Difference]: With dead ends: 124
[2018-01-24 15:43:04,509 INFO L226 Difference]: Without dead ends: 119
[2018-01-24 15:43:04,509 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-24 15:43:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-01-24 15:43:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2018-01-24 15:43:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states.
[2018-01-24 15:43:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions.
[2018-01-24 15:43:04,526 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20
[2018-01-24 15:43:04,526 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:04,526 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions.
[2018-01-24 15:43:04,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-24 15:43:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions.
[2018-01-24 15:43:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-24 15:43:04,527 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:04,527 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:04,528 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times
[2018-01-24 15:43:04,529 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:04,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:04,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:04,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:04,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:04,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 15:43:04,615 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:04,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-24 15:43:04,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-24 15:43:04,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-24 15:43:04,615 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states.
[2018-01-24 15:43:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:04,688 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions.
[2018-01-24 15:43:04,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-24 15:43:04,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-24 15:43:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:04,689 INFO L225 Difference]: With dead ends: 119
[2018-01-24 15:43:04,689 INFO L226 Difference]: Without dead ends: 114
[2018-01-24 15:43:04,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-24 15:43:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2018-01-24 15:43:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114.
[2018-01-24 15:43:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-24 15:43:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions.
[2018-01-24 15:43:04,697 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20
[2018-01-24 15:43:04,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:04,697 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions.
[2018-01-24 15:43:04,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-24 15:43:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions.
[2018-01-24 15:43:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-01-24 15:43:04,698 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:04,699 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:04,699 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times
[2018-01-24 15:43:04,699 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:04,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:04,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:04,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:04,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:04,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:04,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-24 15:43:04,857 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:04,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-24 15:43:04,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-24 15:43:04,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-01-24 15:43:04,858 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 8 states.
[2018-01-24 15:43:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:05,160 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions.
[2018-01-24 15:43:05,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-24 15:43:05,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21
[2018-01-24 15:43:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:05,161 INFO L225 Difference]: With dead ends: 185
[2018-01-24 15:43:05,162 INFO L226 Difference]: Without dead ends: 177
[2018-01-24 15:43:05,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2018-01-24 15:43:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2018-01-24 15:43:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135.
[2018-01-24 15:43:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-01-24 15:43:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions.
[2018-01-24 15:43:05,169 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 21
[2018-01-24 15:43:05,169 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:05,169 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions.
[2018-01-24 15:43:05,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-24 15:43:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions.
[2018-01-24 15:43:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-01-24 15:43:05,170 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:05,170 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:05,170 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:05,170 INFO L82 PathProgramCache]: Analyzing trace with hash -276644943, now seen corresponding path program 1 times
[2018-01-24 15:43:05,170 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:05,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:05,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:05,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:05,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:05,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:05,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:05,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-24 15:43:05,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:05,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-24 15:43:05,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-24 15:43:05,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-01-24 15:43:05,323 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 9 states.
[2018-01-24 15:43:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:05,648 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions.
[2018-01-24 15:43:05,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-24 15:43:05,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21
[2018-01-24 15:43:05,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:05,650 INFO L225 Difference]: With dead ends: 196
[2018-01-24 15:43:05,650 INFO L226 Difference]: Without dead ends: 187
[2018-01-24 15:43:05,651 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156
[2018-01-24 15:43:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2018-01-24 15:43:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162.
[2018-01-24 15:43:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states.
[2018-01-24 15:43:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions.
[2018-01-24 15:43:05,656 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 21
[2018-01-24 15:43:05,657 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:05,657 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions.
[2018-01-24 15:43:05,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-24 15:43:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions.
[2018-01-24 15:43:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-01-24 15:43:05,657 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:05,658 INFO L322 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, 1, 1]
[2018-01-24 15:43:05,658 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1018638093, now seen corresponding path program 1 times
[2018-01-24 15:43:05,658 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:05,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:05,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:05,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:05,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:05,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:05,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:05,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-24 15:43:05,951 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:05,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-24 15:43:05,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-24 15:43:05,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2018-01-24 15:43:05,952 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand 14 states.
[2018-01-24 15:43:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:06,479 INFO L93 Difference]: Finished difference Result 376 states and 463 transitions.
[2018-01-24 15:43:06,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-24 15:43:06,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30
[2018-01-24 15:43:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:06,483 INFO L225 Difference]: With dead ends: 376
[2018-01-24 15:43:06,484 INFO L226 Difference]: Without dead ends: 228
[2018-01-24 15:43:06,486 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600
[2018-01-24 15:43:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states.
[2018-01-24 15:43:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 171.
[2018-01-24 15:43:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states.
[2018-01-24 15:43:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions.
[2018-01-24 15:43:06,507 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 30
[2018-01-24 15:43:06,507 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:06,507 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions.
[2018-01-24 15:43:06,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-24 15:43:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions.
[2018-01-24 15:43:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-01-24 15:43:06,508 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:06,508 INFO L322 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, 1, 1, 1, 1]
[2018-01-24 15:43:06,508 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2019932176, now seen corresponding path program 1 times
[2018-01-24 15:43:06,508 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:06,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:06,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:06,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:06,509 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:06,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:06,907 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 24 DAG size of output 22
[2018-01-24 15:43:07,051 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 34 DAG size of output 30
[2018-01-24 15:43:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:07,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:07,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-24 15:43:07,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:07,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-24 15:43:07,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-24 15:43:07,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2018-01-24 15:43:07,226 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 14 states.
[2018-01-24 15:43:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:07,712 INFO L93 Difference]: Finished difference Result 324 states and 393 transitions.
[2018-01-24 15:43:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-01-24 15:43:07,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32
[2018-01-24 15:43:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:07,713 INFO L225 Difference]: With dead ends: 324
[2018-01-24 15:43:07,714 INFO L226 Difference]: Without dead ends: 176
[2018-01-24 15:43:07,715 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600
[2018-01-24 15:43:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2018-01-24 15:43:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174.
[2018-01-24 15:43:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states.
[2018-01-24 15:43:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions.
[2018-01-24 15:43:07,725 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 32
[2018-01-24 15:43:07,725 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:07,725 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions.
[2018-01-24 15:43:07,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-24 15:43:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions.
[2018-01-24 15:43:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-01-24 15:43:07,726 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:07,726 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:07,726 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:07,726 INFO L82 PathProgramCache]: Analyzing trace with hash -489397259, now seen corresponding path program 1 times
[2018-01-24 15:43:07,726 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:07,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:07,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:07,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:07,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:07,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:07,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 15:43:07,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 15:43:07,788 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 15:43:07,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-24 15:43:07,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-24 15:43:07,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-24 15:43:07,789 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 3 states.
[2018-01-24 15:43:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 15:43:07,836 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions.
[2018-01-24 15:43:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-24 15:43:07,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40
[2018-01-24 15:43:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 15:43:07,840 INFO L225 Difference]: With dead ends: 207
[2018-01-24 15:43:07,840 INFO L226 Difference]: Without dead ends: 155
[2018-01-24 15:43:07,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-24 15:43:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2018-01-24 15:43:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144.
[2018-01-24 15:43:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states.
[2018-01-24 15:43:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions.
[2018-01-24 15:43:07,849 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 40
[2018-01-24 15:43:07,849 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-24 15:43:07,849 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions.
[2018-01-24 15:43:07,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-24 15:43:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions.
[2018-01-24 15:43:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-01-24 15:43:07,851 INFO L314 BasicCegarLoop]: Found error trace
[2018-01-24 15:43:07,851 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 15:43:07,851 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-24 15:43:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244567, now seen corresponding path program 1 times
[2018-01-24 15:43:07,851 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-01-24 15:43:07,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:07,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:43:07,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 15:43:07,853 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 15:43:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:43:07,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-24 15:43:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 15:43:08,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-24 15:43:08,098 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-01-24 15:43:08,100 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions:
[2018-01-24 15:43:08,102 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [9], [10], [13], [16], [20], [23], [26], [32], [36], [41], [117], [118], [122], [123], [124], [125], [128], [129], [131], [134], [135], [138], [144], [145], [148], [151], [154], [178], [179], [180], [181], [183], [184], [185]
[2018-01-24 15:43:08,159 INFO L147 AbstractInterpreter]: Using domain VPDomain
[2018-01-24 15:43:08,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2)
Received shutdown request...
[2018-01-24 15:44:00,796 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine
[2018-01-24 15:44:00,796 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time
[2018-01-24 15:44:00,797 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2018-01-24 15:44:00,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-24 15:44:00,797 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-24 15:44:00,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 15:44:00,803 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-01-24 15:44:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 15:44:00,862 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-24 15:44:00,870 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants
[2018-01-24 15:44:00,870 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-01-24 15:44:00,876 WARN L187 ceAbstractionStarter]: Timeout
[2018-01-24 15:44:00,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:44:00 BoogieIcfgContainer
[2018-01-24 15:44:00,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-24 15:44:00,877 INFO L168 Benchmark]: Toolchain (without parser) took 58830.97 ms. Allocated memory was 302.5 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 262.6 MB in the beginning and 990.8 MB in the end (delta: -728.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB.
[2018-01-24 15:44:00,878 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-24 15:44:00,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.23 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 250.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB.
[2018-01-24 15:44:00,879 INFO L168 Benchmark]: Boogie Preprocessor took 37.73 ms. Allocated memory is still 302.5 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-24 15:44:00,879 INFO L168 Benchmark]: RCFGBuilder took 530.87 ms. Allocated memory is still 302.5 MB. Free memory was 248.5 MB in the beginning and 214.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB.
[2018-01-24 15:44:00,879 INFO L168 Benchmark]: TraceAbstraction took 58045.09 ms. Allocated memory was 302.5 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 214.9 MB in the beginning and 990.8 MB in the end (delta: -775.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB.
[2018-01-24 15:44:00,881 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.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 208.23 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 250.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 37.73 ms. Allocated memory is still 302.5 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 530.87 ms. Allocated memory is still 302.5 MB. Free memory was 248.5 MB in the beginning and 214.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 58045.09 ms. Allocated memory was 302.5 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 214.9 MB in the beginning and 990.8 MB in the end (delta: -775.9 MB). Peak memory consumption was 1.2 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 559). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 131 locations, 55 error locations. TIMEOUT Result, 57.9s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1075 SDtfs, 696 SDslu, 2443 SDs, 0 SdLazy, 2032 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 183 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 36871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-44-00-892.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-44-00-892.csv
Completed graceful shutdown