java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:47:11,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:47:11,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:47:11,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:47:11,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:47:11,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:47:11,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:47:11,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:47:11,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:47:11,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:47:11,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:47:11,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:47:11,827 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:47:11,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:47:11,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:47:11,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:47:11,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:47:11,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:47:11,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:47:11,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:47:11,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:47:11,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:47:11,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:47:11,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:47:11,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:47:11,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:47:11,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:47:11,872 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:47:11,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:47:11,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:47:11,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:47:11,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:47:11,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:47:11,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:47:11,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:47:11,884 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:47:11,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:47:11,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:47:11,884 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:47:11,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:47:11,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:47:11,885 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:47:11,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:47:11,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:47:11,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:47:11,886 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:47:11,886 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:47:11,886 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:47:11,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:47:11,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:47:11,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:47:11,887 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:47:11,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:47:11,887 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:47:11,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:47:11,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:47:11,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:47:11,888 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:47:11,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:47:11,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:47:11,888 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:47:11,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:47:11,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:47:11,889 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:47:11,890 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:47:11,890 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:47:11,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:47:11,935 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:47:11,939 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:47:11,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:47:11,941 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:47:11,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-01-28 22:47:12,123 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:47:12,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:47:12,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:47:12,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:47:12,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:47:12,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45875f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12, skipping insertion in model container [2018-01-28 22:47:12,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,151 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:47:12,191 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:47:12,314 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:47:12,340 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:47:12,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12 WrapperNode [2018-01-28 22:47:12,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:47:12,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:47:12,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:47:12,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:47:12,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (1/1) ... [2018-01-28 22:47:12,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:47:12,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:47:12,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:47:12,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:47:12,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (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-28 22:47:12,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:47:12,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:47:12,444 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:47:12,444 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:47:12,445 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:47:12,445 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:47:12,445 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:47:12,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:47:12,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:47:12,445 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:47:12,446 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:47:12,446 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:47:12,446 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:47:12,446 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-28 22:47:12,446 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:47:12,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:47:12,447 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:47:13,032 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:47:13,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:47:13 BoogieIcfgContainer [2018-01-28 22:47:13,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:47:13,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:47:13,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:47:13,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:47:13,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:47:12" (1/3) ... [2018-01-28 22:47:13,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15241641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:47:13, skipping insertion in model container [2018-01-28 22:47:13,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:12" (2/3) ... [2018-01-28 22:47:13,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15241641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:47:13, skipping insertion in model container [2018-01-28 22:47:13,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:47:13" (3/3) ... [2018-01-28 22:47:13,040 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-01-28 22:47:13,047 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:47:13,054 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-01-28 22:47:13,096 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:47:13,096 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:47:13,096 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:47:13,096 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:47:13,096 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:47:13,096 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:47:13,096 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:47:13,097 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:47:13,097 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:47:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-01-28 22:47:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-28 22:47:13,122 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:13,123 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:13,123 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -219291675, now seen corresponding path program 1 times [2018-01-28 22:47:13,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:13,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:13,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:13,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:13,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:13,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:13,270 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-28 22:47:13,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:13,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:13,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:13,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:13,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:13,376 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 4 states. [2018-01-28 22:47:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:13,704 INFO L93 Difference]: Finished difference Result 383 states and 444 transitions. [2018-01-28 22:47:13,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:47:13,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-28 22:47:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:13,719 INFO L225 Difference]: With dead ends: 383 [2018-01-28 22:47:13,719 INFO L226 Difference]: Without dead ends: 202 [2018-01-28 22:47:13,724 INFO L533 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-28 22:47:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-28 22:47:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2018-01-28 22:47:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-28 22:47:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 180 transitions. [2018-01-28 22:47:13,774 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 180 transitions. Word has length 9 [2018-01-28 22:47:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:13,774 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 180 transitions. [2018-01-28 22:47:13,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 180 transitions. [2018-01-28 22:47:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-28 22:47:13,775 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:13,775 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:13,775 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash -219291674, now seen corresponding path program 1 times [2018-01-28 22:47:13,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:13,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:13,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:13,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:13,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:13,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:13,871 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-28 22:47:13,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:13,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:13,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:13,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:13,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:13,874 INFO L87 Difference]: Start difference. First operand 175 states and 180 transitions. Second operand 4 states. [2018-01-28 22:47:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:14,034 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions. [2018-01-28 22:47:14,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:47:14,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-28 22:47:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:14,036 INFO L225 Difference]: With dead ends: 175 [2018-01-28 22:47:14,036 INFO L226 Difference]: Without dead ends: 172 [2018-01-28 22:47:14,038 INFO L533 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-28 22:47:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-28 22:47:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-28 22:47:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-28 22:47:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 177 transitions. [2018-01-28 22:47:14,050 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 177 transitions. Word has length 9 [2018-01-28 22:47:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:14,050 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 177 transitions. [2018-01-28 22:47:14,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2018-01-28 22:47:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 22:47:14,051 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:14,051 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:14,051 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash -415190554, now seen corresponding path program 1 times [2018-01-28 22:47:14,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:14,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:14,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:14,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:14,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:14,107 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-28 22:47:14,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:14,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:14,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:14,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:14,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:14,108 INFO L87 Difference]: Start difference. First operand 172 states and 177 transitions. Second operand 4 states. [2018-01-28 22:47:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:14,224 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2018-01-28 22:47:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:47:14,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-28 22:47:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:14,226 INFO L225 Difference]: With dead ends: 195 [2018-01-28 22:47:14,226 INFO L226 Difference]: Without dead ends: 187 [2018-01-28 22:47:14,227 INFO L533 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-28 22:47:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-28 22:47:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 168. [2018-01-28 22:47:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-28 22:47:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2018-01-28 22:47:14,238 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 14 [2018-01-28 22:47:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:14,238 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2018-01-28 22:47:14,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2018-01-28 22:47:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 22:47:14,239 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:14,239 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:14,240 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash -415190553, now seen corresponding path program 1 times [2018-01-28 22:47:14,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:14,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:14,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:14,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:14,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:14,304 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-28 22:47:14,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:14,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:14,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:14,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:14,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:14,306 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 4 states. [2018-01-28 22:47:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:14,429 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-01-28 22:47:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:47:14,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-28 22:47:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:14,430 INFO L225 Difference]: With dead ends: 192 [2018-01-28 22:47:14,430 INFO L226 Difference]: Without dead ends: 184 [2018-01-28 22:47:14,431 INFO L533 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-28 22:47:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-28 22:47:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176. [2018-01-28 22:47:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-28 22:47:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 183 transitions. [2018-01-28 22:47:14,443 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 183 transitions. Word has length 14 [2018-01-28 22:47:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:14,444 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 183 transitions. [2018-01-28 22:47:14,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 183 transitions. [2018-01-28 22:47:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:47:14,445 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:14,445 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:14,445 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1097304755, now seen corresponding path program 1 times [2018-01-28 22:47:14,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:14,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:14,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:14,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:14,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:14,575 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-28 22:47:14,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:14,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:14,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:14,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:14,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:14,576 INFO L87 Difference]: Start difference. First operand 176 states and 183 transitions. Second operand 4 states. [2018-01-28 22:47:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:14,749 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-01-28 22:47:14,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:47:14,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-28 22:47:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:14,751 INFO L225 Difference]: With dead ends: 197 [2018-01-28 22:47:14,751 INFO L226 Difference]: Without dead ends: 181 [2018-01-28 22:47:14,752 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-28 22:47:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2018-01-28 22:47:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-28 22:47:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-01-28 22:47:14,760 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 23 [2018-01-28 22:47:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:14,761 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-01-28 22:47:14,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-01-28 22:47:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:47:14,762 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:14,762 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:14,762 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1097304756, now seen corresponding path program 1 times [2018-01-28 22:47:14,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:14,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:14,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:14,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:14,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:14,891 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-28 22:47:14,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:14,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:47:14,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:47:14,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:47:14,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:14,892 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 7 states. [2018-01-28 22:47:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:15,176 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-01-28 22:47:15,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:47:15,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-28 22:47:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:15,177 INFO L225 Difference]: With dead ends: 213 [2018-01-28 22:47:15,177 INFO L226 Difference]: Without dead ends: 206 [2018-01-28 22:47:15,178 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:47:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-28 22:47:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 178. [2018-01-28 22:47:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-28 22:47:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2018-01-28 22:47:15,186 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 23 [2018-01-28 22:47:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:15,186 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2018-01-28 22:47:15,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:47:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2018-01-28 22:47:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:47:15,187 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:15,187 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:15,187 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2052084938, now seen corresponding path program 1 times [2018-01-28 22:47:15,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:15,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:15,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:15,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:15,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:15,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:15,250 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-28 22:47:15,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:15,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:47:15,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:47:15,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:47:15,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:15,252 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand 5 states. [2018-01-28 22:47:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:15,421 INFO L93 Difference]: Finished difference Result 240 states and 257 transitions. [2018-01-28 22:47:15,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:47:15,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-28 22:47:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:15,423 INFO L225 Difference]: With dead ends: 240 [2018-01-28 22:47:15,423 INFO L226 Difference]: Without dead ends: 239 [2018-01-28 22:47:15,424 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-28 22:47:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 177. [2018-01-28 22:47:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-28 22:47:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2018-01-28 22:47:15,433 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 25 [2018-01-28 22:47:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:15,434 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2018-01-28 22:47:15,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:47:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2018-01-28 22:47:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:47:15,435 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:15,435 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:15,435 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2052084937, now seen corresponding path program 1 times [2018-01-28 22:47:15,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:15,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:15,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:15,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:15,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:15,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:15,543 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-28 22:47:15,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:15,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:47:15,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:47:15,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:47:15,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:15,544 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 5 states. [2018-01-28 22:47:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:15,781 INFO L93 Difference]: Finished difference Result 267 states and 285 transitions. [2018-01-28 22:47:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:47:15,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-28 22:47:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:15,784 INFO L225 Difference]: With dead ends: 267 [2018-01-28 22:47:15,784 INFO L226 Difference]: Without dead ends: 266 [2018-01-28 22:47:15,784 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-28 22:47:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 176. [2018-01-28 22:47:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-28 22:47:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-01-28 22:47:15,793 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 25 [2018-01-28 22:47:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:15,794 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-01-28 22:47:15,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:47:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-01-28 22:47:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-28 22:47:15,795 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:15,795 INFO L330 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-28 22:47:15,795 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:15,795 INFO L82 PathProgramCache]: Analyzing trace with hash -646814050, now seen corresponding path program 1 times [2018-01-28 22:47:15,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:15,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:15,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:15,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:15,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:15,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:15,987 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-28 22:47:15,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:15,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:47:15,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:47:15,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:47:15,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:47:15,988 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 9 states. [2018-01-28 22:47:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:16,502 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2018-01-28 22:47:16,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:47:16,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-28 22:47:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:16,503 INFO L225 Difference]: With dead ends: 192 [2018-01-28 22:47:16,503 INFO L226 Difference]: Without dead ends: 191 [2018-01-28 22:47:16,504 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:47:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-28 22:47:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175. [2018-01-28 22:47:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-28 22:47:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions. [2018-01-28 22:47:16,510 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 30 [2018-01-28 22:47:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:16,510 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 185 transitions. [2018-01-28 22:47:16,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:47:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2018-01-28 22:47:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-28 22:47:16,511 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:16,511 INFO L330 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-28 22:47:16,512 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash -646814049, now seen corresponding path program 1 times [2018-01-28 22:47:16,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:16,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:16,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:16,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:16,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:16,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:16,674 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-28 22:47:16,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:16,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:47:16,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:47:16,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:47:16,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:47:16,675 INFO L87 Difference]: Start difference. First operand 175 states and 185 transitions. Second operand 10 states. [2018-01-28 22:47:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:17,186 INFO L93 Difference]: Finished difference Result 222 states and 233 transitions. [2018-01-28 22:47:17,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:47:17,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-01-28 22:47:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:17,220 INFO L225 Difference]: With dead ends: 222 [2018-01-28 22:47:17,220 INFO L226 Difference]: Without dead ends: 211 [2018-01-28 22:47:17,221 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:47:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-28 22:47:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 182. [2018-01-28 22:47:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-28 22:47:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-01-28 22:47:17,228 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 30 [2018-01-28 22:47:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:17,229 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-01-28 22:47:17,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:47:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-01-28 22:47:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:47:17,230 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:17,230 INFO L330 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] [2018-01-28 22:47:17,231 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1093593353, now seen corresponding path program 1 times [2018-01-28 22:47:17,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:17,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:17,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:17,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:17,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:17,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:17,308 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-28 22:47:17,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:17,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:47:17,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:47:17,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:47:17,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:17,310 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 8 states. [2018-01-28 22:47:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:17,513 INFO L93 Difference]: Finished difference Result 259 states and 274 transitions. [2018-01-28 22:47:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:47:17,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-28 22:47:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:17,514 INFO L225 Difference]: With dead ends: 259 [2018-01-28 22:47:17,514 INFO L226 Difference]: Without dead ends: 214 [2018-01-28 22:47:17,515 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:47:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-28 22:47:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 182. [2018-01-28 22:47:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-28 22:47:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2018-01-28 22:47:17,521 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 37 [2018-01-28 22:47:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:17,522 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2018-01-28 22:47:17,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:47:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2018-01-28 22:47:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:47:17,523 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:17,523 INFO L330 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] [2018-01-28 22:47:17,523 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2000775916, now seen corresponding path program 1 times [2018-01-28 22:47:17,523 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:17,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:17,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:17,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:17,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:17,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:17,590 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-28 22:47:17,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:17,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:47:17,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:47:17,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:47:17,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:17,591 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 5 states. [2018-01-28 22:47:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:17,987 INFO L93 Difference]: Finished difference Result 277 states and 292 transitions. [2018-01-28 22:47:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:47:17,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-28 22:47:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:17,988 INFO L225 Difference]: With dead ends: 277 [2018-01-28 22:47:17,988 INFO L226 Difference]: Without dead ends: 276 [2018-01-28 22:47:17,989 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-01-28 22:47:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 181. [2018-01-28 22:47:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-28 22:47:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 190 transitions. [2018-01-28 22:47:17,996 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 190 transitions. Word has length 38 [2018-01-28 22:47:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:17,996 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 190 transitions. [2018-01-28 22:47:17,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:47:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 190 transitions. [2018-01-28 22:47:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:47:17,997 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:17,998 INFO L330 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] [2018-01-28 22:47:17,998 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2000775917, now seen corresponding path program 1 times [2018-01-28 22:47:17,998 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:17,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:17,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:17,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:18,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:18,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:18,079 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-28 22:47:18,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:18,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:47:18,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:47:18,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:47:18,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:18,081 INFO L87 Difference]: Start difference. First operand 181 states and 190 transitions. Second operand 5 states. [2018-01-28 22:47:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:18,262 INFO L93 Difference]: Finished difference Result 304 states and 321 transitions. [2018-01-28 22:47:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:47:18,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-28 22:47:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:18,264 INFO L225 Difference]: With dead ends: 304 [2018-01-28 22:47:18,264 INFO L226 Difference]: Without dead ends: 303 [2018-01-28 22:47:18,264 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-28 22:47:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 180. [2018-01-28 22:47:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-28 22:47:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2018-01-28 22:47:18,272 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 38 [2018-01-28 22:47:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:18,272 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2018-01-28 22:47:18,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:47:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2018-01-28 22:47:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:47:18,274 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:18,274 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:18,274 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1556041730, now seen corresponding path program 1 times [2018-01-28 22:47:18,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:18,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:18,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:18,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:18,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:18,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:18,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:47:18,430 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:47:18,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:18,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:47:18,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:47:18,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:47:18,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:47:18,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:47:18,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-28 22:47:18,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-28 22:47:18,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:47:18,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-28 22:47:18,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:47:18,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2018-01-28 22:47:18,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-28 22:47:18,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-28 22:47:18,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-28 22:47:18,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-28 22:47:18,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-01-28 22:47:18,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-28 22:47:18,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-28 22:47:18,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-28 22:47:18,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:47:18,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-28 22:47:18,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:18,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-01-28 22:47:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:18,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:47:18,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-01-28 22:47:18,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:47:18,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:47:18,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:18,913 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand 8 states. [2018-01-28 22:47:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:19,515 INFO L93 Difference]: Finished difference Result 332 states and 351 transitions. [2018-01-28 22:47:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:47:19,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-28 22:47:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:19,516 INFO L225 Difference]: With dead ends: 332 [2018-01-28 22:47:19,516 INFO L226 Difference]: Without dead ends: 261 [2018-01-28 22:47:19,516 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:47:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-28 22:47:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 204. [2018-01-28 22:47:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-28 22:47:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 215 transitions. [2018-01-28 22:47:19,526 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 215 transitions. Word has length 42 [2018-01-28 22:47:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:19,527 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 215 transitions. [2018-01-28 22:47:19,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:47:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 215 transitions. [2018-01-28 22:47:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:47:19,527 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:19,527 INFO L330 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, 1, 1, 1] [2018-01-28 22:47:19,528 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1620217993, now seen corresponding path program 1 times [2018-01-28 22:47:19,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:19,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:19,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:19,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:19,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:19,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:19,822 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-28 22:47:19,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:19,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:47:19,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:47:19,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:47:19,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:19,823 INFO L87 Difference]: Start difference. First operand 204 states and 215 transitions. Second operand 8 states. [2018-01-28 22:47:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:20,570 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-01-28 22:47:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:47:20,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-28 22:47:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:20,571 INFO L225 Difference]: With dead ends: 207 [2018-01-28 22:47:20,571 INFO L226 Difference]: Without dead ends: 206 [2018-01-28 22:47:20,572 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:47:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-28 22:47:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-28 22:47:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-28 22:47:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 214 transitions. [2018-01-28 22:47:20,582 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 214 transitions. Word has length 43 [2018-01-28 22:47:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:20,582 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 214 transitions. [2018-01-28 22:47:20,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:47:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 214 transitions. [2018-01-28 22:47:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:47:20,583 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:20,583 INFO L330 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, 1, 1, 1] [2018-01-28 22:47:20,583 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:20,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1620217994, now seen corresponding path program 1 times [2018-01-28 22:47:20,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:20,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:20,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:20,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:20,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:20,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:20,778 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-28 22:47:20,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:20,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:47:20,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:47:20,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:47:20,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:47:20,779 INFO L87 Difference]: Start difference. First operand 203 states and 214 transitions. Second operand 9 states. [2018-01-28 22:47:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:21,238 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-01-28 22:47:21,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:47:21,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-28 22:47:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:21,247 INFO L225 Difference]: With dead ends: 209 [2018-01-28 22:47:21,247 INFO L226 Difference]: Without dead ends: 202 [2018-01-28 22:47:21,247 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:47:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-28 22:47:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 173. [2018-01-28 22:47:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-28 22:47:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-01-28 22:47:21,253 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 43 [2018-01-28 22:47:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:21,253 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-01-28 22:47:21,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:47:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-01-28 22:47:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 22:47:21,253 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:21,253 INFO L330 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, 1, 1, 1, 1] [2018-01-28 22:47:21,254 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash -319477457, now seen corresponding path program 1 times [2018-01-28 22:47:21,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:21,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:21,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:21,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:21,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:21,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:21,352 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-28 22:47:21,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:21,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:47:21,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:47:21,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:47:21,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:21,353 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 5 states. [2018-01-28 22:47:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:21,452 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-01-28 22:47:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:47:21,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-28 22:47:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:21,453 INFO L225 Difference]: With dead ends: 250 [2018-01-28 22:47:21,453 INFO L226 Difference]: Without dead ends: 177 [2018-01-28 22:47:21,454 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-28 22:47:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2018-01-28 22:47:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-28 22:47:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 179 transitions. [2018-01-28 22:47:21,463 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 179 transitions. Word has length 44 [2018-01-28 22:47:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:21,463 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 179 transitions. [2018-01-28 22:47:21,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:47:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 179 transitions. [2018-01-28 22:47:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:47:21,464 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:21,464 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:21,464 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash 457585015, now seen corresponding path program 1 times [2018-01-28 22:47:21,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:21,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:21,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:21,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:21,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:21,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 22:47:21,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:21,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:47:21,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:47:21,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:47:21,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:21,560 INFO L87 Difference]: Start difference. First operand 171 states and 179 transitions. Second operand 8 states. [2018-01-28 22:47:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:21,825 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2018-01-28 22:47:21,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:47:21,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-28 22:47:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:21,826 INFO L225 Difference]: With dead ends: 188 [2018-01-28 22:47:21,826 INFO L226 Difference]: Without dead ends: 185 [2018-01-28 22:47:21,827 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:47:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-28 22:47:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2018-01-28 22:47:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-28 22:47:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 178 transitions. [2018-01-28 22:47:21,835 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 178 transitions. Word has length 45 [2018-01-28 22:47:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:21,836 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 178 transitions. [2018-01-28 22:47:21,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:47:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 178 transitions. [2018-01-28 22:47:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 22:47:21,836 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:21,837 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:21,837 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1598807677, now seen corresponding path program 1 times [2018-01-28 22:47:21,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:21,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:21,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:21,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:21,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:21,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:21,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:47:21,914 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:47:21,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:21,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:47:21,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:47:21,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:47:21,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:21,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:21,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:21,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-28 22:47:21,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 22:47:21,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-28 22:47:21,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:21,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-28 22:47:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 22:47:22,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:47:22,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-01-28 22:47:22,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:47:22,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:47:22,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:47:22,046 INFO L87 Difference]: Start difference. First operand 171 states and 178 transitions. Second operand 9 states. [2018-01-28 22:47:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:22,275 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2018-01-28 22:47:22,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 22:47:22,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-01-28 22:47:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:22,309 INFO L225 Difference]: With dead ends: 234 [2018-01-28 22:47:22,309 INFO L226 Difference]: Without dead ends: 198 [2018-01-28 22:47:22,309 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:47:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-28 22:47:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 166. [2018-01-28 22:47:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-28 22:47:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 172 transitions. [2018-01-28 22:47:22,314 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 172 transitions. Word has length 51 [2018-01-28 22:47:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:22,314 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 172 transitions. [2018-01-28 22:47:22,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:47:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 172 transitions. [2018-01-28 22:47:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:47:22,315 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:22,315 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:22,315 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 685765606, now seen corresponding path program 1 times [2018-01-28 22:47:22,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:22,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:22,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:22,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:22,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:22,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:22,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:47:22,410 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:47:22,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:22,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:47:22,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-01-28 22:47:22,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-28 22:47:22,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:3 [2018-01-28 22:47:22,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:47:22,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:47:22,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:47:22,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:47:22,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:22,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-01-28 22:47:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:22,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:47:22,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-01-28 22:47:22,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 22:47:22,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 22:47:22,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:47:22,616 INFO L87 Difference]: Start difference. First operand 166 states and 172 transitions. Second operand 16 states. [2018-01-28 22:47:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:23,119 INFO L93 Difference]: Finished difference Result 250 states and 261 transitions. [2018-01-28 22:47:23,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:47:23,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-01-28 22:47:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:23,120 INFO L225 Difference]: With dead ends: 250 [2018-01-28 22:47:23,120 INFO L226 Difference]: Without dead ends: 219 [2018-01-28 22:47:23,121 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:47:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-28 22:47:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 182. [2018-01-28 22:47:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-28 22:47:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions. [2018-01-28 22:47:23,127 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 54 [2018-01-28 22:47:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:23,128 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions. [2018-01-28 22:47:23,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 22:47:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions. [2018-01-28 22:47:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 22:47:23,129 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:23,129 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:47:23,129 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash -216103110, now seen corresponding path program 1 times [2018-01-28 22:47:23,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:23,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:23,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:23,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:23,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:47:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:47:23,187 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 22:47:23,213 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-28 22:47:23,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:47:23 BoogieIcfgContainer [2018-01-28 22:47:23,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:47:23,237 INFO L168 Benchmark]: Toolchain (without parser) took 11113.14 ms. Allocated memory was 294.6 MB in the beginning and 566.2 MB in the end (delta: 271.6 MB). Free memory was 254.7 MB in the beginning and 365.5 MB in the end (delta: -110.8 MB). Peak memory consumption was 160.8 MB. Max. memory is 5.3 GB. [2018-01-28 22:47:23,239 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 294.6 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:47:23,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.65 ms. Allocated memory is still 294.6 MB. Free memory was 253.7 MB in the beginning and 241.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:47:23,239 INFO L168 Benchmark]: Boogie Preprocessor took 41.21 ms. Allocated memory is still 294.6 MB. Free memory was 241.6 MB in the beginning and 239.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:47:23,240 INFO L168 Benchmark]: RCFGBuilder took 639.31 ms. Allocated memory is still 294.6 MB. Free memory was 239.6 MB in the beginning and 195.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 5.3 GB. [2018-01-28 22:47:23,240 INFO L168 Benchmark]: TraceAbstraction took 10202.80 ms. Allocated memory was 294.6 MB in the beginning and 566.2 MB in the end (delta: 271.6 MB). Free memory was 195.3 MB in the beginning and 365.5 MB in the end (delta: -170.2 MB). Peak memory consumption was 101.4 MB. Max. memory is 5.3 GB. [2018-01-28 22:47:23,242 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.16 ms. Allocated memory is still 294.6 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.65 ms. Allocated memory is still 294.6 MB. Free memory was 253.7 MB in the beginning and 241.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.21 ms. Allocated memory is still 294.6 MB. Free memory was 241.6 MB in the beginning and 239.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 639.31 ms. Allocated memory is still 294.6 MB. Free memory was 239.6 MB in the beginning and 195.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10202.80 ms. Allocated memory was 294.6 MB in the beginning and 566.2 MB in the end (delta: 271.6 MB). Free memory was 195.3 MB in the beginning and 365.5 MB in the end (delta: -170.2 MB). Peak memory consumption was 101.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={19:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L993] FCALL list->next = null VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L994] FCALL list->prev = null VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L995] FCALL list->colour = BLACK VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L997] struct TSLL* end = list; VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1026] end = null VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1027] end = list VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1030] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1031] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1031] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1032] COND TRUE null != end VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1034] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1034] COND FALSE !(RED == end->colour) VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1041] EXPR, FCALL end->next VAL [end={15:0}, end->next={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1041] end = end->next VAL [end={19:0}, end->next={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1032] COND FALSE !(null != end) VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1045] COND TRUE null != list VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1047] EXPR, FCALL list->colour VAL [end={19:0}, list={15:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1047] COND FALSE !(RED == list->colour) VAL [end={19:0}, list={15:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1056] EXPR, FCALL list->next VAL [end={19:0}, list={15:0}, list->next={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1056] end = list->next VAL [end={19:0}, list={15:0}, list->next={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1057] FCALL free(list) VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1058] list = end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1045] COND FALSE !(null != list) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] [L1062] return 0; VAL [\result=0, end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 192 locations, 67 error locations. UNSAFE Result, 10.1s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2469 SDtfs, 5239 SDslu, 5689 SDs, 0 SdLazy, 5300 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 158 SyntacticMatches, 16 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 724 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 839 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 169377 SizeOfPredicates, 34 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 8/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-47-23-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-47-23-250.csv Received shutdown request...