./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b50a14aaadb91f0d2171e26e1cac3b7310be0682 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:35:21,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:35:21,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:35:21,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:35:21,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:35:21,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:35:21,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:35:21,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:35:21,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:35:21,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:35:21,072 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:35:21,072 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:35:21,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:35:21,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:35:21,075 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:35:21,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:35:21,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:35:21,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:35:21,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:35:21,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:35:21,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:35:21,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:35:21,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:35:21,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:35:21,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:35:21,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:35:21,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:35:21,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:35:21,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:35:21,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:35:21,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:35:21,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:35:21,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:35:21,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:35:21,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:35:21,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:35:21,100 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:35:21,115 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:35:21,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:35:21,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:35:21,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:35:21,118 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:35:21,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:35:21,118 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:35:21,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:35:21,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:35:21,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:35:21,119 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:35:21,119 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:35:21,119 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:35:21,120 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:35:21,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:35:21,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:35:21,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:35:21,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:35:21,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:35:21,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:35:21,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:35:21,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:35:21,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:35:21,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:35:21,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:35:21,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:35:21,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:35:21,125 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b50a14aaadb91f0d2171e26e1cac3b7310be0682 [2019-01-14 15:35:21,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:35:21,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:35:21,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:35:21,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:35:21,179 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:35:21,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2019-01-14 15:35:21,242 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885eb1410/02809b8963ae42e39fd5ededb014c6b6/FLAG9a5c260df [2019-01-14 15:35:21,794 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:35:21,795 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2019-01-14 15:35:21,814 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885eb1410/02809b8963ae42e39fd5ededb014c6b6/FLAG9a5c260df [2019-01-14 15:35:22,090 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885eb1410/02809b8963ae42e39fd5ededb014c6b6 [2019-01-14 15:35:22,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:35:22,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:35:22,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:35:22,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:35:22,099 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:35:22,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd00d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22, skipping insertion in model container [2019-01-14 15:35:22,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:35:22,160 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:35:22,575 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:35:22,595 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:35:22,729 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:35:22,785 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:35:22,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22 WrapperNode [2019-01-14 15:35:22,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:35:22,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:35:22,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:35:22,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:35:22,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:35:22,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:35:22,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:35:22,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:35:22,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... [2019-01-14 15:35:22,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:35:22,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:35:22,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:35:22,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:35:22,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (1/1) ... No working directory specified, using /storage/repos/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 [2019-01-14 15:35:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:35:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:35:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:35:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:35:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:35:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 15:35:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:35:22,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:35:23,613 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:35:23,614 INFO L286 CfgBuilder]: Removed 27 assue(true) statements. [2019-01-14 15:35:23,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:23 BoogieIcfgContainer [2019-01-14 15:35:23,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:35:23,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:35:23,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:35:23,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:35:23,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:35:22" (1/3) ... [2019-01-14 15:35:23,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bfbb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:35:23, skipping insertion in model container [2019-01-14 15:35:23,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:22" (2/3) ... [2019-01-14 15:35:23,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bfbb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:35:23, skipping insertion in model container [2019-01-14 15:35:23,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:23" (3/3) ... [2019-01-14 15:35:23,623 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2019-01-14 15:35:23,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:35:23,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-14 15:35:23,658 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-14 15:35:23,688 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:35:23,688 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:35:23,689 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:35:23,689 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:35:23,689 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:35:23,689 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:35:23,689 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:35:23,689 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:35:23,690 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:35:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-01-14 15:35:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 15:35:23,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:23,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:23,714 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash -877667187, now seen corresponding path program 1 times [2019-01-14 15:35:23,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:23,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:23,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:23,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:23,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:23,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:35:23,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:35:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:35:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:35:23,861 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-01-14 15:35:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:23,880 INFO L93 Difference]: Finished difference Result 86 states and 138 transitions. [2019-01-14 15:35:23,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:35:23,882 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-01-14 15:35:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:23,890 INFO L225 Difference]: With dead ends: 86 [2019-01-14 15:35:23,890 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 15:35:23,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:35:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 15:35:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-14 15:35:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 15:35:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-14 15:35:23,927 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 9 [2019-01-14 15:35:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:23,928 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 15:35:23,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:35:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-01-14 15:35:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 15:35:23,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:23,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:23,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:23,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:23,930 INFO L82 PathProgramCache]: Analyzing trace with hash -469126662, now seen corresponding path program 1 times [2019-01-14 15:35:23,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:23,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:23,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:23,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:23,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:24,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:24,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:35:24,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:35:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:35:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:35:24,136 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2019-01-14 15:35:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:24,437 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-01-14 15:35:24,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:35:24,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-14 15:35:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:24,439 INFO L225 Difference]: With dead ends: 72 [2019-01-14 15:35:24,439 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 15:35:24,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:35:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 15:35:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-14 15:35:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:35:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-14 15:35:24,447 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2019-01-14 15:35:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:24,448 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 15:35:24,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:35:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-14 15:35:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:35:24,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:24,449 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:24,449 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 197969347, now seen corresponding path program 1 times [2019-01-14 15:35:24,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:24,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:24,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:24,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:35:24,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:35:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:35:24,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:35:24,552 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-01-14 15:35:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:24,644 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-01-14 15:35:24,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:35:24,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:35:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:24,646 INFO L225 Difference]: With dead ends: 59 [2019-01-14 15:35:24,646 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 15:35:24,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:35:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 15:35:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-01-14 15:35:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 15:35:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 15:35:24,652 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 16 [2019-01-14 15:35:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:24,653 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 15:35:24,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:35:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-01-14 15:35:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:35:24,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:24,654 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:24,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2087126036, now seen corresponding path program 1 times [2019-01-14 15:35:24,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:24,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:24,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 15:35:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:35:24,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:35:24,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:35:24,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:35:24,874 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2019-01-14 15:35:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:25,285 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-01-14 15:35:25,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 15:35:25,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-14 15:35:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:25,287 INFO L225 Difference]: With dead ends: 81 [2019-01-14 15:35:25,287 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 15:35:25,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:35:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 15:35:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2019-01-14 15:35:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 15:35:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-01-14 15:35:25,294 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2019-01-14 15:35:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:25,295 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-01-14 15:35:25,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:35:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-01-14 15:35:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:35:25,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:25,296 INFO L402 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] [2019-01-14 15:35:25,297 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 776590411, now seen corresponding path program 1 times [2019-01-14 15:35:25,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:25,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:25,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:25,649 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 15:35:25,790 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 15:35:26,314 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2019-01-14 15:35:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:26,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:35:26,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 15:35:26,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:26,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:35:26,565 INFO L478 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 [2019-01-14 15:35:26,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 15:35:26,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:26,657 INFO L478 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 [2019-01-14 15:35:26,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,724 INFO L478 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 11 treesize of output 8 [2019-01-14 15:35:26,729 INFO L478 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 [2019-01-14 15:35:26,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,806 INFO L478 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 11 treesize of output 8 [2019-01-14 15:35:26,816 INFO L478 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 [2019-01-14 15:35:26,816 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,821 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:26,834 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2019-01-14 15:35:27,807 WARN L181 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 71 [2019-01-14 15:35:27,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:27,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:27,982 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 2061 treesize of output 800 [2019-01-14 15:35:28,148 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-01-14 15:35:28,152 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 15:35:28,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,164 INFO L478 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 28 treesize of output 47 [2019-01-14 15:35:28,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,248 INFO L478 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 319 treesize of output 303 [2019-01-14 15:35:28,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,275 INFO L478 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 0 case distinctions, treesize of input 77 treesize of output 181 [2019-01-14 15:35:28,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 273 [2019-01-14 15:35:28,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,349 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,441 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,525 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:28,541 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:28,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 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 527 treesize of output 232 [2019-01-14 15:35:28,705 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 91 [2019-01-14 15:35:28,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,711 INFO L478 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 91 treesize of output 104 [2019-01-14 15:35:28,712 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,728 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:28,795 INFO L478 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 155 treesize of output 131 [2019-01-14 15:35:28,802 INFO L478 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 103 treesize of output 95 [2019-01-14 15:35:28,804 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:28,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:28,871 INFO L478 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 58 treesize of output 121 [2019-01-14 15:35:28,874 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2019-01-14 15:35:29,057 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 15:35:29,172 INFO L478 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 182 treesize of output 148 [2019-01-14 15:35:29,176 INFO L478 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 140 treesize of output 97 [2019-01-14 15:35:29,177 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:29,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2019-01-14 15:35:29,220 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:29,301 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:29,305 INFO L478 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 153 [2019-01-14 15:35:29,310 INFO L478 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 125 treesize of output 88 [2019-01-14 15:35:29,311 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:29,411 INFO L478 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 4 case distinctions, treesize of input 30 treesize of output 53 [2019-01-14 15:35:29,413 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2019-01-14 15:35:29,491 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:35:29,532 INFO L478 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 178 treesize of output 144 [2019-01-14 15:35:29,552 INFO L478 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 136 treesize of output 97 [2019-01-14 15:35:29,553 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:29,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2019-01-14 15:35:29,676 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:29,697 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:29,847 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-01-14 15:35:30,048 INFO L478 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 125 treesize of output 118 [2019-01-14 15:35:30,053 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 15:35:30,068 INFO L478 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 28 treesize of output 19 [2019-01-14 15:35:30,070 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2019-01-14 15:35:30,075 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:35:30,106 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:35:30,112 INFO L478 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 108 treesize of output 101 [2019-01-14 15:35:30,115 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2019-01-14 15:35:30,123 INFO L478 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 26 treesize of output 11 [2019-01-14 15:35:30,123 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,126 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,145 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,148 INFO L478 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 105 treesize of output 98 [2019-01-14 15:35:30,152 INFO L478 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 [2019-01-14 15:35:30,152 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,166 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,171 INFO L478 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 108 treesize of output 101 [2019-01-14 15:35:30,174 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2019-01-14 15:35:30,213 INFO L478 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 26 treesize of output 11 [2019-01-14 15:35:30,213 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,216 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,234 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:30,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-01-14 15:35:30,338 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 5 variables, input treesize:2667, output treesize:314 [2019-01-14 15:35:30,609 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-14 15:35:31,123 INFO L478 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 92 treesize of output 80 [2019-01-14 15:35:31,130 INFO L478 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 15 treesize of output 13 [2019-01-14 15:35:31,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,156 INFO L478 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 16 treesize of output 1 [2019-01-14 15:35:31,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,284 INFO L478 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 55 treesize of output 49 [2019-01-14 15:35:31,299 INFO L478 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 [2019-01-14 15:35:31,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,375 INFO L478 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 92 treesize of output 69 [2019-01-14 15:35:31,379 INFO L478 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 49 treesize of output 39 [2019-01-14 15:35:31,380 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,403 INFO L478 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 16 treesize of output 1 [2019-01-14 15:35:31,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,466 INFO L478 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 39 treesize of output 33 [2019-01-14 15:35:31,468 INFO L478 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 11 treesize of output 9 [2019-01-14 15:35:31,469 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,502 INFO L478 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 11 treesize of output 1 [2019-01-14 15:35:31,503 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,509 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,554 INFO L478 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 92 treesize of output 69 [2019-01-14 15:35:31,561 INFO L478 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 16 treesize of output 1 [2019-01-14 15:35:31,562 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,576 INFO L478 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 49 treesize of output 39 [2019-01-14 15:35:31,577 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,586 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,622 INFO L478 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 39 treesize of output 33 [2019-01-14 15:35:31,627 INFO L478 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 11 treesize of output 1 [2019-01-14 15:35:31,627 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,636 INFO L478 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 11 treesize of output 9 [2019-01-14 15:35:31,637 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,645 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:31,671 INFO L478 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 21 treesize of output 17 [2019-01-14 15:35:31,681 INFO L478 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 1 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:35:31,681 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2019-01-14 15:35:31,689 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:35:31,721 INFO L478 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 42 treesize of output 27 [2019-01-14 15:35:31,729 INFO L478 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 16 treesize of output 1 [2019-01-14 15:35:31,729 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,733 INFO L478 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 6 treesize of output 4 [2019-01-14 15:35:31,733 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,741 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:31,744 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 15 variables, input treesize:277, output treesize:1 [2019-01-14 15:35:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:31,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:35:31,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-01-14 15:35:31,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 15:35:31,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 15:35:31,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-14 15:35:31,779 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 17 states. [2019-01-14 15:35:32,456 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 15:35:32,812 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-01-14 15:35:33,458 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-01-14 15:35:34,000 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-14 15:35:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:34,117 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-01-14 15:35:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 15:35:34,122 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-01-14 15:35:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:34,123 INFO L225 Difference]: With dead ends: 67 [2019-01-14 15:35:34,123 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 15:35:34,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-01-14 15:35:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 15:35:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 33. [2019-01-14 15:35:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 15:35:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-14 15:35:34,131 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2019-01-14 15:35:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:34,131 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-14 15:35:34,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 15:35:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-14 15:35:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:35:34,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:34,134 INFO L402 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] [2019-01-14 15:35:34,134 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash 777298443, now seen corresponding path program 1 times [2019-01-14 15:35:34,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:34,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:34,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:34,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:34,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:34,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:35:34,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 15:35:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:34,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:35:34,420 INFO L478 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 [2019-01-14 15:35:34,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 15:35:34,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 15:35:34,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,489 INFO L478 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 11 treesize of output 8 [2019-01-14 15:35:34,494 INFO L478 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 [2019-01-14 15:35:34,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,509 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-01-14 15:35:34,562 INFO L478 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 110 treesize of output 100 [2019-01-14 15:35:34,566 INFO L478 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 100 treesize of output 90 [2019-01-14 15:35:34,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:145, output treesize:105 [2019-01-14 15:35:34,916 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 49 [2019-01-14 15:35:34,919 INFO L478 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 25 treesize of output 23 [2019-01-14 15:35:34,923 INFO L478 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 23 treesize of output 21 [2019-01-14 15:35:34,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,992 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 735 treesize of output 270 [2019-01-14 15:35:35,040 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 15:35:35,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,044 INFO L478 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 28 treesize of output 47 [2019-01-14 15:35:35,045 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,054 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,082 INFO L478 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 0 case distinctions, treesize of input 108 treesize of output 92 [2019-01-14 15:35:35,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,092 INFO L478 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 0 case distinctions, treesize of input 73 treesize of output 177 [2019-01-14 15:35:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,152 INFO L478 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 6 case distinctions, treesize of input 75 treesize of output 257 [2019-01-14 15:35:35,155 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2019-01-14 15:35:35,266 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:35:35,327 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:35:35,405 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:35:35,490 INFO L478 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 0 case distinctions, treesize of input 102 treesize of output 98 [2019-01-14 15:35:35,495 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 15:35:35,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,499 INFO L478 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 28 treesize of output 47 [2019-01-14 15:35:35,499 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,505 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,529 INFO L478 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 0 case distinctions, treesize of input 76 treesize of output 62 [2019-01-14 15:35:35,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,532 INFO L478 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 17 treesize of output 10 [2019-01-14 15:35:35,533 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,545 INFO L478 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 25 [2019-01-14 15:35:35,546 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,550 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,561 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,569 INFO L478 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 0 case distinctions, treesize of input 108 treesize of output 104 [2019-01-14 15:35:35,573 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 15:35:35,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,577 INFO L478 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 28 treesize of output 47 [2019-01-14 15:35:35,578 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,592 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,617 INFO L478 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 0 case distinctions, treesize of input 82 treesize of output 68 [2019-01-14 15:35:35,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,624 INFO L478 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 17 treesize of output 10 [2019-01-14 15:35:35,624 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,637 INFO L478 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 44 treesize of output 38 [2019-01-14 15:35:35,638 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:35,653 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:35,665 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:35,741 INFO L478 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 0 case distinctions, treesize of input 102 treesize of output 98 [2019-01-14 15:35:35,759 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 15:35:35,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,785 INFO L478 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 28 treesize of output 47 [2019-01-14 15:35:35,785 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,795 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,819 INFO L478 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 0 case distinctions, treesize of input 76 treesize of output 62 [2019-01-14 15:35:35,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,823 INFO L478 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 17 treesize of output 10 [2019-01-14 15:35:35,823 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,834 INFO L478 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 27 [2019-01-14 15:35:35,835 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,841 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,852 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,859 INFO L478 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 0 case distinctions, treesize of input 102 treesize of output 98 [2019-01-14 15:35:35,873 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 15:35:35,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,882 INFO L478 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 28 treesize of output 47 [2019-01-14 15:35:35,882 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,894 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,918 INFO L478 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 0 case distinctions, treesize of input 76 treesize of output 62 [2019-01-14 15:35:35,922 INFO L478 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 54 treesize of output 41 [2019-01-14 15:35:35,923 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,937 INFO L478 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 15 treesize of output 8 [2019-01-14 15:35:35,938 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,958 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:35,968 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:36,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-14 15:35:36,028 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 4 variables, input treesize:1057, output treesize:195 [2019-01-14 15:35:36,179 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-01-14 15:35:38,311 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 15:35:38,547 INFO L478 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 0 case distinctions, treesize of input 61 treesize of output 37 [2019-01-14 15:35:38,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:38,581 INFO L478 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 2 case distinctions, treesize of input 20 treesize of output 29 [2019-01-14 15:35:38,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 15:35:38,602 INFO L478 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 18 treesize of output 9 [2019-01-14 15:35:38,603 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:35:38,663 INFO L478 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 0 case distinctions, treesize of input 50 treesize of output 32 [2019-01-14 15:35:38,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:38,671 INFO L478 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 15 treesize of output 8 [2019-01-14 15:35:38,671 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,677 INFO L478 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 18 treesize of output 9 [2019-01-14 15:35:38,678 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,682 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,718 INFO L478 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 0 case distinctions, treesize of input 50 treesize of output 32 [2019-01-14 15:35:38,721 INFO L478 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 18 treesize of output 9 [2019-01-14 15:35:38,722 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:38,730 INFO L478 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 15 treesize of output 8 [2019-01-14 15:35:38,731 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:38,797 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:162, output treesize:4 [2019-01-14 15:35:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:38,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:35:38,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-01-14 15:35:38,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 15:35:38,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 15:35:38,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-14 15:35:38,877 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 14 states. [2019-01-14 15:35:41,496 WARN L181 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 84 [2019-01-14 15:35:44,483 WARN L181 SmtUtils]: Spent 2.95 s on a formula simplification that was a NOOP. DAG size: 118 [2019-01-14 15:35:46,902 WARN L181 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 152 [2019-01-14 15:35:47,411 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-01-14 15:35:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:47,554 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-01-14 15:35:47,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:35:47,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-01-14 15:35:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:47,557 INFO L225 Difference]: With dead ends: 76 [2019-01-14 15:35:47,557 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 15:35:47,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-01-14 15:35:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 15:35:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2019-01-14 15:35:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 15:35:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-14 15:35:47,571 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2019-01-14 15:35:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:47,571 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-14 15:35:47,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 15:35:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-14 15:35:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 15:35:47,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:47,573 INFO L402 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] [2019-01-14 15:35:47,573 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1577997690, now seen corresponding path program 1 times [2019-01-14 15:35:47,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:47,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:47,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:47,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:47,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:35:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:35:47,708 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:35:47,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:35:47 BoogieIcfgContainer [2019-01-14 15:35:47,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:35:47,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:35:47,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:35:47,752 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:35:47,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:23" (3/4) ... [2019-01-14 15:35:47,755 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:35:47,811 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:35:47,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:35:47,812 INFO L168 Benchmark]: Toolchain (without parser) took 25718.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -340.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:35:47,812 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:35:47,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:47,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:35:47,813 INFO L168 Benchmark]: Boogie Preprocessor took 43.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:47,813 INFO L168 Benchmark]: RCFGBuilder took 726.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:47,814 INFO L168 Benchmark]: TraceAbstraction took 24135.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -228.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:35:47,814 INFO L168 Benchmark]: Witness Printer took 59.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:47,816 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 689.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 726.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24135.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -228.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 59.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) [L578] COND FALSE !(!node) [L580] node->left = ((void *)0) [L581] node->right = nodelast [L582] COND FALSE !(\read(*nodelast)) [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) [L590] COND FALSE !(!node) [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) [L598] return nodelast; [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) [L564] COND FALSE !(!(node)) [L565] COND TRUE node != ((void *)0) [L566] node->left [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value [L568] COND TRUE !(node->value) [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 3 error locations. UNSAFE Result, 24.0s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 459 SDslu, 569 SDs, 0 SdLazy, 561 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 142 ConstructedInterpolants, 7 QuantifiedInterpolants, 105911 SizeOfPredicates, 33 NumberOfNonLiveVariables, 230 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 13/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...