java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:14:53,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:14:53,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:14:53,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:14:53,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:14:53,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:14:53,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:14:53,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:14:53,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:14:53,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:14:53,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:14:53,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:14:53,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:14:53,469 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:14:53,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:14:53,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:14:53,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:14:53,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:14:53,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:14:53,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:14:53,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:14:53,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:14:53,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:14:53,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:14:53,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:14:53,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:14:53,481 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:14:53,482 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:14:53,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:14:53,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:14:53,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:14:53,483 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:14:53,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:14:53,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:14:53,494 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:14:53,494 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:14:53,494 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:14:53,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:14:53,495 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:14:53,495 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:14:53,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:14:53,495 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:14:53,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:14:53,495 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:14:53,496 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:14:53,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:14:53,496 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:14:53,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:14:53,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:14:53,496 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:14:53,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:14:53,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:14:53,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:14:53,497 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:14:53,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:14:53,497 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:14:53,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:14:53,534 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:14:53,537 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:14:53,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:14:53,539 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:14:53,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_true-valid-memsafety.i [2018-02-04 13:14:53,671 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:14:53,673 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:14:53,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:14:53,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:14:53,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:14:53,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bd4086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53, skipping insertion in model container [2018-02-04 13:14:53,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,698 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:14:53,727 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:14:53,820 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:14:53,838 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:14:53,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53 WrapperNode [2018-02-04 13:14:53,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:14:53,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:14:53,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:14:53,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:14:53,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... [2018-02-04 13:14:53,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:14:53,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:14:53,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:14:53,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:14:53,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:14:53,911 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:14:53,911 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:14:53,911 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-04 13:14:53,911 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-04 13:14:53,911 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 13:14:53,911 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:14:53,911 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:14:53,911 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:14:53,911 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:14:53,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:14:54,329 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:14:54,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:14:54 BoogieIcfgContainer [2018-02-04 13:14:54,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:14:54,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:14:54,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:14:54,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:14:54,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:14:53" (1/3) ... [2018-02-04 13:14:54,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faf7f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:14:54, skipping insertion in model container [2018-02-04 13:14:54,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:14:53" (2/3) ... [2018-02-04 13:14:54,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faf7f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:14:54, skipping insertion in model container [2018-02-04 13:14:54,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:14:54" (3/3) ... [2018-02-04 13:14:54,334 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_true-valid-memsafety.i [2018-02-04 13:14:54,339 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:14:54,344 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-04 13:14:54,368 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:14:54,368 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:14:54,368 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:14:54,368 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:14:54,368 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:14:54,368 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:14:54,368 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:14:54,368 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:14:54,369 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:14:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-02-04 13:14:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:14:54,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:54,388 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:54,388 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1490553648, now seen corresponding path program 1 times [2018-02-04 13:14:54,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:54,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:54,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:54,422 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:54,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:54,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:54,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:54,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:14:54,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:14:54,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:14:54,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:14:54,545 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-02-04 13:14:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:54,737 INFO L93 Difference]: Finished difference Result 211 states and 223 transitions. [2018-02-04 13:14:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:14:54,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:14:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:54,747 INFO L225 Difference]: With dead ends: 211 [2018-02-04 13:14:54,747 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 13:14:54,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:14:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 13:14:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 13:14:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 13:14:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 220 transitions. [2018-02-04 13:14:54,790 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 220 transitions. Word has length 7 [2018-02-04 13:14:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:54,790 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 220 transitions. [2018-02-04 13:14:54,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:14:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 220 transitions. [2018-02-04 13:14:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:14:54,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:54,791 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:54,791 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1490553649, now seen corresponding path program 1 times [2018-02-04 13:14:54,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:54,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:54,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:54,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:54,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:54,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:54,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:54,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:14:54,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:14:54,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:14:54,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:14:54,843 INFO L87 Difference]: Start difference. First operand 208 states and 220 transitions. Second operand 3 states. [2018-02-04 13:14:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:54,992 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2018-02-04 13:14:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:14:54,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:14:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:54,997 INFO L225 Difference]: With dead ends: 209 [2018-02-04 13:14:54,998 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 13:14:54,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:14:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 13:14:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-02-04 13:14:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 13:14:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 219 transitions. [2018-02-04 13:14:55,011 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 219 transitions. Word has length 7 [2018-02-04 13:14:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:55,011 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 219 transitions. [2018-02-04 13:14:55,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:14:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2018-02-04 13:14:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:14:55,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:55,012 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:55,012 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1508922073, now seen corresponding path program 1 times [2018-02-04 13:14:55,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:55,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:55,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:55,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:55,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:55,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:55,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:14:55,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:14:55,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:14:55,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:14:55,075 INFO L87 Difference]: Start difference. First operand 207 states and 219 transitions. Second operand 5 states. [2018-02-04 13:14:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:55,263 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-02-04 13:14:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:14:55,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:14:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:55,264 INFO L225 Difference]: With dead ends: 205 [2018-02-04 13:14:55,264 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 13:14:55,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:14:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 13:14:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-04 13:14:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 13:14:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions. [2018-02-04 13:14:55,273 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 14 [2018-02-04 13:14:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:55,273 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 217 transitions. [2018-02-04 13:14:55,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:14:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 217 transitions. [2018-02-04 13:14:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:14:55,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:55,273 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:55,273 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1508922074, now seen corresponding path program 1 times [2018-02-04 13:14:55,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:55,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:55,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:55,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:55,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:55,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:55,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:14:55,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:14:55,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:14:55,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:14:55,376 INFO L87 Difference]: Start difference. First operand 205 states and 217 transitions. Second operand 7 states. [2018-02-04 13:14:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:55,679 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-02-04 13:14:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:14:55,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 13:14:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:55,681 INFO L225 Difference]: With dead ends: 225 [2018-02-04 13:14:55,681 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 13:14:55,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:14:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 13:14:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2018-02-04 13:14:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 13:14:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-02-04 13:14:55,685 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 14 [2018-02-04 13:14:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:55,685 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-02-04 13:14:55,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:14:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-02-04 13:14:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:14:55,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:55,686 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:55,686 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash -468055759, now seen corresponding path program 1 times [2018-02-04 13:14:55,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:55,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:55,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:55,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:55,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:55,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:55,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:14:55,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:14:55,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:14:55,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:14:55,717 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 4 states. [2018-02-04 13:14:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:55,827 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2018-02-04 13:14:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:14:55,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:14:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:55,828 INFO L225 Difference]: With dead ends: 212 [2018-02-04 13:14:55,828 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 13:14:55,829 INFO L554 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-02-04 13:14:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 13:14:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-02-04 13:14:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 13:14:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 226 transitions. [2018-02-04 13:14:55,835 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 226 transitions. Word has length 15 [2018-02-04 13:14:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:55,835 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 226 transitions. [2018-02-04 13:14:55,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:14:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2018-02-04 13:14:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:14:55,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:55,836 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:55,836 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash -468055758, now seen corresponding path program 1 times [2018-02-04 13:14:55,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:55,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:55,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:55,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:55,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:55,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:55,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:14:55,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:14:55,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:14:55,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:14:55,876 INFO L87 Difference]: Start difference. First operand 212 states and 226 transitions. Second operand 4 states. [2018-02-04 13:14:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:55,983 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-04 13:14:55,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:14:55,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:14:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:55,984 INFO L225 Difference]: With dead ends: 210 [2018-02-04 13:14:55,984 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 13:14:55,984 INFO L554 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-02-04 13:14:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 13:14:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-04 13:14:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 13:14:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-02-04 13:14:55,988 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 15 [2018-02-04 13:14:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:55,988 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-02-04 13:14:55,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:14:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-02-04 13:14:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:14:55,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:55,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:55,989 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1490864651, now seen corresponding path program 1 times [2018-02-04 13:14:55,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:55,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:55,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:55,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:55,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:56,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:56,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 13:14:56,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:14:56,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:14:56,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:14:56,212 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 13 states. [2018-02-04 13:14:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:56,937 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2018-02-04 13:14:56,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:14:56,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-04 13:14:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:56,939 INFO L225 Difference]: With dead ends: 212 [2018-02-04 13:14:56,939 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 13:14:56,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:14:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 13:14:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-02-04 13:14:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 13:14:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2018-02-04 13:14:56,946 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 20 [2018-02-04 13:14:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:56,947 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2018-02-04 13:14:56,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:14:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2018-02-04 13:14:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:14:56,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:56,947 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:56,951 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1804170703, now seen corresponding path program 1 times [2018-02-04 13:14:56,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:56,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:56,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:56,952 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:56,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:56,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:56,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:56,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:14:56,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:14:56,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:14:56,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:14:56,983 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand 4 states. [2018-02-04 13:14:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:57,003 INFO L93 Difference]: Finished difference Result 300 states and 317 transitions. [2018-02-04 13:14:57,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:14:57,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 13:14:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:57,005 INFO L225 Difference]: With dead ends: 300 [2018-02-04 13:14:57,005 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 13:14:57,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:14:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 13:14:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 264. [2018-02-04 13:14:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 13:14:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 317 transitions. [2018-02-04 13:14:57,011 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 317 transitions. Word has length 22 [2018-02-04 13:14:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:57,011 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 317 transitions. [2018-02-04 13:14:57,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:14:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 317 transitions. [2018-02-04 13:14:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 13:14:57,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:57,012 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:57,012 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash 265371579, now seen corresponding path program 1 times [2018-02-04 13:14:57,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:57,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:57,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:57,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:57,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:57,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:57,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:14:57,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:14:57,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:14:57,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:14:57,056 INFO L87 Difference]: Start difference. First operand 264 states and 317 transitions. Second operand 4 states. [2018-02-04 13:14:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:57,262 INFO L93 Difference]: Finished difference Result 277 states and 323 transitions. [2018-02-04 13:14:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:14:57,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-04 13:14:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:57,264 INFO L225 Difference]: With dead ends: 277 [2018-02-04 13:14:57,264 INFO L226 Difference]: Without dead ends: 277 [2018-02-04 13:14:57,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:14:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-04 13:14:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2018-02-04 13:14:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 13:14:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 315 transitions. [2018-02-04 13:14:57,271 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 315 transitions. Word has length 26 [2018-02-04 13:14:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:57,271 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 315 transitions. [2018-02-04 13:14:57,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:14:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 315 transitions. [2018-02-04 13:14:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 13:14:57,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:57,272 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:57,272 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 265371580, now seen corresponding path program 1 times [2018-02-04 13:14:57,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:57,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:57,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:57,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:57,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:57,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:57,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:14:57,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:14:57,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:14:57,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:14:57,322 INFO L87 Difference]: Start difference. First operand 266 states and 315 transitions. Second operand 5 states. [2018-02-04 13:14:57,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:57,504 INFO L93 Difference]: Finished difference Result 289 states and 331 transitions. [2018-02-04 13:14:57,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:14:57,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 13:14:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:57,505 INFO L225 Difference]: With dead ends: 289 [2018-02-04 13:14:57,505 INFO L226 Difference]: Without dead ends: 289 [2018-02-04 13:14:57,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:14:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-04 13:14:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 267. [2018-02-04 13:14:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-04 13:14:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 309 transitions. [2018-02-04 13:14:57,513 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 309 transitions. Word has length 26 [2018-02-04 13:14:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:57,513 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 309 transitions. [2018-02-04 13:14:57,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:14:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 309 transitions. [2018-02-04 13:14:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:14:57,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:57,514 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:57,514 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:57,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1933498913, now seen corresponding path program 1 times [2018-02-04 13:14:57,515 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:57,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:57,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:57,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:57,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:57,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:57,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:14:57,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:14:57,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:14:57,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:14:57,562 INFO L87 Difference]: Start difference. First operand 267 states and 309 transitions. Second operand 5 states. [2018-02-04 13:14:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:57,786 INFO L93 Difference]: Finished difference Result 338 states and 393 transitions. [2018-02-04 13:14:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:14:57,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 13:14:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:57,788 INFO L225 Difference]: With dead ends: 338 [2018-02-04 13:14:57,788 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 13:14:57,788 INFO L554 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-02-04 13:14:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 13:14:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 277. [2018-02-04 13:14:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-04 13:14:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 323 transitions. [2018-02-04 13:14:57,795 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 323 transitions. Word has length 32 [2018-02-04 13:14:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:57,795 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 323 transitions. [2018-02-04 13:14:57,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:14:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 323 transitions. [2018-02-04 13:14:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:14:57,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:57,796 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:57,796 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1933498914, now seen corresponding path program 1 times [2018-02-04 13:14:57,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:57,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:57,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:57,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:57,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:57,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:14:57,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:14:57,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:14:57,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:14:57,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:14:57,880 INFO L87 Difference]: Start difference. First operand 277 states and 323 transitions. Second operand 6 states. [2018-02-04 13:14:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:58,105 INFO L93 Difference]: Finished difference Result 285 states and 327 transitions. [2018-02-04 13:14:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:14:58,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 13:14:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:58,107 INFO L225 Difference]: With dead ends: 285 [2018-02-04 13:14:58,107 INFO L226 Difference]: Without dead ends: 285 [2018-02-04 13:14:58,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:14:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-04 13:14:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2018-02-04 13:14:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-04 13:14:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 319 transitions. [2018-02-04 13:14:58,113 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 319 transitions. Word has length 32 [2018-02-04 13:14:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:58,113 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 319 transitions. [2018-02-04 13:14:58,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:14:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 319 transitions. [2018-02-04 13:14:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 13:14:58,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:58,114 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:58,114 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1042211778, now seen corresponding path program 1 times [2018-02-04 13:14:58,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:58,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:58,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:58,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:58,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:58,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:58,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:14:58,207 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:14:58,225 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:58,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:14:58,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:14:58,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:14:58,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:58,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:58,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 13:14:58,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 13:14:58,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-02-04 13:14:58,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 13:14:58,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-02-04 13:14:58,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-04 13:14:58,415 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 32 treesize of output 1 [2018-02-04 13:14:58,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27 [2018-02-04 13:14:58,436 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 31 treesize of output 25 [2018-02-04 13:14:58,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 10 [2018-02-04 13:14:58,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:58,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:58,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-02-04 13:14:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:14:58,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:14:58,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-02-04 13:14:58,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:14:58,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:14:58,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:14:58,496 INFO L87 Difference]: Start difference. First operand 277 states and 319 transitions. Second operand 13 states. [2018-02-04 13:14:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:58,927 INFO L93 Difference]: Finished difference Result 298 states and 339 transitions. [2018-02-04 13:14:58,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:14:58,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-02-04 13:14:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:58,962 INFO L225 Difference]: With dead ends: 298 [2018-02-04 13:14:58,962 INFO L226 Difference]: Without dead ends: 298 [2018-02-04 13:14:58,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:14:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-04 13:14:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 276. [2018-02-04 13:14:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 13:14:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2018-02-04 13:14:58,973 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 39 [2018-02-04 13:14:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:58,974 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2018-02-04 13:14:58,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:14:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2018-02-04 13:14:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 13:14:58,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:58,975 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:58,975 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1042211777, now seen corresponding path program 1 times [2018-02-04 13:14:58,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:58,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:58,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:58,976 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:58,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:59,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:59,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:14:59,239 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:14:59,249 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:59,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:14:59,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:14:59,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:14:59,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:14:59,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:59,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:59,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:14:59,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 13:14:59,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-02-04 13:14:59,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 13:14:59,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-02-04 13:14:59,353 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-02-04 13:14:59,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-02-04 13:14:59,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-02-04 13:14:59,441 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 32 treesize of output 1 [2018-02-04 13:14:59,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 13:14:59,465 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 32 treesize of output 1 [2018-02-04 13:14:59,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:119, output treesize:37 [2018-02-04 13:14:59,524 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 31 treesize of output 25 [2018-02-04 13:14:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 13:14:59,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-02-04 13:14:59,555 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-02-04 13:14:59,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:59,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:15 [2018-02-04 13:14:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:59,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:14:59,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-02-04 13:14:59,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:14:59,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:14:59,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:14:59,593 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand 16 states. [2018-02-04 13:15:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:00,117 INFO L93 Difference]: Finished difference Result 289 states and 327 transitions. [2018-02-04 13:15:00,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:15:00,117 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-04 13:15:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:00,118 INFO L225 Difference]: With dead ends: 289 [2018-02-04 13:15:00,118 INFO L226 Difference]: Without dead ends: 289 [2018-02-04 13:15:00,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:15:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-04 13:15:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2018-02-04 13:15:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 13:15:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 309 transitions. [2018-02-04 13:15:00,125 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 309 transitions. Word has length 39 [2018-02-04 13:15:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:00,125 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 309 transitions. [2018-02-04 13:15:00,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:15:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 309 transitions. [2018-02-04 13:15:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 13:15:00,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:00,126 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:00,126 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1212747529, now seen corresponding path program 1 times [2018-02-04 13:15:00,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:00,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:00,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,127 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:00,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:00,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:15:00,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:00,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:15:00,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:15:00,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:15:00,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:15:00,167 INFO L87 Difference]: Start difference. First operand 269 states and 309 transitions. Second operand 4 states. [2018-02-04 13:15:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:00,247 INFO L93 Difference]: Finished difference Result 271 states and 303 transitions. [2018-02-04 13:15:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:15:00,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-02-04 13:15:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:00,249 INFO L225 Difference]: With dead ends: 271 [2018-02-04 13:15:00,249 INFO L226 Difference]: Without dead ends: 271 [2018-02-04 13:15:00,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-04 13:15:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2018-02-04 13:15:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 13:15:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 297 transitions. [2018-02-04 13:15:00,253 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 297 transitions. Word has length 53 [2018-02-04 13:15:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:00,254 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 297 transitions. [2018-02-04 13:15:00,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:15:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 297 transitions. [2018-02-04 13:15:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 13:15:00,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:00,255 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:00,255 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1212747528, now seen corresponding path program 1 times [2018-02-04 13:15:00,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:00,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:00,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:00,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:00,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:15:00,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:00,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:15:00,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:15:00,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:15:00,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:15:00,309 INFO L87 Difference]: Start difference. First operand 265 states and 297 transitions. Second operand 4 states. [2018-02-04 13:15:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:00,408 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-02-04 13:15:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:15:00,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-02-04 13:15:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:00,409 INFO L225 Difference]: With dead ends: 267 [2018-02-04 13:15:00,410 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 13:15:00,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 13:15:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2018-02-04 13:15:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-04 13:15:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 285 transitions. [2018-02-04 13:15:00,413 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 285 transitions. Word has length 53 [2018-02-04 13:15:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:00,413 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 285 transitions. [2018-02-04 13:15:00,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:15:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 285 transitions. [2018-02-04 13:15:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 13:15:00,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:00,413 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:00,413 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1058644701, now seen corresponding path program 1 times [2018-02-04 13:15:00,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:00,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:00,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:00,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:00,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:15:00,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:00,436 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:00,442 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:00,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:15:00,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:00,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 13:15:00,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:15:00,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:15:00,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:00,494 INFO L87 Difference]: Start difference. First operand 261 states and 285 transitions. Second operand 5 states. [2018-02-04 13:15:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:00,520 INFO L93 Difference]: Finished difference Result 285 states and 309 transitions. [2018-02-04 13:15:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:15:00,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-02-04 13:15:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:00,522 INFO L225 Difference]: With dead ends: 285 [2018-02-04 13:15:00,522 INFO L226 Difference]: Without dead ends: 285 [2018-02-04 13:15:00,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-04 13:15:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2018-02-04 13:15:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-04 13:15:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 299 transitions. [2018-02-04 13:15:00,530 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 299 transitions. Word has length 54 [2018-02-04 13:15:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:00,530 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 299 transitions. [2018-02-04 13:15:00,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:15:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 299 transitions. [2018-02-04 13:15:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:15:00,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:00,533 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:00,533 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:00,533 INFO L82 PathProgramCache]: Analyzing trace with hash 962380090, now seen corresponding path program 2 times [2018-02-04 13:15:00,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:00,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:00,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,534 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:00,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:00,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:15:00,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:00,591 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:00,598 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:15:00,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 13:15:00,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:15:00,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:00,679 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true [2018-02-04 13:15:00,685 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true [2018-02-04 13:15:00,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:00,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:00,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-04 13:15:00,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-02-04 13:15:00,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:00,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:00,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:00,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-02-04 13:15:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 13:15:00,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:15:00,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2018-02-04 13:15:00,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:15:00,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:15:00,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2018-02-04 13:15:00,797 INFO L87 Difference]: Start difference. First operand 275 states and 299 transitions. Second operand 11 states. [2018-02-04 13:15:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:01,095 INFO L93 Difference]: Finished difference Result 341 states and 374 transitions. [2018-02-04 13:15:01,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:15:01,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-02-04 13:15:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:01,096 INFO L225 Difference]: With dead ends: 341 [2018-02-04 13:15:01,097 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 13:15:01,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=8, NotChecked=42, Total=182 [2018-02-04 13:15:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 13:15:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 308. [2018-02-04 13:15:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 13:15:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 338 transitions. [2018-02-04 13:15:01,100 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 338 transitions. Word has length 61 [2018-02-04 13:15:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:01,101 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 338 transitions. [2018-02-04 13:15:01,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:15:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 338 transitions. [2018-02-04 13:15:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 13:15:01,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:01,101 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:01,101 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash -574017474, now seen corresponding path program 1 times [2018-02-04 13:15:01,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:01,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:01,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:01,102 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:15:01,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:01,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:01,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:01,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 13:15:01,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:15:01,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:15:01,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:15:01,365 INFO L87 Difference]: Start difference. First operand 308 states and 338 transitions. Second operand 11 states. [2018-02-04 13:15:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:01,889 INFO L93 Difference]: Finished difference Result 331 states and 360 transitions. [2018-02-04 13:15:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:15:01,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 13:15:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:01,891 INFO L225 Difference]: With dead ends: 331 [2018-02-04 13:15:01,891 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 13:15:01,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:15:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 13:15:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 320. [2018-02-04 13:15:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-02-04 13:15:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 352 transitions. [2018-02-04 13:15:01,897 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 352 transitions. Word has length 68 [2018-02-04 13:15:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:01,897 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 352 transitions. [2018-02-04 13:15:01,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:15:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 352 transitions. [2018-02-04 13:15:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 13:15:01,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:01,898 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:01,898 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash -458915360, now seen corresponding path program 1 times [2018-02-04 13:15:01,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:01,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:01,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:01,899 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:01,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:01,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:01,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:01,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:15:01,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:15:01,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:15:01,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:15:01,944 INFO L87 Difference]: Start difference. First operand 320 states and 352 transitions. Second operand 4 states. [2018-02-04 13:15:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:02,027 INFO L93 Difference]: Finished difference Result 328 states and 358 transitions. [2018-02-04 13:15:02,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:15:02,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-02-04 13:15:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:02,029 INFO L225 Difference]: With dead ends: 328 [2018-02-04 13:15:02,029 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 13:15:02,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 13:15:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-02-04 13:15:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 13:15:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 356 transitions. [2018-02-04 13:15:02,035 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 356 transitions. Word has length 70 [2018-02-04 13:15:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:02,035 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 356 transitions. [2018-02-04 13:15:02,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:15:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 356 transitions. [2018-02-04 13:15:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 13:15:02,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:02,036 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:02,036 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:02,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1874971636, now seen corresponding path program 1 times [2018-02-04 13:15:02,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:02,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:02,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:02,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:02,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:02,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:02,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:02,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:15:02,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:15:02,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:15:02,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:15:02,330 INFO L87 Difference]: Start difference. First operand 326 states and 356 transitions. Second operand 8 states. [2018-02-04 13:15:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:02,809 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-02-04 13:15:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:15:02,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-02-04 13:15:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:02,810 INFO L225 Difference]: With dead ends: 333 [2018-02-04 13:15:02,810 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 13:15:02,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:15:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 13:15:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2018-02-04 13:15:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 13:15:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 359 transitions. [2018-02-04 13:15:02,814 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 359 transitions. Word has length 70 [2018-02-04 13:15:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:02,814 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 359 transitions. [2018-02-04 13:15:02,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:15:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 359 transitions. [2018-02-04 13:15:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 13:15:02,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:02,814 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:02,814 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:02,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1874971635, now seen corresponding path program 1 times [2018-02-04 13:15:02,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:02,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:02,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:02,815 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:02,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:02,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:03,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:03,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 13:15:03,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:15:03,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:15:03,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:15:03,046 INFO L87 Difference]: Start difference. First operand 329 states and 359 transitions. Second operand 12 states. [2018-02-04 13:15:03,487 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 16 [2018-02-04 13:15:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:03,747 INFO L93 Difference]: Finished difference Result 330 states and 356 transitions. [2018-02-04 13:15:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:15:03,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-02-04 13:15:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:03,751 INFO L225 Difference]: With dead ends: 330 [2018-02-04 13:15:03,751 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 13:15:03,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:15:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 13:15:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-02-04 13:15:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 13:15:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 356 transitions. [2018-02-04 13:15:03,756 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 356 transitions. Word has length 70 [2018-02-04 13:15:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:03,756 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 356 transitions. [2018-02-04 13:15:03,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:15:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 356 transitions. [2018-02-04 13:15:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 13:15:03,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:03,757 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:03,757 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1317082176, now seen corresponding path program 1 times [2018-02-04 13:15:03,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:03,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:03,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:03,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:03,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:03,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:03,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:03,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:15:03,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:15:03,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:15:03,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:15:03,815 INFO L87 Difference]: Start difference. First operand 328 states and 356 transitions. Second operand 6 states. [2018-02-04 13:15:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:03,904 INFO L93 Difference]: Finished difference Result 378 states and 411 transitions. [2018-02-04 13:15:03,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:15:03,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-02-04 13:15:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:03,907 INFO L225 Difference]: With dead ends: 378 [2018-02-04 13:15:03,907 INFO L226 Difference]: Without dead ends: 378 [2018-02-04 13:15:03,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:15:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-04 13:15:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 339. [2018-02-04 13:15:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 13:15:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 368 transitions. [2018-02-04 13:15:03,913 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 368 transitions. Word has length 70 [2018-02-04 13:15:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:03,913 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 368 transitions. [2018-02-04 13:15:03,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:15:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 368 transitions. [2018-02-04 13:15:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 13:15:03,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:03,914 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:03,914 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 116683043, now seen corresponding path program 1 times [2018-02-04 13:15:03,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:03,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:03,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:03,915 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:03,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:03,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:04,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:04,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:15:04,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:15:04,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:15:04,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:15:04,110 INFO L87 Difference]: Start difference. First operand 339 states and 368 transitions. Second operand 9 states. [2018-02-04 13:15:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:04,591 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-02-04 13:15:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:15:04,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-02-04 13:15:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:04,593 INFO L225 Difference]: With dead ends: 341 [2018-02-04 13:15:04,593 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 13:15:04,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:15:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 13:15:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 326. [2018-02-04 13:15:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 13:15:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 352 transitions. [2018-02-04 13:15:04,598 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 352 transitions. Word has length 72 [2018-02-04 13:15:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:04,598 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 352 transitions. [2018-02-04 13:15:04,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:15:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 352 transitions. [2018-02-04 13:15:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 13:15:04,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:04,599 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:04,599 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1230059536, now seen corresponding path program 1 times [2018-02-04 13:15:04,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:04,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:04,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:04,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:04,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:04,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:04,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:04,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:15:04,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:15:04,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:15:04,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:04,646 INFO L87 Difference]: Start difference. First operand 326 states and 352 transitions. Second operand 5 states. [2018-02-04 13:15:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:04,752 INFO L93 Difference]: Finished difference Result 325 states and 351 transitions. [2018-02-04 13:15:04,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:15:04,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-02-04 13:15:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:04,753 INFO L225 Difference]: With dead ends: 325 [2018-02-04 13:15:04,753 INFO L226 Difference]: Without dead ends: 325 [2018-02-04 13:15:04,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:15:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-04 13:15:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-02-04 13:15:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 13:15:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 351 transitions. [2018-02-04 13:15:04,757 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 351 transitions. Word has length 73 [2018-02-04 13:15:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:04,757 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 351 transitions. [2018-02-04 13:15:04,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:15:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 351 transitions. [2018-02-04 13:15:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 13:15:04,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:04,757 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:04,757 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1230059535, now seen corresponding path program 1 times [2018-02-04 13:15:04,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:04,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:04,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:04,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:04,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:04,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:04,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:04,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:15:04,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:15:04,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:15:04,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:15:04,844 INFO L87 Difference]: Start difference. First operand 325 states and 351 transitions. Second operand 6 states. [2018-02-04 13:15:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:05,041 INFO L93 Difference]: Finished difference Result 320 states and 346 transitions. [2018-02-04 13:15:05,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:15:05,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-02-04 13:15:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:05,042 INFO L225 Difference]: With dead ends: 320 [2018-02-04 13:15:05,042 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 13:15:05,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:15:05,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 13:15:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-02-04 13:15:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-02-04 13:15:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 346 transitions. [2018-02-04 13:15:05,047 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 346 transitions. Word has length 73 [2018-02-04 13:15:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:05,047 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 346 transitions. [2018-02-04 13:15:05,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:15:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 346 transitions. [2018-02-04 13:15:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 13:15:05,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:05,048 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:05,049 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:05,049 INFO L82 PathProgramCache]: Analyzing trace with hash 522860177, now seen corresponding path program 1 times [2018-02-04 13:15:05,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:05,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:05,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:05,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:05,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:05,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:05,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:15:05,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:15:05,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:15:05,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:15:05,124 INFO L87 Difference]: Start difference. First operand 320 states and 346 transitions. Second operand 7 states. [2018-02-04 13:15:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:05,299 INFO L93 Difference]: Finished difference Result 334 states and 362 transitions. [2018-02-04 13:15:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:15:05,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-02-04 13:15:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:05,300 INFO L225 Difference]: With dead ends: 334 [2018-02-04 13:15:05,300 INFO L226 Difference]: Without dead ends: 334 [2018-02-04 13:15:05,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:15:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-04 13:15:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 319. [2018-02-04 13:15:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 13:15:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 345 transitions. [2018-02-04 13:15:05,304 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 345 transitions. Word has length 74 [2018-02-04 13:15:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:05,304 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 345 transitions. [2018-02-04 13:15:05,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:15:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 345 transitions. [2018-02-04 13:15:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 13:15:05,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:05,305 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:05,305 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash 522860178, now seen corresponding path program 1 times [2018-02-04 13:15:05,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:05,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:05,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:05,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:05,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:05,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:05,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:15:05,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:15:05,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:15:05,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:15:05,448 INFO L87 Difference]: Start difference. First operand 319 states and 345 transitions. Second operand 9 states. [2018-02-04 13:15:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:05,696 INFO L93 Difference]: Finished difference Result 343 states and 371 transitions. [2018-02-04 13:15:05,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:15:05,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-02-04 13:15:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:05,697 INFO L225 Difference]: With dead ends: 343 [2018-02-04 13:15:05,697 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 13:15:05,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:15:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 13:15:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 318. [2018-02-04 13:15:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 13:15:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 344 transitions. [2018-02-04 13:15:05,701 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 344 transitions. Word has length 74 [2018-02-04 13:15:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:05,701 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 344 transitions. [2018-02-04 13:15:05,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:15:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 344 transitions. [2018-02-04 13:15:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 13:15:05,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:05,702 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:05,702 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2069402327, now seen corresponding path program 1 times [2018-02-04 13:15:05,703 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:05,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:05,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,703 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:05,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:05,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:05,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:05,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:15:05,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:15:05,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:15:05,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:05,755 INFO L87 Difference]: Start difference. First operand 318 states and 344 transitions. Second operand 5 states. [2018-02-04 13:15:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:05,875 INFO L93 Difference]: Finished difference Result 333 states and 361 transitions. [2018-02-04 13:15:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:15:05,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-02-04 13:15:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:05,876 INFO L225 Difference]: With dead ends: 333 [2018-02-04 13:15:05,876 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 13:15:05,876 INFO L554 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-02-04 13:15:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 13:15:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2018-02-04 13:15:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-04 13:15:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 343 transitions. [2018-02-04 13:15:05,881 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 343 transitions. Word has length 78 [2018-02-04 13:15:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:05,882 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 343 transitions. [2018-02-04 13:15:05,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:15:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 343 transitions. [2018-02-04 13:15:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 13:15:05,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:05,883 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:05,883 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:05,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2069402328, now seen corresponding path program 1 times [2018-02-04 13:15:05,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:05,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:05,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:05,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:05,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:06,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:06,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:15:06,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:15:06,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:15:06,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:15:06,042 INFO L87 Difference]: Start difference. First operand 317 states and 343 transitions. Second operand 10 states. [2018-02-04 13:15:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:06,248 INFO L93 Difference]: Finished difference Result 342 states and 370 transitions. [2018-02-04 13:15:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:15:06,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-02-04 13:15:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:06,249 INFO L225 Difference]: With dead ends: 342 [2018-02-04 13:15:06,249 INFO L226 Difference]: Without dead ends: 342 [2018-02-04 13:15:06,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:15:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-04 13:15:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 316. [2018-02-04 13:15:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 13:15:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-02-04 13:15:06,253 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 78 [2018-02-04 13:15:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:06,254 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-02-04 13:15:06,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:15:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-02-04 13:15:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 13:15:06,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:06,255 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:06,255 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:06,255 INFO L82 PathProgramCache]: Analyzing trace with hash -273037161, now seen corresponding path program 1 times [2018-02-04 13:15:06,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:06,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:06,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:06,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:06,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:06,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:06,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:06,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 13:15:06,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:15:06,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:15:06,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:15:06,538 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 17 states. [2018-02-04 13:15:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:07,184 INFO L93 Difference]: Finished difference Result 361 states and 395 transitions. [2018-02-04 13:15:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:15:07,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-02-04 13:15:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:07,185 INFO L225 Difference]: With dead ends: 361 [2018-02-04 13:15:07,185 INFO L226 Difference]: Without dead ends: 361 [2018-02-04 13:15:07,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:15:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-04 13:15:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 320. [2018-02-04 13:15:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-02-04 13:15:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 351 transitions. [2018-02-04 13:15:07,189 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 351 transitions. Word has length 79 [2018-02-04 13:15:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:07,189 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 351 transitions. [2018-02-04 13:15:07,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:15:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 351 transitions. [2018-02-04 13:15:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 13:15:07,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:07,190 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:07,190 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:07,190 INFO L82 PathProgramCache]: Analyzing trace with hash -273037160, now seen corresponding path program 1 times [2018-02-04 13:15:07,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:07,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:07,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:07,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:07,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:07,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:07,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:07,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 13:15:07,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:15:07,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:15:07,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:15:07,530 INFO L87 Difference]: Start difference. First operand 320 states and 351 transitions. Second operand 19 states. [2018-02-04 13:15:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:08,363 INFO L93 Difference]: Finished difference Result 366 states and 399 transitions. [2018-02-04 13:15:08,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:15:08,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2018-02-04 13:15:08,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:08,364 INFO L225 Difference]: With dead ends: 366 [2018-02-04 13:15:08,364 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 13:15:08,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:15:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 13:15:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 320. [2018-02-04 13:15:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-02-04 13:15:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 350 transitions. [2018-02-04 13:15:08,368 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 350 transitions. Word has length 79 [2018-02-04 13:15:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:08,368 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 350 transitions. [2018-02-04 13:15:08,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:15:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 350 transitions. [2018-02-04 13:15:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 13:15:08,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:08,369 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:08,369 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1496786919, now seen corresponding path program 1 times [2018-02-04 13:15:08,369 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:08,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:08,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:08,370 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:08,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:08,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:08,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:08,437 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:08,443 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:08,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:08,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 13:15:08,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:08,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:08,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 13:15:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:08,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:08,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-02-04 13:15:08,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:15:08,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:15:08,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:15:08,578 INFO L87 Difference]: Start difference. First operand 320 states and 350 transitions. Second operand 9 states. [2018-02-04 13:15:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:08,755 INFO L93 Difference]: Finished difference Result 321 states and 350 transitions. [2018-02-04 13:15:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:15:08,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-02-04 13:15:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:08,756 INFO L225 Difference]: With dead ends: 321 [2018-02-04 13:15:08,756 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 13:15:08,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:15:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 13:15:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-02-04 13:15:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 13:15:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions. [2018-02-04 13:15:08,758 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 83 [2018-02-04 13:15:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:08,758 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions. [2018-02-04 13:15:08,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:15:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions. [2018-02-04 13:15:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 13:15:08,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:08,759 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:08,759 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1496786920, now seen corresponding path program 1 times [2018-02-04 13:15:08,759 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:08,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:08,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:08,760 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:08,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:08,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:08,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:08,838 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:08,869 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:08,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:08,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:15:08,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:08,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:08,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:15:08,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-04 13:15:08,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:08,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:08,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-02-04 13:15:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:08,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:08,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-02-04 13:15:08,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:15:08,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:15:08,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:15:08,997 INFO L87 Difference]: Start difference. First operand 319 states and 348 transitions. Second operand 10 states. [2018-02-04 13:15:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:09,156 INFO L93 Difference]: Finished difference Result 321 states and 346 transitions. [2018-02-04 13:15:09,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:15:09,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-02-04 13:15:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:09,157 INFO L225 Difference]: With dead ends: 321 [2018-02-04 13:15:09,157 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 13:15:09,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:15:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 13:15:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2018-02-04 13:15:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 13:15:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 322 transitions. [2018-02-04 13:15:09,160 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 322 transitions. Word has length 83 [2018-02-04 13:15:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:09,160 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 322 transitions. [2018-02-04 13:15:09,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:15:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 322 transitions. [2018-02-04 13:15:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 13:15:09,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:09,161 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:09,161 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:09,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1495899267, now seen corresponding path program 1 times [2018-02-04 13:15:09,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:09,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:09,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:09,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:09,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:09,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:09,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:09,778 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:09,783 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:09,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:09,903 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-02-04 13:15:09,905 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-02-04 13:15:09,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:09,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:09,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:09,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-02-04 13:15:09,949 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 30 treesize of output 26 [2018-02-04 13:15:09,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-04 13:15:09,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:09,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:09,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:09,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-02-04 13:15:09,964 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_12 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (store .cse0 v_arrayElimCell_12 1) |c_#valid|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_12) 0)))) is different from true [2018-02-04 13:15:09,997 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_12 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_12 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_12) 0) (= 0 (select .cse1 |c_create_data_#t~malloc24.base|)) (= |c_#valid| (store .cse1 |c_create_data_#t~malloc24.base| 1)))))) is different from true [2018-02-04 13:15:10,001 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc24.base| Int) (v_arrayElimCell_12 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_12 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_12) 0) (= 0 (select .cse1 |create_data_#t~malloc24.base|)) (= |c_#valid| (store .cse1 |create_data_#t~malloc24.base| 1)))))) is different from true [2018-02-04 13:15:10,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:10,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:10,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:10,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2018-02-04 13:15:10,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:10,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:10,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:10,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:10,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 59 [2018-02-04 13:15:10,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 51 [2018-02-04 13:15:10,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:10,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:10,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:10,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:10,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:42, output treesize:45 [2018-02-04 13:15:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 11 not checked. [2018-02-04 13:15:10,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:10,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-02-04 13:15:10,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:15:10,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:15:10,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=271, Unknown=3, NotChecked=108, Total=462 [2018-02-04 13:15:10,149 INFO L87 Difference]: Start difference. First operand 297 states and 322 transitions. Second operand 22 states. [2018-02-04 13:15:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:11,283 INFO L93 Difference]: Finished difference Result 360 states and 391 transitions. [2018-02-04 13:15:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:15:11,284 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 83 [2018-02-04 13:15:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:11,284 INFO L225 Difference]: With dead ends: 360 [2018-02-04 13:15:11,285 INFO L226 Difference]: Without dead ends: 360 [2018-02-04 13:15:11,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=658, Unknown=4, NotChecked=168, Total=992 [2018-02-04 13:15:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-02-04 13:15:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 335. [2018-02-04 13:15:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-04 13:15:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 364 transitions. [2018-02-04 13:15:11,288 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 364 transitions. Word has length 83 [2018-02-04 13:15:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:11,288 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 364 transitions. [2018-02-04 13:15:11,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:15:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 364 transitions. [2018-02-04 13:15:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 13:15:11,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:11,289 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:11,289 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1495899268, now seen corresponding path program 1 times [2018-02-04 13:15:11,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:11,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:11,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:11,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:11,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:11,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:11,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:11,710 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:11,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:11,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:11,909 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-02-04 13:15:11,911 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-02-04 13:15:11,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:11,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:11,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:11,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:50 [2018-02-04 13:15:11,963 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 45 treesize of output 39 [2018-02-04 13:15:11,965 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-02-04 13:15:11,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:11,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:11,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:11,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:32 [2018-02-04 13:15:12,044 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_15 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_15 80) |c_create_data_#t~malloc24.base| 16) |c_#length|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_15) 0) (= (select (store .cse0 v_arrayElimCell_15 1) |c_create_data_#t~malloc24.base|) 0)))) is different from true [2018-02-04 13:15:12,047 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_15 Int) (|create_data_#t~malloc24.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_15 80) |create_data_#t~malloc24.base| 16) |c_#length|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_15) 0) (= (select (store .cse0 v_arrayElimCell_15 1) |create_data_#t~malloc24.base|) 0)))) is different from true [2018-02-04 13:15:12,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-02-04 13:15:12,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-02-04 13:15:12,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-02-04 13:15:12,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:12,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:12,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:12,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-02-04 13:15:12,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:12,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-02-04 13:15:12,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:12,170 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:12,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:12,182 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-02-04 13:15:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 3 not checked. [2018-02-04 13:15:12,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:12,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-02-04 13:15:12,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:15:12,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:15:12,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=346, Unknown=4, NotChecked=78, Total=506 [2018-02-04 13:15:12,263 INFO L87 Difference]: Start difference. First operand 335 states and 364 transitions. Second operand 23 states. [2018-02-04 13:15:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:13,594 INFO L93 Difference]: Finished difference Result 358 states and 389 transitions. [2018-02-04 13:15:13,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:15:13,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2018-02-04 13:15:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:13,595 INFO L225 Difference]: With dead ends: 358 [2018-02-04 13:15:13,595 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 13:15:13,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=779, Unknown=5, NotChecked=118, Total=1056 [2018-02-04 13:15:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 13:15:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 335. [2018-02-04 13:15:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-04 13:15:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 362 transitions. [2018-02-04 13:15:13,599 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 362 transitions. Word has length 83 [2018-02-04 13:15:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:13,599 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 362 transitions. [2018-02-04 13:15:13,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:15:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 362 transitions. [2018-02-04 13:15:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 13:15:13,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:13,600 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:13,600 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1254840622, now seen corresponding path program 1 times [2018-02-04 13:15:13,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:13,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:13,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:13,601 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:13,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:13,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:14,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:14,209 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:14,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:14,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:14,291 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-02-04 13:15:14,292 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-02-04 13:15:14,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:14,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:14,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:14,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-02-04 13:15:14,325 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 30 treesize of output 26 [2018-02-04 13:15:14,327 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-04 13:15:14,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:14,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:14,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:14,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-02-04 13:15:14,343 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_18 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#valid| (store .cse0 v_arrayElimCell_18 1)) (= 0 (select .cse0 v_arrayElimCell_18))))) is different from true [2018-02-04 13:15:14,375 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_18 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select .cse0 v_arrayElimCell_18)) (= (store (store .cse0 v_arrayElimCell_18 1) |c_create_data_#t~malloc24.base| 1) |c_#valid|)))) is different from true [2018-02-04 13:15:14,378 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_18 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select .cse0 v_arrayElimCell_18)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_18 1) c_create_data_~nextData~0.base 1))))) is different from true [2018-02-04 13:15:14,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:14,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:14,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:14,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 43 [2018-02-04 13:15:14,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-02-04 13:15:14,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-02-04 13:15:14,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:14,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:14,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:14,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:14,474 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:33 [2018-02-04 13:15:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 11 not checked. [2018-02-04 13:15:14,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:14,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-02-04 13:15:14,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:15:14,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:15:14,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=225, Unknown=6, NotChecked=102, Total=420 [2018-02-04 13:15:14,564 INFO L87 Difference]: Start difference. First operand 335 states and 362 transitions. Second operand 21 states. [2018-02-04 13:15:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:15,884 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-02-04 13:15:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:15:15,884 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-02-04 13:15:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:15,885 INFO L225 Difference]: With dead ends: 353 [2018-02-04 13:15:15,885 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 13:15:15,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=439, Unknown=19, NotChecked=144, Total=756 [2018-02-04 13:15:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 13:15:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 339. [2018-02-04 13:15:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 13:15:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 368 transitions. [2018-02-04 13:15:15,889 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 368 transitions. Word has length 85 [2018-02-04 13:15:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:15,889 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 368 transitions. [2018-02-04 13:15:15,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:15:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 368 transitions. [2018-02-04 13:15:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 13:15:15,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:15,890 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:15,890 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1254840621, now seen corresponding path program 1 times [2018-02-04 13:15:15,890 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:15,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:15,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:15,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:15,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:15,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:16,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:16,540 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:16,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:16,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:16,677 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-02-04 13:15:16,678 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-02-04 13:15:16,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:16,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:16,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:16,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-02-04 13:15:16,702 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 30 treesize of output 26 [2018-02-04 13:15:16,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-04 13:15:16,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:16,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:16,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:16,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-02-04 13:15:16,710 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_21 Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_21 80) |c_#length|) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_21) 0))) is different from true [2018-02-04 13:15:16,745 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_21 Int)) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_21 80) |c_create_data_#t~malloc24.base| 16)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_21) 0))) is different from true [2018-02-04 13:15:16,748 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_21 Int)) (and (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_21 80) c_create_data_~nextData~0.base 16) |c_#length|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_21) 0))) is different from true [2018-02-04 13:15:16,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:16,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-02-04 13:15:16,811 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:16,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:16,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-02-04 13:15:16,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-02-04 13:15:16,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 13:15:16,848 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:15:16,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:15:16,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:16,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:16,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:16,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 13:15:16,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:16,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 13:15:16,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72 [2018-02-04 13:15:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 11 not checked. [2018-02-04 13:15:16,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:16,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2018-02-04 13:15:16,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 13:15:16,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 13:15:16,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=431, Unknown=6, NotChecked=132, Total=650 [2018-02-04 13:15:16,984 INFO L87 Difference]: Start difference. First operand 339 states and 368 transitions. Second operand 26 states. [2018-02-04 13:15:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:18,536 INFO L93 Difference]: Finished difference Result 352 states and 380 transitions. [2018-02-04 13:15:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:15:18,536 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2018-02-04 13:15:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:18,537 INFO L225 Difference]: With dead ends: 352 [2018-02-04 13:15:18,537 INFO L226 Difference]: Without dead ends: 352 [2018-02-04 13:15:18,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=12, NotChecked=216, Total=1560 [2018-02-04 13:15:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-04 13:15:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 327. [2018-02-04 13:15:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 13:15:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 354 transitions. [2018-02-04 13:15:18,540 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 354 transitions. Word has length 85 [2018-02-04 13:15:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:18,540 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 354 transitions. [2018-02-04 13:15:18,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 13:15:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 354 transitions. [2018-02-04 13:15:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 13:15:18,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:18,540 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:18,541 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1604659804, now seen corresponding path program 1 times [2018-02-04 13:15:18,541 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:18,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:18,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:18,542 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:18,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:18,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:18,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:18,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:15:18,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:15:18,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:15:18,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:18,589 INFO L87 Difference]: Start difference. First operand 327 states and 354 transitions. Second operand 5 states. [2018-02-04 13:15:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:18,610 INFO L93 Difference]: Finished difference Result 380 states and 414 transitions. [2018-02-04 13:15:18,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:15:18,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-02-04 13:15:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:18,611 INFO L225 Difference]: With dead ends: 380 [2018-02-04 13:15:18,611 INFO L226 Difference]: Without dead ends: 380 [2018-02-04 13:15:18,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:15:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-04 13:15:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 330. [2018-02-04 13:15:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 13:15:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 357 transitions. [2018-02-04 13:15:18,615 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 357 transitions. Word has length 86 [2018-02-04 13:15:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:18,616 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 357 transitions. [2018-02-04 13:15:18,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:15:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 357 transitions. [2018-02-04 13:15:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 13:15:18,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:18,616 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:18,616 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 795313178, now seen corresponding path program 1 times [2018-02-04 13:15:18,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:18,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:18,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:18,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:18,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:18,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:18,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:18,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 13:15:18,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 13:15:18,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 13:15:18,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:15:18,875 INFO L87 Difference]: Start difference. First operand 330 states and 357 transitions. Second operand 18 states. [2018-02-04 13:15:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:19,532 INFO L93 Difference]: Finished difference Result 379 states and 408 transitions. [2018-02-04 13:15:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 13:15:19,532 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2018-02-04 13:15:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:19,533 INFO L225 Difference]: With dead ends: 379 [2018-02-04 13:15:19,533 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 13:15:19,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 13:15:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 13:15:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 330. [2018-02-04 13:15:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 13:15:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 356 transitions. [2018-02-04 13:15:19,536 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 356 transitions. Word has length 86 [2018-02-04 13:15:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:19,537 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 356 transitions. [2018-02-04 13:15:19,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 13:15:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 356 transitions. [2018-02-04 13:15:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 13:15:19,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:19,537 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:19,537 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1478778326, now seen corresponding path program 1 times [2018-02-04 13:15:19,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:19,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:19,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:19,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:19,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:19,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:19,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:19,731 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:19,737 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:19,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:19,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:19,838 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 14 treesize of output 17 [2018-02-04 13:15:19,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:19,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:19,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:19,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:15:19,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:19,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:19,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-02-04 13:15:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:19,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:15:19,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2018-02-04 13:15:19,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:15:19,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:15:19,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:15:19,882 INFO L87 Difference]: Start difference. First operand 330 states and 356 transitions. Second operand 16 states. [2018-02-04 13:15:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:20,280 INFO L93 Difference]: Finished difference Result 343 states and 370 transitions. [2018-02-04 13:15:20,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:15:20,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2018-02-04 13:15:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:20,281 INFO L225 Difference]: With dead ends: 343 [2018-02-04 13:15:20,281 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 13:15:20,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:15:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 13:15:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 327. [2018-02-04 13:15:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 13:15:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 352 transitions. [2018-02-04 13:15:20,283 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 352 transitions. Word has length 90 [2018-02-04 13:15:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:20,283 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 352 transitions. [2018-02-04 13:15:20,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:15:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 352 transitions. [2018-02-04 13:15:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 13:15:20,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:20,284 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:20,284 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1218787216, now seen corresponding path program 1 times [2018-02-04 13:15:20,284 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:20,284 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:20,285 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:20,285 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:20,285 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:20,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:20,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:20,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:15:20,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:15:20,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:15:20,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:15:20,316 INFO L87 Difference]: Start difference. First operand 327 states and 352 transitions. Second operand 3 states. [2018-02-04 13:15:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:20,321 INFO L93 Difference]: Finished difference Result 328 states and 353 transitions. [2018-02-04 13:15:20,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:15:20,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-02-04 13:15:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:20,322 INFO L225 Difference]: With dead ends: 328 [2018-02-04 13:15:20,323 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 13:15:20,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:15:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 13:15:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 13:15:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 13:15:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 353 transitions. [2018-02-04 13:15:20,326 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 353 transitions. Word has length 89 [2018-02-04 13:15:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:20,327 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 353 transitions. [2018-02-04 13:15:20,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:15:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 353 transitions. [2018-02-04 13:15:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 13:15:20,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:20,327 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:20,328 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash 556220146, now seen corresponding path program 1 times [2018-02-04 13:15:20,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:20,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:20,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:20,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:20,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:20,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:20,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:20,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:15:20,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:15:20,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:15:20,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:20,359 INFO L87 Difference]: Start difference. First operand 328 states and 353 transitions. Second operand 5 states. [2018-02-04 13:15:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:20,466 INFO L93 Difference]: Finished difference Result 342 states and 369 transitions. [2018-02-04 13:15:20,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:15:20,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-02-04 13:15:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:20,467 INFO L225 Difference]: With dead ends: 342 [2018-02-04 13:15:20,467 INFO L226 Difference]: Without dead ends: 342 [2018-02-04 13:15:20,467 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:15:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-04 13:15:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 333. [2018-02-04 13:15:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 13:15:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 360 transitions. [2018-02-04 13:15:20,470 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 360 transitions. Word has length 89 [2018-02-04 13:15:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:20,470 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 360 transitions. [2018-02-04 13:15:20,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:15:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 360 transitions. [2018-02-04 13:15:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 13:15:20,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:20,471 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:20,471 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:20,471 INFO L82 PathProgramCache]: Analyzing trace with hash 556220147, now seen corresponding path program 1 times [2018-02-04 13:15:20,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:20,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:20,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:20,471 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:20,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:20,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 13:15:21,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:21,085 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:21,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:21,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:21,265 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-04 13:15:21,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:21,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-02-04 13:15:21,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:21,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:21,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-02-04 13:15:21,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:21,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:21,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:21,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:21,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 13:15:21,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:21,353 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:35 [2018-02-04 13:15:21,420 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-02-04 13:15:21,422 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-02-04 13:15:21,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,436 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-02-04 13:15:21,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:15:21,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:21,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:43 [2018-02-04 13:15:21,672 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 33 treesize of output 25 [2018-02-04 13:15:21,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-04 13:15:21,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,690 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-02-04 13:15:21,692 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-02-04 13:15:21,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:21,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:21,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:57, output treesize:27 [2018-02-04 13:15:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:21,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:15:21,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [20] total 33 [2018-02-04 13:15:21,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 13:15:21,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 13:15:21,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=936, Unknown=8, NotChecked=62, Total=1122 [2018-02-04 13:15:21,771 INFO L87 Difference]: Start difference. First operand 333 states and 360 transitions. Second operand 34 states. [2018-02-04 13:15:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:24,752 INFO L93 Difference]: Finished difference Result 516 states and 572 transitions. [2018-02-04 13:15:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 13:15:24,752 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-02-04 13:15:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:24,753 INFO L225 Difference]: With dead ends: 516 [2018-02-04 13:15:24,753 INFO L226 Difference]: Without dead ends: 516 [2018-02-04 13:15:24,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=466, Invalid=4071, Unknown=23, NotChecked=132, Total=4692 [2018-02-04 13:15:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-04 13:15:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 376. [2018-02-04 13:15:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 13:15:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 410 transitions. [2018-02-04 13:15:24,757 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 410 transitions. Word has length 89 [2018-02-04 13:15:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:24,758 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 410 transitions. [2018-02-04 13:15:24,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 13:15:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 410 transitions. [2018-02-04 13:15:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 13:15:24,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:24,758 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:24,758 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:24,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1950634351, now seen corresponding path program 1 times [2018-02-04 13:15:24,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:24,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:24,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:24,759 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:24,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:24,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:24,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:24,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:15:24,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:15:24,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:15:24,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:15:24,814 INFO L87 Difference]: Start difference. First operand 376 states and 410 transitions. Second operand 8 states. [2018-02-04 13:15:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:25,008 INFO L93 Difference]: Finished difference Result 392 states and 424 transitions. [2018-02-04 13:15:25,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:15:25,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-02-04 13:15:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:25,010 INFO L225 Difference]: With dead ends: 392 [2018-02-04 13:15:25,010 INFO L226 Difference]: Without dead ends: 392 [2018-02-04 13:15:25,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:15:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-04 13:15:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 376. [2018-02-04 13:15:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 13:15:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 408 transitions. [2018-02-04 13:15:25,019 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 408 transitions. Word has length 91 [2018-02-04 13:15:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:25,019 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 408 transitions. [2018-02-04 13:15:25,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:15:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 408 transitions. [2018-02-04 13:15:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 13:15:25,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:25,020 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:25,020 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash 370724265, now seen corresponding path program 1 times [2018-02-04 13:15:25,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:25,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:25,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:25,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:25,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:25,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:25,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:25,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:15:25,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:15:25,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:15:25,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:15:25,069 INFO L87 Difference]: Start difference. First operand 376 states and 408 transitions. Second operand 5 states. [2018-02-04 13:15:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:25,225 INFO L93 Difference]: Finished difference Result 382 states and 414 transitions. [2018-02-04 13:15:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:15:25,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-02-04 13:15:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:25,227 INFO L225 Difference]: With dead ends: 382 [2018-02-04 13:15:25,227 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 13:15:25,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:15:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 13:15:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 379. [2018-02-04 13:15:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 13:15:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 412 transitions. [2018-02-04 13:15:25,232 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 412 transitions. Word has length 92 [2018-02-04 13:15:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:25,232 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 412 transitions. [2018-02-04 13:15:25,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:15:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 412 transitions. [2018-02-04 13:15:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 13:15:25,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:25,233 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:25,233 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 370724266, now seen corresponding path program 1 times [2018-02-04 13:15:25,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:25,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:25,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:25,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:25,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:25,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:25,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:25,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 13:15:25,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:15:25,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:15:25,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:15:25,676 INFO L87 Difference]: Start difference. First operand 379 states and 412 transitions. Second operand 19 states. [2018-02-04 13:15:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:26,547 INFO L93 Difference]: Finished difference Result 409 states and 446 transitions. [2018-02-04 13:15:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 13:15:26,547 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-02-04 13:15:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:26,548 INFO L225 Difference]: With dead ends: 409 [2018-02-04 13:15:26,548 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 13:15:26,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:15:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 13:15:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 382. [2018-02-04 13:15:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 13:15:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 415 transitions. [2018-02-04 13:15:26,551 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 415 transitions. Word has length 92 [2018-02-04 13:15:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:26,551 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 415 transitions. [2018-02-04 13:15:26,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:15:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 415 transitions. [2018-02-04 13:15:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 13:15:26,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:26,552 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:26,552 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1885925861, now seen corresponding path program 1 times [2018-02-04 13:15:26,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:26,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:26,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:26,553 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:26,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:26,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:26,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:26,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:15:26,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:15:26,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:15:26,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:15:26,620 INFO L87 Difference]: Start difference. First operand 382 states and 415 transitions. Second operand 9 states. [2018-02-04 13:15:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:26,872 INFO L93 Difference]: Finished difference Result 411 states and 451 transitions. [2018-02-04 13:15:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:15:26,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-02-04 13:15:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:26,874 INFO L225 Difference]: With dead ends: 411 [2018-02-04 13:15:26,874 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 13:15:26,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:15:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 13:15:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 403. [2018-02-04 13:15:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 13:15:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 442 transitions. [2018-02-04 13:15:26,877 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 442 transitions. Word has length 95 [2018-02-04 13:15:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:26,877 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 442 transitions. [2018-02-04 13:15:26,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:15:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 442 transitions. [2018-02-04 13:15:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 13:15:26,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:26,878 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:26,878 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:26,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1885925862, now seen corresponding path program 1 times [2018-02-04 13:15:26,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:26,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:26,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:26,879 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:26,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:26,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:27,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:27,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-04 13:15:27,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:15:27,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:15:27,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:15:27,215 INFO L87 Difference]: Start difference. First operand 403 states and 442 transitions. Second operand 23 states. [2018-02-04 13:15:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:28,130 INFO L93 Difference]: Finished difference Result 463 states and 508 transitions. [2018-02-04 13:15:28,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 13:15:28,131 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2018-02-04 13:15:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:28,132 INFO L225 Difference]: With dead ends: 463 [2018-02-04 13:15:28,132 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 13:15:28,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=2044, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 13:15:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 13:15:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 437. [2018-02-04 13:15:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-04 13:15:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 485 transitions. [2018-02-04 13:15:28,136 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 485 transitions. Word has length 95 [2018-02-04 13:15:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:28,136 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 485 transitions. [2018-02-04 13:15:28,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:15:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 485 transitions. [2018-02-04 13:15:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 13:15:28,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:28,137 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:28,137 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash -251418617, now seen corresponding path program 1 times [2018-02-04 13:15:28,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:28,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:28,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:28,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:28,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:28,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:28,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:28,316 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:28,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:28,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:28,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 13:15:28,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-04 13:15:28,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-02-04 13:15:28,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-02-04 13:15:28,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,471 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 24 treesize of output 23 [2018-02-04 13:15:28,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:28,478 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 13:15:28,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-02-04 13:15:28,499 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 28 treesize of output 17 [2018-02-04 13:15:28,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 5 [2018-02-04 13:15:28,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:28,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:28,513 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-02-04 13:15:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:28,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:15:28,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-02-04 13:15:28,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:15:28,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:15:28,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:15:28,549 INFO L87 Difference]: Start difference. First operand 437 states and 485 transitions. Second operand 21 states. [2018-02-04 13:15:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:29,009 INFO L93 Difference]: Finished difference Result 440 states and 490 transitions. [2018-02-04 13:15:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:15:29,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 96 [2018-02-04 13:15:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:29,011 INFO L225 Difference]: With dead ends: 440 [2018-02-04 13:15:29,011 INFO L226 Difference]: Without dead ends: 440 [2018-02-04 13:15:29,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-02-04 13:15:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-04 13:15:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2018-02-04 13:15:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-04 13:15:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 484 transitions. [2018-02-04 13:15:29,016 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 484 transitions. Word has length 96 [2018-02-04 13:15:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:29,016 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 484 transitions. [2018-02-04 13:15:29,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:15:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 484 transitions. [2018-02-04 13:15:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 13:15:29,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:29,017 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:29,017 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash -251418616, now seen corresponding path program 1 times [2018-02-04 13:15:29,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:29,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:29,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:29,018 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:29,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:29,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:29,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:29,319 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:29,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:29,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:29,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:29,464 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 22 treesize of output 29 [2018-02-04 13:15:29,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:29,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:29,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:15:29,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-02-04 13:15:29,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2018-02-04 13:15:29,553 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 41 treesize of output 40 [2018-02-04 13:15:29,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2018-02-04 13:15:29,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 42 treesize of output 41 [2018-02-04 13:15:29,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:29,623 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2018-02-04 13:15:29,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2018-02-04 13:15:29,664 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 36 treesize of output 16 [2018-02-04 13:15:29,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-02-04 13:15:29,683 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 35 treesize of output 30 [2018-02-04 13:15:29,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,695 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 30 treesize of output 15 [2018-02-04 13:15:29,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2018-02-04 13:15:29,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:29,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:29,717 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:80, output treesize:20 [2018-02-04 13:15:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:29,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:15:29,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2018-02-04 13:15:29,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 13:15:29,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 13:15:29,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=639, Unknown=1, NotChecked=0, Total=702 [2018-02-04 13:15:29,766 INFO L87 Difference]: Start difference. First operand 436 states and 484 transitions. Second operand 27 states. [2018-02-04 13:15:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:31,030 INFO L93 Difference]: Finished difference Result 457 states and 507 transitions. [2018-02-04 13:15:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:15:31,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2018-02-04 13:15:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:31,031 INFO L225 Difference]: With dead ends: 457 [2018-02-04 13:15:31,031 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 13:15:31,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=1456, Unknown=2, NotChecked=0, Total=1722 [2018-02-04 13:15:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 13:15:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 435. [2018-02-04 13:15:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 13:15:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 483 transitions. [2018-02-04 13:15:31,036 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 483 transitions. Word has length 96 [2018-02-04 13:15:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:31,036 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 483 transitions. [2018-02-04 13:15:31,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 13:15:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 483 transitions. [2018-02-04 13:15:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 13:15:31,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:31,037 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:31,037 INFO L371 AbstractCegarLoop]: === Iteration 52 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1665840238, now seen corresponding path program 1 times [2018-02-04 13:15:31,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:31,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:31,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:31,038 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:31,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:31,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 13:15:31,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:31,660 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:31,665 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:31,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:31,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:15:31,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:15:31,878 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-02-04 13:15:31,879 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-02-04 13:15:31,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,887 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-02-04 13:15:31,889 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-02-04 13:15:31,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-02-04 13:15:31,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:31,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 13:15:31,959 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 32 treesize of output 1 [2018-02-04 13:15:31,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:31,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-04 13:15:31,973 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 32 treesize of output 1 [2018-02-04 13:15:31,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:114, output treesize:32 [2018-02-04 13:15:31,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:31,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 13:15:31,986 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 32 treesize of output 1 [2018-02-04 13:15:31,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:31,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:31,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-04 13:15:32,000 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 32 treesize of output 1 [2018-02-04 13:15:32,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:114, output treesize:32 [2018-02-04 13:15:32,007 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 20 [2018-02-04 13:15:32,008 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 20 treesize of output 8 [2018-02-04 13:15:32,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-02-04 13:15:32,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-04 13:15:32,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-02-04 13:15:32,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:32,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:26 [2018-02-04 13:15:32,096 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 25 treesize of output 20 [2018-02-04 13:15:32,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,098 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 20 treesize of output 16 [2018-02-04 13:15:32,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:32,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:26 [2018-02-04 13:15:32,110 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 29 treesize of output 24 [2018-02-04 13:15:32,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,112 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 24 treesize of output 18 [2018-02-04 13:15:32,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:32,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:26 [2018-02-04 13:15:32,120 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 23 treesize of output 18 [2018-02-04 13:15:32,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,122 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 18 treesize of output 27 [2018-02-04 13:15:32,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:32,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-02-04 13:15:32,287 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-02-04 13:15:32,288 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-02-04 13:15:32,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 13:15:32,328 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-02-04 13:15:32,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:32,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:68 [2018-02-04 13:15:32,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 67 [2018-02-04 13:15:32,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 62 treesize of output 61 [2018-02-04 13:15:32,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,432 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 59 [2018-02-04 13:15:32,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:15:32,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:15:32,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 124 [2018-02-04 13:15:32,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,496 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 93 treesize of output 98 [2018-02-04 13:15:32,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,627 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 76 treesize of output 75 [2018-02-04 13:15:32,627 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 82 [2018-02-04 13:15:32,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-04 13:15:32,712 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:15:32,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-02-04 13:15:32,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 13:15:32,719 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,728 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 13:15:32,769 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:84, output treesize:374 [2018-02-04 13:15:32,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 102 [2018-02-04 13:15:32,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:32,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-02-04 13:15:32,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:32,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:406, output treesize:101 [2018-02-04 13:15:33,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 95 [2018-02-04 13:15:33,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-04 13:15:33,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:33,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-02-04 13:15:33,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:33,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:33,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:33,140 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:128, output treesize:49 [2018-02-04 13:15:33,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-02-04 13:15:33,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 13:15:33,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:33,270 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 5 [2018-02-04 13:15:33,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:33,274 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 16 treesize of output 3 [2018-02-04 13:15:33,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:33,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:33,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:33,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2018-02-04 13:15:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 13:15:33,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:33,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2018-02-04 13:15:33,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 13:15:33,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 13:15:33,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2402, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 13:15:33,342 INFO L87 Difference]: Start difference. First operand 435 states and 483 transitions. Second operand 51 states. [2018-02-04 13:15:34,397 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 107 DAG size of output 105 [2018-02-04 13:15:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:35,672 INFO L93 Difference]: Finished difference Result 484 states and 539 transitions. [2018-02-04 13:15:35,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 13:15:35,672 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2018-02-04 13:15:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:35,673 INFO L225 Difference]: With dead ends: 484 [2018-02-04 13:15:35,674 INFO L226 Difference]: Without dead ends: 484 [2018-02-04 13:15:35,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=448, Invalid=6358, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 13:15:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-04 13:15:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 443. [2018-02-04 13:15:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 13:15:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 493 transitions. [2018-02-04 13:15:35,680 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 493 transitions. Word has length 96 [2018-02-04 13:15:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:35,681 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 493 transitions. [2018-02-04 13:15:35,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 13:15:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 493 transitions. [2018-02-04 13:15:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 13:15:35,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:35,682 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:35,682 INFO L371 AbstractCegarLoop]: === Iteration 53 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1665840237, now seen corresponding path program 1 times [2018-02-04 13:15:35,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:35,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:35,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:35,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:35,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:35,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 13:15:36,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:36,311 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:36,316 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:36,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:36,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:15:36,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:15:36,520 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-02-04 13:15:36,521 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-02-04 13:15:36,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:38 [2018-02-04 13:15:36,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-02-04 13:15:36,594 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 32 treesize of output 1 [2018-02-04 13:15:36,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:38 [2018-02-04 13:15:36,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-02-04 13:15:36,611 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 32 treesize of output 1 [2018-02-04 13:15:36,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:38 [2018-02-04 13:15:36,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-02-04 13:15:36,624 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 32 treesize of output 1 [2018-02-04 13:15:36,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:38 [2018-02-04 13:15:36,633 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 45 treesize of output 38 [2018-02-04 13:15:36,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,635 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 38 treesize of output 36 [2018-02-04 13:15:36,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:38 [2018-02-04 13:15:36,645 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 49 treesize of output 42 [2018-02-04 13:15:36,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,647 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 42 treesize of output 38 [2018-02-04 13:15:36,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2018-02-04 13:15:36,657 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 43 treesize of output 36 [2018-02-04 13:15:36,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,659 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 36 treesize of output 47 [2018-02-04 13:15:36,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-02-04 13:15:36,824 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-02-04 13:15:36,826 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-02-04 13:15:36,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-02-04 13:15:36,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 13:15:36,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:89 [2018-02-04 13:15:36,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 13:15:36,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 13:15:36,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:36,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 13:15:36,940 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 13:15:36,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:15:36,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:36,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 100 [2018-02-04 13:15:36,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 99 treesize of output 98 [2018-02-04 13:15:36,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:37,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,103 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 72 [2018-02-04 13:15:37,103 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:15:37,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 84 [2018-02-04 13:15:37,259 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 13:15:37,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-02-04 13:15:37,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-02-04 13:15:37,482 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:105, output treesize:1173 [2018-02-04 13:15:37,908 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 179 DAG size of output 74 [2018-02-04 13:15:37,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 169 [2018-02-04 13:15:37,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:37,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 205 [2018-02-04 13:15:37,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 183 [2018-02-04 13:15:37,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:37,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:38,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:38,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:38,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:513, output treesize:210 [2018-02-04 13:15:38,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 187 [2018-02-04 13:15:38,261 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-02-04 13:15:38,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:38,273 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 145 [2018-02-04 13:15:38,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:38,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:38,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:38,298 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:237, output treesize:170 [2018-02-04 13:15:38,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 84 [2018-02-04 13:15:38,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2018-02-04 13:15:38,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:38,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-02-04 13:15:38,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:38,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-04 13:15:38,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:38,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:38,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:38,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:171, output treesize:45 [2018-02-04 13:15:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:38,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:15:38,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [28] total 50 [2018-02-04 13:15:38,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 13:15:38,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 13:15:38,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2391, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 13:15:38,580 INFO L87 Difference]: Start difference. First operand 443 states and 493 transitions. Second operand 51 states. [2018-02-04 13:15:40,169 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 110 DAG size of output 110 [2018-02-04 13:15:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:42,040 INFO L93 Difference]: Finished difference Result 461 states and 514 transitions. [2018-02-04 13:15:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 13:15:42,040 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2018-02-04 13:15:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:42,041 INFO L225 Difference]: With dead ends: 461 [2018-02-04 13:15:42,041 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 13:15:42,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=442, Invalid=5878, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 13:15:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 13:15:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 443. [2018-02-04 13:15:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 13:15:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 492 transitions. [2018-02-04 13:15:42,045 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 492 transitions. Word has length 96 [2018-02-04 13:15:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:42,045 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 492 transitions. [2018-02-04 13:15:42,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 13:15:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 492 transitions. [2018-02-04 13:15:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 13:15:42,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:42,046 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:42,046 INFO L371 AbstractCegarLoop]: === Iteration 54 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:42,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1150339668, now seen corresponding path program 1 times [2018-02-04 13:15:42,046 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:42,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:42,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:42,046 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:42,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:42,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:42,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:15:42,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-02-04 13:15:42,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 13:15:42,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 13:15:42,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2018-02-04 13:15:42,746 INFO L87 Difference]: Start difference. First operand 443 states and 492 transitions. Second operand 30 states. [2018-02-04 13:15:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:44,192 INFO L93 Difference]: Finished difference Result 467 states and 520 transitions. [2018-02-04 13:15:44,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 13:15:44,192 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 98 [2018-02-04 13:15:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:44,193 INFO L225 Difference]: With dead ends: 467 [2018-02-04 13:15:44,193 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 13:15:44,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=307, Invalid=3475, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 13:15:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 13:15:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 443. [2018-02-04 13:15:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 13:15:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 491 transitions. [2018-02-04 13:15:44,196 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 491 transitions. Word has length 98 [2018-02-04 13:15:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:44,196 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 491 transitions. [2018-02-04 13:15:44,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 13:15:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 491 transitions. [2018-02-04 13:15:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-02-04 13:15:44,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:44,197 INFO L351 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:44,197 INFO L371 AbstractCegarLoop]: === Iteration 55 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1853698169, now seen corresponding path program 1 times [2018-02-04 13:15:44,197 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:44,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:44,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:44,198 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:44,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:44,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-02-04 13:15:44,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:44,473 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:44,478 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:44,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:44,544 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-02-04 13:15:44,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 13:15:44,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-02-04 13:15:44,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:44,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:44,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:15:44,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-02-04 13:15:44,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-02-04 13:15:44,631 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-02-04 13:15:44,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-02-04 13:15:44,648 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 16 treesize of output 12 [2018-02-04 13:15:44,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-02-04 13:15:44,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:44,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-02-04 13:15:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 113 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-02-04 13:15:44,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:44,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2018-02-04 13:15:44,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 13:15:44,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 13:15:44,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:15:44,685 INFO L87 Difference]: Start difference. First operand 443 states and 491 transitions. Second operand 24 states. [2018-02-04 13:15:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:45,173 INFO L93 Difference]: Finished difference Result 455 states and 499 transitions. [2018-02-04 13:15:45,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 13:15:45,174 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 174 [2018-02-04 13:15:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:45,175 INFO L225 Difference]: With dead ends: 455 [2018-02-04 13:15:45,175 INFO L226 Difference]: Without dead ends: 455 [2018-02-04 13:15:45,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 13:15:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-04 13:15:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 443. [2018-02-04 13:15:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 13:15:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 488 transitions. [2018-02-04 13:15:45,179 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 488 transitions. Word has length 174 [2018-02-04 13:15:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:45,179 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 488 transitions. [2018-02-04 13:15:45,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 13:15:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 488 transitions. [2018-02-04 13:15:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 13:15:45,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:45,180 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:45,180 INFO L371 AbstractCegarLoop]: === Iteration 56 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -381265027, now seen corresponding path program 2 times [2018-02-04 13:15:45,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:45,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:45,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:45,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:45,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:45,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:46,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:46,421 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:46,425 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:15:46,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:15:46,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:15:46,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:46,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:15:46,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:15:46,502 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-02-04 13:15:46,503 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-02-04 13:15:46,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-02-04 13:15:46,523 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 30 treesize of output 26 [2018-02-04 13:15:46,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-04 13:15:46,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:46,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:46,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:46,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-02-04 13:15:46,531 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_96 Int) (create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select .cse0 v_arrayElimCell_96)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#valid| (store .cse0 v_arrayElimCell_96 1))))) is different from true [2018-02-04 13:15:46,541 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_96 Int) (create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_96 1))) (and (= 0 (select .cse0 v_arrayElimCell_96)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#valid| (store .cse1 |c_create_data_#t~malloc24.base| 1)) (= (select .cse1 |c_create_data_#t~malloc24.base|) 0))))) is different from true [2018-02-04 13:15:46,543 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_96 Int) (create_data_~data~0.base Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 v_arrayElimCell_96 1))) (and (= (select .cse0 c_create_data_~nextData~0.base) 0) (= 0 (select .cse1 v_arrayElimCell_96)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#valid| (store .cse0 c_create_data_~nextData~0.base 1)))))) is different from true [2018-02-04 13:15:46,548 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_96 Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_96 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (= 0 (select .cse0 v_arrayElimCell_96)) (= (select .cse1 c_create_data_~data~0.base) 0) (= |c_#valid| (store .cse1 c_create_data_~data~0.base 1)))))) is different from true [2018-02-04 13:15:46,551 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_96 Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_96 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (= 0 (select .cse0 v_arrayElimCell_96)) (= (select .cse1 c_create_data_~data~0.base) 0) (= |c_#valid| (store (store .cse1 c_create_data_~data~0.base 1) |c_create_data_#t~malloc24.base| 1)))))) is different from true [2018-02-04 13:15:46,553 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_96 Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_96 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (= 0 (select .cse0 v_arrayElimCell_96)) (= (select .cse1 c_create_data_~data~0.base) 0) (= |c_#valid| (store (store .cse1 c_create_data_~data~0.base 1) c_create_data_~nextData~0.base 1)))))) is different from true [2018-02-04 13:15:46,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:46,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:46,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:46,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2018-02-04 13:15:46,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:46,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:46,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:46,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:46,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2018-02-04 13:15:46,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-02-04 13:15:46,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2018-02-04 13:15:46,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:46,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:46,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:50 [2018-02-04 13:15:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 29 not checked. [2018-02-04 13:15:46,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:46,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 28 [2018-02-04 13:15:46,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 13:15:46,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 13:15:46,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=376, Unknown=6, NotChecked=282, Total=812 [2018-02-04 13:15:46,793 INFO L87 Difference]: Start difference. First operand 443 states and 488 transitions. Second operand 29 states. [2018-02-04 13:15:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:50,182 INFO L93 Difference]: Finished difference Result 509 states and 563 transitions. [2018-02-04 13:15:50,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 13:15:50,182 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 98 [2018-02-04 13:15:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:50,183 INFO L225 Difference]: With dead ends: 509 [2018-02-04 13:15:50,183 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 13:15:50,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=317, Invalid=1089, Unknown=24, NotChecked=462, Total=1892 [2018-02-04 13:15:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 13:15:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 481. [2018-02-04 13:15:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-02-04 13:15:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 530 transitions. [2018-02-04 13:15:50,187 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 530 transitions. Word has length 98 [2018-02-04 13:15:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:50,187 INFO L432 AbstractCegarLoop]: Abstraction has 481 states and 530 transitions. [2018-02-04 13:15:50,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 13:15:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 530 transitions. [2018-02-04 13:15:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 13:15:50,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:50,188 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:50,188 INFO L371 AbstractCegarLoop]: === Iteration 57 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash -381265026, now seen corresponding path program 2 times [2018-02-04 13:15:50,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:50,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:50,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:50,189 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:15:50,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:50,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:51,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:51,050 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:51,054 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:15:51,099 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:15:51,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:15:51,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:51,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:15:51,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:51,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:15:51,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:51,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:51,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 13:15:51,186 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc4.base| Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 |create_data_#t~malloc4.base| 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc4.base| 80) |c_create_data_#t~malloc24.base| 16)) (= 1 (select .cse0 create_data_~data~0.base)) (= (select .cse1 |create_data_#t~malloc4.base|) 0) (= 0 (select .cse0 |c_create_data_#t~malloc24.base|)))))) is different from true [2018-02-04 13:15:51,188 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc24.base| Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 |create_data_#t~malloc4.base| 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc4.base| 80) |create_data_#t~malloc24.base| 16)) (= 1 (select .cse0 create_data_~data~0.base)) (= (select .cse1 |create_data_#t~malloc4.base|) 0) (= 0 (select .cse0 |create_data_#t~malloc24.base|)))))) is different from true [2018-02-04 13:15:51,196 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_prenex_28 Int) (|create_data_#t~malloc4.base| Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 |create_data_#t~malloc4.base| 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc4.base| 80) v_prenex_28 16) |c_create_data_#t~malloc24.base| 16)) (= 1 (select .cse0 create_data_~data~0.base)) (= (select .cse1 |create_data_#t~malloc4.base|) 0) (= 0 (select .cse0 v_prenex_28)))))) is different from true [2018-02-04 13:15:51,199 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_prenex_28 Int) (|create_data_#t~malloc4.base| Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 |create_data_#t~malloc4.base| 1))) (and (= (store (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc4.base| 80) v_prenex_28 16) c_create_data_~nextData~0.base 16) |c_#length|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 1 (select .cse0 create_data_~data~0.base)) (= (select .cse1 |create_data_#t~malloc4.base|) 0) (= 0 (select .cse0 v_prenex_28)))))) is different from true [2018-02-04 13:15:51,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-02-04 13:15:51,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-02-04 13:15:51,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:51,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:51,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 13:15:51,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:51,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2018-02-04 13:15:51,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2018-02-04 13:15:51,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 58 [2018-02-04 13:15:51,347 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 13:15:51,382 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:15:51,399 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:15:51,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:15:51,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-02-04 13:15:51,435 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:69, output treesize:138 [2018-02-04 13:15:51,694 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 82 DAG size of output 78 [2018-02-04 13:15:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 18 not checked. [2018-02-04 13:15:51,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:15:51,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-02-04 13:15:51,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 13:15:51,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 13:15:51,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=372, Unknown=6, NotChecked=172, Total=650 [2018-02-04 13:15:51,765 INFO L87 Difference]: Start difference. First operand 481 states and 530 transitions. Second operand 26 states. [2018-02-04 13:15:52,618 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 66 DAG size of output 63 [2018-02-04 13:15:53,341 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 91 DAG size of output 79 [2018-02-04 13:15:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:55,517 INFO L93 Difference]: Finished difference Result 534 states and 589 transitions. [2018-02-04 13:15:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 13:15:55,518 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-02-04 13:15:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:55,519 INFO L225 Difference]: With dead ends: 534 [2018-02-04 13:15:55,519 INFO L226 Difference]: Without dead ends: 534 [2018-02-04 13:15:55,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=203, Invalid=975, Unknown=28, NotChecked=276, Total=1482 [2018-02-04 13:15:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-04 13:15:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 481. [2018-02-04 13:15:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-02-04 13:15:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 528 transitions. [2018-02-04 13:15:55,522 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 528 transitions. Word has length 98 [2018-02-04 13:15:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:55,522 INFO L432 AbstractCegarLoop]: Abstraction has 481 states and 528 transitions. [2018-02-04 13:15:55,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 13:15:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 528 transitions. [2018-02-04 13:15:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 13:15:55,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:55,522 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:55,523 INFO L371 AbstractCegarLoop]: === Iteration 58 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:55,523 INFO L82 PathProgramCache]: Analyzing trace with hash -137378987, now seen corresponding path program 1 times [2018-02-04 13:15:55,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:55,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:55,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:55,523 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:15:55,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:55,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:55,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:55,845 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:55,850 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:55,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:56,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:56,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:56,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:56,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2018-02-04 13:15:56,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:59 [2018-02-04 13:15:56,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 73 [2018-02-04 13:15:56,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 69 treesize of output 68 [2018-02-04 13:15:56,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59 [2018-02-04 13:15:56,200 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 52 treesize of output 51 [2018-02-04 13:15:56,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:56,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:82 [2018-02-04 13:15:56,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2018-02-04 13:15:56,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-02-04 13:15:56,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:56,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:70 [2018-02-04 13:15:56,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 13:15:56,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 59 treesize of output 42 [2018-02-04 13:15:56,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 40 [2018-02-04 13:15:56,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 13:15:56,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:56,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:56,389 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:74, output treesize:15 [2018-02-04 13:15:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:56,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:15:56,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [22] total 38 [2018-02-04 13:15:56,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 13:15:56,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 13:15:56,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 13:15:56,489 INFO L87 Difference]: Start difference. First operand 481 states and 528 transitions. Second operand 39 states. [2018-02-04 13:15:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:15:58,071 INFO L93 Difference]: Finished difference Result 753 states and 819 transitions. [2018-02-04 13:15:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 13:15:58,071 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-02-04 13:15:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:15:58,072 INFO L225 Difference]: With dead ends: 753 [2018-02-04 13:15:58,072 INFO L226 Difference]: Without dead ends: 753 [2018-02-04 13:15:58,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=2855, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 13:15:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-02-04 13:15:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 618. [2018-02-04 13:15:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-02-04 13:15:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 680 transitions. [2018-02-04 13:15:58,078 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 680 transitions. Word has length 100 [2018-02-04 13:15:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:15:58,078 INFO L432 AbstractCegarLoop]: Abstraction has 618 states and 680 transitions. [2018-02-04 13:15:58,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 13:15:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 680 transitions. [2018-02-04 13:15:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 13:15:58,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:15:58,079 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:15:58,079 INFO L371 AbstractCegarLoop]: === Iteration 59 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:15:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash -137378986, now seen corresponding path program 1 times [2018-02-04 13:15:58,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:15:58,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:15:58,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:58,080 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:58,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:15:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:58,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:15:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:15:58,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:15:58,524 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:15:58,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:15:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:15:58,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:15:58,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:58,749 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 38 treesize of output 53 [2018-02-04 13:15:58,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:58,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:58,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:58,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:15:58,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-04 13:15:58,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:58,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:58,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:81 [2018-02-04 13:15:58,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 94 [2018-02-04 13:15:58,906 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 91 treesize of output 90 [2018-02-04 13:15:58,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:58,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:58,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 93 [2018-02-04 13:15:58,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 91 treesize of output 90 [2018-02-04 13:15:58,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:58,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:59,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:112, output treesize:104 [2018-02-04 13:15:59,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 121 [2018-02-04 13:15:59,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 101 [2018-02-04 13:15:59,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:15:59,188 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 69 treesize of output 50 [2018-02-04 13:15:59,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-02-04 13:15:59,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:59,243 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 100 treesize of output 90 [2018-02-04 13:15:59,243 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2018-02-04 13:15:59,291 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:59,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 104 treesize of output 101 [2018-02-04 13:15:59,340 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 96 [2018-02-04 13:15:59,392 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 13:15:59,444 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 101 treesize of output 91 [2018-02-04 13:15:59,444 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2018-02-04 13:15:59,484 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:59,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-02-04 13:15:59,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 81 [2018-02-04 13:15:59,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2018-02-04 13:15:59,578 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2018-02-04 13:15:59,622 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:59,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-02-04 13:15:59,665 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 58 [2018-02-04 13:15:59,705 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-02-04 13:15:59,742 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:59,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-02-04 13:15:59,780 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-02-04 13:15:59,817 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2018-02-04 13:15:59,857 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,865 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2018-02-04 13:15:59,872 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 63 treesize of output 58 [2018-02-04 13:15:59,873 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 58 treesize of output 37 [2018-02-04 13:15:59,891 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 13:15:59,907 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2018-02-04 13:15:59,924 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-02-04 13:15:59,939 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,947 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2018-02-04 13:15:59,952 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 19 treesize of output 7 [2018-02-04 13:15:59,952 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,959 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-04 13:15:59,959 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:15:59,966 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 22 treesize of output 13 [2018-02-04 13:15:59,966 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,971 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2018-02-04 13:15:59,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2018-02-04 13:15:59,979 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 13:15:59,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2018-02-04 13:15:59,994 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,008 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 38 treesize of output 29 [2018-02-04 13:16:00,008 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-02-04 13:16:00,036 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,044 INFO L267 ElimStorePlain]: Start of recursive call 31: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 59 [2018-02-04 13:16:00,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-02-04 13:16:00,054 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,081 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 34 treesize of output 25 [2018-02-04 13:16:00,081 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2018-02-04 13:16:00,106 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 41 [2018-02-04 13:16:00,141 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 3 xjuncts. [2018-02-04 13:16:00,162 INFO L267 ElimStorePlain]: Start of recursive call 36: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:00,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:00,172 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 5 variables, input treesize:142, output treesize:22 [2018-02-04 13:16:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:16:00,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:16:00,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [22] total 38 [2018-02-04 13:16:00,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 13:16:00,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 13:16:00,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 13:16:00,285 INFO L87 Difference]: Start difference. First operand 618 states and 680 transitions. Second operand 39 states. [2018-02-04 13:16:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:16:02,097 INFO L93 Difference]: Finished difference Result 631 states and 688 transitions. [2018-02-04 13:16:02,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 13:16:02,097 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-02-04 13:16:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:16:02,098 INFO L225 Difference]: With dead ends: 631 [2018-02-04 13:16:02,098 INFO L226 Difference]: Without dead ends: 631 [2018-02-04 13:16:02,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=301, Invalid=3005, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 13:16:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-02-04 13:16:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 618. [2018-02-04 13:16:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-02-04 13:16:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 679 transitions. [2018-02-04 13:16:02,103 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 679 transitions. Word has length 100 [2018-02-04 13:16:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:16:02,103 INFO L432 AbstractCegarLoop]: Abstraction has 618 states and 679 transitions. [2018-02-04 13:16:02,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 13:16:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 679 transitions. [2018-02-04 13:16:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 13:16:02,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:16:02,104 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:16:02,104 INFO L371 AbstractCegarLoop]: === Iteration 60 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:16:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1323462836, now seen corresponding path program 2 times [2018-02-04 13:16:02,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:16:02,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:16:02,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:02,105 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:16:02,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:16:02,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:16:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:16:03,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:16:03,638 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:16:03,643 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:16:03,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:16:03,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:16:03,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:16:03,701 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true [2018-02-04 13:16:03,704 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true [2018-02-04 13:16:03,716 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1) |c_create_data_#t~malloc24.base| 1)))) is different from true [2018-02-04 13:16:03,717 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1) c_create_data_~nextData~0.base 1)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-04 13:16:03,721 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1) c_create_data_~data~0.base 1)))) is different from true [2018-02-04 13:16:03,724 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store (store (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1) c_create_data_~data~0.base 1) |c_create_data_#t~malloc24.base| 1) |c_#valid|))) is different from true [2018-02-04 13:16:03,725 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1) c_create_data_~data~0.base 1) c_create_data_~nextData~0.base 1)))) is different from true [2018-02-04 13:16:03,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:03,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:03,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-02-04 13:16:03,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2018-02-04 13:16:03,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-02-04 13:16:03,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-02-04 13:16:03,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:03,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:03,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:03,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:03,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:03,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:36, output treesize:30 [2018-02-04 13:16:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 21 not checked. [2018-02-04 13:16:03,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:16:03,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-02-04 13:16:03,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 13:16:03,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 13:16:03,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=218, Unknown=12, NotChecked=266, Total=600 [2018-02-04 13:16:03,911 INFO L87 Difference]: Start difference. First operand 618 states and 679 transitions. Second operand 25 states. [2018-02-04 13:16:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:16:07,410 INFO L93 Difference]: Finished difference Result 782 states and 862 transitions. [2018-02-04 13:16:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:16:07,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-04 13:16:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:16:07,412 INFO L225 Difference]: With dead ends: 782 [2018-02-04 13:16:07,412 INFO L226 Difference]: Without dead ends: 782 [2018-02-04 13:16:07,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 104 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=264, Invalid=657, Unknown=99, NotChecked=462, Total=1482 [2018-02-04 13:16:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-02-04 13:16:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 622. [2018-02-04 13:16:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-02-04 13:16:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 685 transitions. [2018-02-04 13:16:07,419 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 685 transitions. Word has length 100 [2018-02-04 13:16:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:16:07,419 INFO L432 AbstractCegarLoop]: Abstraction has 622 states and 685 transitions. [2018-02-04 13:16:07,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 13:16:07,419 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 685 transitions. [2018-02-04 13:16:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 13:16:07,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:16:07,419 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:16:07,420 INFO L371 AbstractCegarLoop]: === Iteration 61 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:16:07,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1323462835, now seen corresponding path program 2 times [2018-02-04 13:16:07,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:16:07,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:16:07,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:07,420 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:16:07,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:16:07,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:16:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:16:08,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:16:08,341 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:16:08,347 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:16:08,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:16:08,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:16:08,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:16:08,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:16:08,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:16:08,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 13:16:08,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 13:16:08,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:16:08,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-02-04 13:16:08,583 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |create_data_#t~malloc3.base| 16)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-04 13:16:08,585 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-04 13:16:08,606 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#length| (store (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_create_data_#t~malloc24.base| 16)))) is different from true [2018-02-04 13:16:08,607 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= |c_#length| (store (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) c_create_data_~nextData~0.base 16)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-04 13:16:08,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:16:08,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:08,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:25 [2018-02-04 13:16:08,678 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (create_data_~nextData~0.base Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store (store (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) create_data_~nextData~0.base 16) |c_create_data_#t~malloc24.base| 16) |c_#length|) (not (= create_data_~nextData~0.base |c_create_data_#t~malloc24.base|)))) is different from true [2018-02-04 13:16:08,679 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (v_subst_2 Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store (store (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) v_subst_2 16) c_create_data_~nextData~0.base 16) |c_#length|) (not (= c_create_data_~nextData~0.base v_subst_2)))) is different from true [2018-02-04 13:16:08,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 52 [2018-02-04 13:16:08,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 44 [2018-02-04 13:16:08,768 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:16:08,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,802 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-02-04 13:16:08,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-02-04 13:16:08,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:08,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-02-04 13:16:08,828 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:08,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:16:08,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 40 [2018-02-04 13:16:08,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,899 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 2 case distinctions, treesize of input 30 treesize of output 47 [2018-02-04 13:16:08,899 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:08,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:08,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 63 [2018-02-04 13:16:08,947 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:09,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,009 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 2 case distinctions, treesize of input 26 treesize of output 43 [2018-02-04 13:16:09,009 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:09,102 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 13:16:09,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 50 [2018-02-04 13:16:09,187 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:16:09,187 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:09,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 47 [2018-02-04 13:16:09,222 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:09,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 61 [2018-02-04 13:16:09,279 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:09,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-02-04 13:16:09,355 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:09,410 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 13:16:09,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 16 xjuncts. [2018-02-04 13:16:09,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 54 [2018-02-04 13:16:09,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 58 [2018-02-04 13:16:09,643 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:16:09,644 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:09,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 57 [2018-02-04 13:16:09,684 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:09,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 73 [2018-02-04 13:16:09,735 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:09,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:09,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 53 [2018-02-04 13:16:09,803 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:09,874 INFO L267 ElimStorePlain]: Start of recursive call 18: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 13:16:10,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 54 [2018-02-04 13:16:10,177 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:16:10,178 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:10,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 63 [2018-02-04 13:16:10,294 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:10,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 63 [2018-02-04 13:16:10,370 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:10,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 87 [2018-02-04 13:16:10,519 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-02-04 13:16:10,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:10,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 63 [2018-02-04 13:16:10,646 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:10,738 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-02-04 13:16:11,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 68 [2018-02-04 13:16:11,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 101 [2018-02-04 13:16:11,106 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 8 xjuncts. [2018-02-04 13:16:11,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 81 [2018-02-04 13:16:11,269 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:11,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 77 [2018-02-04 13:16:11,376 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:11,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:11,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 81 [2018-02-04 13:16:11,574 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:11,960 INFO L267 ElimStorePlain]: Start of recursive call 29: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-02-04 13:16:12,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 50 [2018-02-04 13:16:12,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 73 [2018-02-04 13:16:12,226 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-02-04 13:16:12,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 53 [2018-02-04 13:16:12,300 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:12,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:12,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 57 [2018-02-04 13:16:12,356 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:12,462 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 13:16:12,944 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-1 vars, End of recursive call: and 34 xjuncts. [2018-02-04 13:16:13,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 47 xjuncts. [2018-02-04 13:16:13,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:13,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:13,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:16:13,625 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:13,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 99 dim-0 vars, and 32 xjuncts. [2018-02-04 13:16:13,966 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 7 variables, input treesize:51, output treesize:1136 [2018-02-04 13:16:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 17 not checked. [2018-02-04 13:16:14,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:16:14,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-02-04 13:16:14,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 13:16:14,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 13:16:14,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=656, Unknown=14, NotChecked=342, Total=1122 [2018-02-04 13:16:14,273 INFO L87 Difference]: Start difference. First operand 622 states and 685 transitions. Second operand 34 states. [2018-02-04 13:16:15,412 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 64 DAG size of output 61 [2018-02-04 13:16:15,655 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 66 DAG size of output 63 [2018-02-04 13:16:16,464 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 86 DAG size of output 64 [2018-02-04 13:16:17,022 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 74 DAG size of output 64 [2018-02-04 13:16:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:16:20,124 INFO L93 Difference]: Finished difference Result 811 states and 888 transitions. [2018-02-04 13:16:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 13:16:20,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 100 [2018-02-04 13:16:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:16:20,126 INFO L225 Difference]: With dead ends: 811 [2018-02-04 13:16:20,126 INFO L226 Difference]: Without dead ends: 811 [2018-02-04 13:16:20,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=437, Invalid=2918, Unknown=91, NotChecked=714, Total=4160 [2018-02-04 13:16:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-02-04 13:16:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 607. [2018-02-04 13:16:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-02-04 13:16:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 668 transitions. [2018-02-04 13:16:20,131 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 668 transitions. Word has length 100 [2018-02-04 13:16:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:16:20,131 INFO L432 AbstractCegarLoop]: Abstraction has 607 states and 668 transitions. [2018-02-04 13:16:20,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 13:16:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 668 transitions. [2018-02-04 13:16:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 13:16:20,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:16:20,132 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:16:20,132 INFO L371 AbstractCegarLoop]: === Iteration 62 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:16:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash 446408726, now seen corresponding path program 1 times [2018-02-04 13:16:20,132 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:16:20,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:16:20,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:20,132 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:16:20,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:16:20,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:16:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:16:20,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:16:20,917 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:16:20,922 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:16:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:16:20,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:16:20,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:16:20,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:20,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:20,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:16:21,178 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-02-04 13:16:21,179 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-02-04 13:16:21,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,189 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-02-04 13:16:21,190 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-02-04 13:16:21,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-02-04 13:16:21,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 13:16:21,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 13:16:21,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 13:16:21,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 13:16:21,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:16:21,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-02-04 13:16:21,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 31 treesize of output 30 [2018-02-04 13:16:21,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2018-02-04 13:16:21,359 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:21,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:21,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 13:16:21,395 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:165 [2018-02-04 13:16:21,489 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:16:21,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:21,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:21,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:16:21,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:61 [2018-02-04 13:16:21,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:21,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:21,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:21,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-04 13:16:21,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:21,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 57 [2018-02-04 13:16:21,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:57 [2018-02-04 13:16:21,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 74 [2018-02-04 13:16:21,902 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 67 treesize of output 66 [2018-02-04 13:16:21,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:21,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-02-04 13:16:21,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-02-04 13:16:21,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:22,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:80 [2018-02-04 13:16:22,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2018-02-04 13:16:22,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 67 [2018-02-04 13:16:22,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-02-04 13:16:22,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:22,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-02-04 13:16:22,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2018-02-04 13:16:22,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2018-02-04 13:16:22,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:22,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:22,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-02-04 13:16:22,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 13:16:22,282 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,288 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 9 treesize of output 1 [2018-02-04 13:16:22,288 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,295 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2018-02-04 13:16:22,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-02-04 13:16:22,301 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,313 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 30 treesize of output 21 [2018-02-04 13:16:22,313 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-02-04 13:16:22,336 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:22,347 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 24 treesize of output 17 [2018-02-04 13:16:22,347 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,353 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:22,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:22,364 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:14 [2018-02-04 13:16:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:16:22,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:16:22,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 55 [2018-02-04 13:16:22,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 13:16:22,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 13:16:22,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2932, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 13:16:22,563 INFO L87 Difference]: Start difference. First operand 607 states and 668 transitions. Second operand 56 states. [2018-02-04 13:16:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:16:25,911 INFO L93 Difference]: Finished difference Result 763 states and 833 transitions. [2018-02-04 13:16:25,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 13:16:25,912 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 103 [2018-02-04 13:16:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:16:25,913 INFO L225 Difference]: With dead ends: 763 [2018-02-04 13:16:25,913 INFO L226 Difference]: Without dead ends: 763 [2018-02-04 13:16:25,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=569, Invalid=8173, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 13:16:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-02-04 13:16:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 743. [2018-02-04 13:16:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-02-04 13:16:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 817 transitions. [2018-02-04 13:16:25,918 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 817 transitions. Word has length 103 [2018-02-04 13:16:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:16:25,918 INFO L432 AbstractCegarLoop]: Abstraction has 743 states and 817 transitions. [2018-02-04 13:16:25,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 13:16:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 817 transitions. [2018-02-04 13:16:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 13:16:25,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:16:25,919 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:16:25,919 INFO L371 AbstractCegarLoop]: === Iteration 63 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:16:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1609146172, now seen corresponding path program 1 times [2018-02-04 13:16:25,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:16:25,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:16:25,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:25,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:16:25,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:16:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:16:25,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:16:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 13:16:27,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:16:27,221 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:16:27,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:16:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:16:27,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:16:27,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:16:27,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:16:27,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:27,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:27,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-02-04 13:16:27,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-02-04 13:16:27,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 13:16:27,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:30 [2018-02-04 13:16:27,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-04 13:16:27,425 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 32 treesize of output 1 [2018-02-04 13:16:27,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:30 [2018-02-04 13:16:27,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-04 13:16:27,454 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 32 treesize of output 1 [2018-02-04 13:16:27,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:30 [2018-02-04 13:16:27,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-04 13:16:27,486 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 32 treesize of output 1 [2018-02-04 13:16:27,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:30 [2018-02-04 13:16:27,503 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 37 treesize of output 30 [2018-02-04 13:16:27,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-02-04 13:16:27,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:30 [2018-02-04 13:16:27,523 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 41 treesize of output 34 [2018-02-04 13:16:27,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-02-04 13:16:27,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2018-02-04 13:16:27,543 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 29 treesize of output 22 [2018-02-04 13:16:27,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-02-04 13:16:27,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-02-04 13:16:27,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-02-04 13:16:27,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:51 [2018-02-04 13:16:27,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-02-04 13:16:27,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-04 13:16:27,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:79 [2018-02-04 13:16:27,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 76 [2018-02-04 13:16:27,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 80 treesize of output 79 [2018-02-04 13:16:27,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 49 [2018-02-04 13:16:27,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:27,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:27,825 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-02-04 13:16:27,826 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-02-04 13:16:27,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,828 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:27,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:95, output treesize:189 [2018-02-04 13:16:27,899 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:16:27,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:27,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:16:27,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:27,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:205, output treesize:143 [2018-02-04 13:16:28,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 165 [2018-02-04 13:16:28,377 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 7 treesize of output 1 [2018-02-04 13:16:28,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:28,389 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 127 [2018-02-04 13:16:28,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:28,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:28,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 159 [2018-02-04 13:16:28,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 4 [2018-02-04 13:16:28,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:28,454 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 115 [2018-02-04 13:16:28,454 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:28,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:16:28,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:28,493 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:383, output treesize:273 [2018-02-04 13:16:28,580 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 120 treesize of output 115 [2018-02-04 13:16:28,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:28,604 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 132 treesize of output 127 [2018-02-04 13:16:28,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:28,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 13:16:28,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:253, output treesize:243 [2018-02-04 13:16:29,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:29,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 274 [2018-02-04 13:16:29,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:29,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:29,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 293 [2018-02-04 13:16:29,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 94 [2018-02-04 13:16:29,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:16:29,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:16:29,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:16:29,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 244 treesize of output 204 [2018-02-04 13:16:29,275 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-02-04 13:16:29,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 115 [2018-02-04 13:16:29,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:17:32,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2018-02-04 13:17:32,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-02-04 13:17:47,516 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 13:17:47,517 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 13:17:47,521 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 13:17:47,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:17:47 BoogieIcfgContainer [2018-02-04 13:17:47,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:17:47,522 INFO L168 Benchmark]: Toolchain (without parser) took 173850.10 ms. Allocated memory was 404.8 MB in the beginning and 1.1 GB in the end (delta: 688.4 MB). Free memory was 361.6 MB in the beginning and 918.9 MB in the end (delta: -557.3 MB). Peak memory consumption was 829.2 MB. Max. memory is 5.3 GB. [2018-02-04 13:17:47,523 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:17:47,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.63 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 349.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 13:17:47,523 INFO L168 Benchmark]: Boogie Preprocessor took 28.70 ms. Allocated memory is still 404.8 MB. Free memory was 349.7 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:17:47,523 INFO L168 Benchmark]: RCFGBuilder took 452.96 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 295.4 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:17:47,523 INFO L168 Benchmark]: TraceAbstraction took 173191.73 ms. Allocated memory was 404.8 MB in the beginning and 1.1 GB in the end (delta: 688.4 MB). Free memory was 295.4 MB in the beginning and 918.9 MB in the end (delta: -623.4 MB). Peak memory consumption was 763.1 MB. Max. memory is 5.3 GB. [2018-02-04 13:17:47,524 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.17 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.63 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 349.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.70 ms. Allocated memory is still 404.8 MB. Free memory was 349.7 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 452.96 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 295.4 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 173191.73 ms. Allocated memory was 404.8 MB in the beginning and 1.1 GB in the end (delta: 688.4 MB). Free memory was 295.4 MB in the beginning and 918.9 MB in the end (delta: -623.4 MB). Peak memory consumption was 763.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 587). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 586]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 586). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 587). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 9349. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 216 locations, 91 error locations. TIMEOUT Result, 173.1s OverallTime, 63 OverallIterations, 8 TraceHistogramMax, 54.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9080 SDtfs, 11898 SDslu, 49569 SDs, 0 SdLazy, 48839 SolverSat, 1598 SolverUnsat, 702 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3515 GetRequests, 2045 SyntacticMatches, 97 SemanticMatches, 1373 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 13968 ImplicationChecksByTransitivity, 36.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=743occurred in iteration=62, 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.3s AutomataMinimizationTime, 62 MinimizatonAttempts, 1682 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 6539 NumberOfCodeBlocks, 6525 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 6453 ConstructedInterpolants, 706 QuantifiedInterpolants, 20312876 SizeOfPredicates, 339 NumberOfNonLiveVariables, 8968 ConjunctsInSsa, 904 ConjunctsInUnsatCore, 86 InterpolantComputations, 46 PerfectInterpolantSequences, 2080/2472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-17-47-531.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-17-47-531.csv Completed graceful shutdown