./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/tree_true-unreach-call.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_true-unreach-call.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 e8c816154480634071eb5b358a84aead1db421f3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:18:21,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:18:21,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:18:21,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:18:21,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:18:21,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:18:21,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:18:21,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:18:21,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:18:21,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:18:21,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:18:21,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:18:21,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:18:21,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:18:21,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:18:21,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:18:21,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:18:22,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:18:22,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:18:22,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:18:22,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:18:22,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:18:22,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:18:22,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:18:22,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:18:22,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:18:22,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:18:22,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:18:22,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:18:22,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:18:22,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:18:22,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:18:22,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:18:22,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:18:22,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:18:22,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:18:22,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:18:22,050 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:18:22,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:18:22,052 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:18:22,053 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:18:22,053 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:18:22,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:18:22,053 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:18:22,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:18:22,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:18:22,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:18:22,054 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:18:22,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:18:22,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:18:22,054 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:18:22,055 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:18:22,056 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:18:22,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:18:22,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:18:22,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:18:22,057 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:18:22,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:18:22,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:18:22,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:18:22,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:18:22,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:18:22,059 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:18:22,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:18:22,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:18:22,059 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 -> e8c816154480634071eb5b358a84aead1db421f3 [2019-01-12 09:18:22,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:18:22,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:18:22,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:18:22,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:18:22,141 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:18:22,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/tree_true-unreach-call.i [2019-01-12 09:18:22,203 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd39d671/d285cef6f898450680c16195c040ce10/FLAG189a8fafe [2019-01-12 09:18:22,752 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:18:22,753 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/tree_true-unreach-call.i [2019-01-12 09:18:22,767 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd39d671/d285cef6f898450680c16195c040ce10/FLAG189a8fafe [2019-01-12 09:18:23,058 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd39d671/d285cef6f898450680c16195c040ce10 [2019-01-12 09:18:23,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:18:23,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:18:23,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:18:23,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:18:23,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:18:23,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14531785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23, skipping insertion in model container [2019-01-12 09:18:23,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:18:23,130 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:18:23,470 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:18:23,482 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:18:23,662 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:18:23,730 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:18:23,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23 WrapperNode [2019-01-12 09:18:23,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:18:23,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:18:23,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:18:23,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:18:23,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:18:23,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:18:23,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:18:23,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:18:23,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (1/1) ... [2019-01-12 09:18:23,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:18:23,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:18:23,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:18:23,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:18:23,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (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-12 09:18:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:18:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:18:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:18:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:18:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:18:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:18:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:18:23,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:18:24,618 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:18:24,619 INFO L286 CfgBuilder]: Removed 27 assue(true) statements. [2019-01-12 09:18:24,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:18:24 BoogieIcfgContainer [2019-01-12 09:18:24,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:18:24,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:18:24,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:18:24,623 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:18:24,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:18:23" (1/3) ... [2019-01-12 09:18:24,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da2db8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:18:24, skipping insertion in model container [2019-01-12 09:18:24,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:18:23" (2/3) ... [2019-01-12 09:18:24,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da2db8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:18:24, skipping insertion in model container [2019-01-12 09:18:24,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:18:24" (3/3) ... [2019-01-12 09:18:24,627 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_true-unreach-call.i [2019-01-12 09:18:24,637 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:18:24,644 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 09:18:24,661 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 09:18:24,691 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:18:24,692 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:18:24,692 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:18:24,693 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:18:24,693 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:18:24,693 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:18:24,693 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:18:24,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:18:24,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:18:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-12 09:18:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:18:24,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:24,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:18:24,721 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1437310363, now seen corresponding path program 1 times [2019-01-12 09:18:24,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:24,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:24,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:24,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:24,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:24,834 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-12 09:18:24,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:18:24,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:18:24,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:18:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:18:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:18:24,853 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-01-12 09:18:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:24,871 INFO L93 Difference]: Finished difference Result 92 states and 148 transitions. [2019-01-12 09:18:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:18:24,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:18:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:24,881 INFO L225 Difference]: With dead ends: 92 [2019-01-12 09:18:24,882 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 09:18:24,885 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-12 09:18:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 09:18:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-12 09:18:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 09:18:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-01-12 09:18:24,917 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 10 [2019-01-12 09:18:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:24,918 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-01-12 09:18:24,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:18:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-01-12 09:18:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:18:24,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:24,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:18:24,921 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1902394293, now seen corresponding path program 1 times [2019-01-12 09:18:24,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:24,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:25,069 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-12 09:18:25,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:18:25,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:18:25,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:18:25,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:18:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:18:25,073 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2019-01-12 09:18:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:25,274 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2019-01-12 09:18:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:18:25,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-12 09:18:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:25,278 INFO L225 Difference]: With dead ends: 61 [2019-01-12 09:18:25,278 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:18:25,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:18:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:18:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 09:18:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 09:18:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-12 09:18:25,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 11 [2019-01-12 09:18:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:25,288 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-12 09:18:25,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:18:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-01-12 09:18:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:18:25,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:25,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:18:25,290 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash -617565641, now seen corresponding path program 1 times [2019-01-12 09:18:25,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:25,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:25,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:25,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:25,420 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-12 09:18:25,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:18:25,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:18:25,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:18:25,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:18:25,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:18:25,422 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 5 states. [2019-01-12 09:18:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:25,722 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-01-12 09:18:25,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:18:25,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-12 09:18:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:25,726 INFO L225 Difference]: With dead ends: 81 [2019-01-12 09:18:25,727 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 09:18:25,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:18:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 09:18:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-12 09:18:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 09:18:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-12 09:18:25,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 11 [2019-01-12 09:18:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:25,736 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-12 09:18:25,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:18:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-01-12 09:18:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:18:25,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:25,737 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-12 09:18:25,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash -199489304, now seen corresponding path program 1 times [2019-01-12 09:18:25,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:25,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:25,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:25,846 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-12 09:18:25,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:18:25,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:18:25,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:18:25,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:18:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:18:25,848 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-01-12 09:18:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:25,942 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-01-12 09:18:25,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:18:25,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 09:18:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:25,947 INFO L225 Difference]: With dead ends: 63 [2019-01-12 09:18:25,948 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 09:18:25,949 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-12 09:18:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 09:18:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-12 09:18:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 09:18:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-12 09:18:25,961 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 19 [2019-01-12 09:18:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:25,962 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-12 09:18:25,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:18:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-12 09:18:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:18:25,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:25,963 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] [2019-01-12 09:18:25,964 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1552949996, now seen corresponding path program 1 times [2019-01-12 09:18:25,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:25,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:25,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:25,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:26,265 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-12 09:18:26,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:18:26,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:18:26,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:18:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:18:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:18:26,267 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2019-01-12 09:18:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:26,811 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-01-12 09:18:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:18:26,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-12 09:18:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:26,816 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:18:26,816 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 09:18:26,821 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-12 09:18:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 09:18:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-12 09:18:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 09:18:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-12 09:18:26,833 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 22 [2019-01-12 09:18:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:26,836 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-12 09:18:26,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:18:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-12 09:18:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:18:26,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:26,838 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-12 09:18:26,838 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1147750160, now seen corresponding path program 1 times [2019-01-12 09:18:26,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:26,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:26,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:26,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:27,569 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2019-01-12 09:18:27,887 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-12 09:18:27,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:18:27,888 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-12 09:18:27,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:27,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:18:27,992 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-12 09:18:27,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:28,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:28,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-12 09:18:28,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:28,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:28,101 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-12 09:18:28,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:28,162 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-12 09:18:28,165 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-12 09:18:28,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:28,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:28,204 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-12 09:18:28,207 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-12 09:18:28,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:28,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:28,224 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-12 09:18:28,225 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2019-01-12 09:18:29,309 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 189 DAG size of output: 71 [2019-01-12 09:18:29,315 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-12 09:18:29,363 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-12 09:18:29,475 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-12 09:18:29,519 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-12 09:18:29,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1092 treesize of output 951 [2019-01-12 09:18:29,653 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 76 treesize of output 75 [2019-01-12 09:18:29,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:29,717 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:18:29,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 948 [2019-01-12 09:18:29,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:29,784 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 741 treesize of output 426 [2019-01-12 09:18:29,788 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:29,824 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:29,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:29,958 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 1942 treesize of output 758 [2019-01-12 09:18:30,110 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-01-12 09:18:30,114 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-12 09:18:30,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,128 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-12 09:18:30,128 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,150 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,268 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 363 treesize of output 347 [2019-01-12 09:18:30,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,286 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 144 treesize of output 248 [2019-01-12 09:18:30,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,325 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 146 treesize of output 541 [2019-01-12 09:18:30,326 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,387 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,418 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,446 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,547 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 362 treesize of output 201 [2019-01-12 09:18:30,556 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-12 09:18:30,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,562 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-12 09:18:30,564 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,579 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,627 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 146 treesize of output 134 [2019-01-12 09:18:30,648 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 108 treesize of output 83 [2019-01-12 09:18:30,649 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,706 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,780 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 84 treesize of output 68 [2019-01-12 09:18:30,814 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 48 [2019-01-12 09:18:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,834 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 34 treesize of output 61 [2019-01-12 09:18:30,834 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:30,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:30,979 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 34 treesize of output 61 [2019-01-12 09:18:30,980 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:31,136 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 32 treesize of output 57 [2019-01-12 09:18:31,137 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2019-01-12 09:18:31,302 INFO L267 ElimStorePlain]: Start of recursive call 22: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-12 09:18:31,435 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 75 treesize of output 56 [2019-01-12 09:18:31,436 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:31,440 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 75 treesize of output 56 [2019-01-12 09:18:31,441 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:31,444 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 79 treesize of output 73 [2019-01-12 09:18:31,445 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:31,465 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 71 treesize of output 56 [2019-01-12 09:18:31,465 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:31,542 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-01-12 09:18:31,648 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-01-12 09:18:31,746 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-12 09:18:31,746 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 5 variables, input treesize:2667, output treesize:325 [2019-01-12 09:18:32,015 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-12 09:18:32,513 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 92 treesize of output 80 [2019-01-12 09:18:32,526 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 17 treesize of output 14 [2019-01-12 09:18:32,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-12 09:18:32,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:18:32,673 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-12 09:18:32,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, 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-12 09:18:32,678 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-12 09:18:32,700 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-12 09:18:32,701 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:32,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:32,806 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 105 treesize of output 80 [2019-01-12 09:18:32,817 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 60 treesize of output 48 [2019-01-12 09:18:32,818 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-12 09:18:32,843 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-12 09:18:32,844 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:32,858 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-12 09:18:33,019 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 48 treesize of output 40 [2019-01-12 09:18:33,023 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-12 09:18:33,023 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-12 09:18:33,041 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-12 09:18:33,042 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,050 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-12 09:18:33,161 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 39 treesize of output 35 [2019-01-12 09:18:33,179 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 17 treesize of output 14 [2019-01-12 09:18:33,180 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-12 09:18:33,195 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:18:33,277 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 29 treesize of output 23 [2019-01-12 09:18:33,280 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-12 09:18:33,281 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,292 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 8 treesize of output 6 [2019-01-12 09:18:33,293 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,294 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,296 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 22 treesize of output 18 [2019-01-12 09:18:33,303 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-12 09:18:33,303 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,307 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,376 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 74 treesize of output 55 [2019-01-12 09:18:33,380 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 25 treesize of output 19 [2019-01-12 09:18:33,381 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:33,397 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-12 09:18:33,398 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,407 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:33,411 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 67 treesize of output 48 [2019-01-12 09:18:33,416 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 25 treesize of output 19 [2019-01-12 09:18:33,417 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:33,437 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-12 09:18:33,437 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,445 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:33,479 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 29 treesize of output 23 [2019-01-12 09:18:33,491 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-12 09:18:33,491 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,517 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 8 treesize of output 6 [2019-01-12 09:18:33,517 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,541 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,558 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 22 treesize of output 18 [2019-01-12 09:18:33,591 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-12 09:18:33,592 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,613 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,636 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 23 treesize of output 19 [2019-01-12 09:18:33,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:18:33,658 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2019-01-12 09:18:33,666 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:18:33,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:33,688 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 16 variables, input treesize:290, output treesize:1 [2019-01-12 09:18:33,697 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-12 09:18:33,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:18:33,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-01-12 09:18:33,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 09:18:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 09:18:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:18:33,724 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 17 states. [2019-01-12 09:18:34,223 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-01-12 09:18:34,660 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-12 09:18:35,360 WARN L181 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2019-01-12 09:18:36,364 WARN L181 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 146 [2019-01-12 09:18:37,247 WARN L181 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 148 [2019-01-12 09:18:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:37,473 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-01-12 09:18:37,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:18:37,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-12 09:18:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:37,475 INFO L225 Difference]: With dead ends: 70 [2019-01-12 09:18:37,475 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 09:18:37,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-01-12 09:18:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 09:18:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 36. [2019-01-12 09:18:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 09:18:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-12 09:18:37,489 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2019-01-12 09:18:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:37,490 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-12 09:18:37,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 09:18:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-12 09:18:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:18:37,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:37,495 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-12 09:18:37,495 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:37,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1147042128, now seen corresponding path program 1 times [2019-01-12 09:18:37,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:37,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:37,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:37,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:37,800 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-12 09:18:37,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:18:37,801 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-12 09:18:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:37,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:18:37,869 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-12 09:18:37,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:37,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:37,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-12 09:18:38,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,015 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-12 09:18:38,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,031 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-12 09:18:38,038 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-12 09:18:38,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,051 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-12 09:18:38,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-01-12 09:18:38,089 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-12 09:18:38,093 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-12 09:18:38,094 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-12 09:18:38,097 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-12 09:18:38,108 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-12 09:18:38,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:145, output treesize:105 [2019-01-12 09:18:38,357 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 49 [2019-01-12 09:18:38,371 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 280 treesize of output 255 [2019-01-12 09:18:38,376 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-12 09:18:38,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,383 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-12 09:18:38,384 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,417 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 254 treesize of output 218 [2019-01-12 09:18:38,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,468 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-12 09:18:38,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,529 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 194 treesize of output 166 [2019-01-12 09:18:38,530 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:38,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:38,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:38,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:38,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:38,599 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 433 treesize of output 431 [2019-01-12 09:18:38,603 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 431 treesize of output 429 [2019-01-12 09:18:38,604 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-12 09:18:38,608 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-12 09:18:38,640 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 467 treesize of output 130 [2019-01-12 09:18:38,680 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 17 treesize of output 20 [2019-01-12 09:18:38,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,685 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 20 treesize of output 31 [2019-01-12 09:18:38,686 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,694 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:38,769 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 67 treesize of output 51 [2019-01-12 09:18:38,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,779 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 32 treesize of output 54 [2019-01-12 09:18:38,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:38,825 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 34 treesize of output 93 [2019-01-12 09:18:38,828 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2019-01-12 09:18:38,922 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-12 09:18:38,976 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-12 09:18:39,041 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-12 09:18:39,111 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-12 09:18:39,111 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:1057, output treesize:191 [2019-01-12 09:18:39,714 WARN L181 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-01-12 09:18:43,729 WARN L181 SmtUtils]: Spent 3.87 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 09:18:44,301 WARN L181 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 09:18:44,318 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 48 treesize of output 30 [2019-01-12 09:18:44,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:44,323 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 13 treesize of output 6 [2019-01-12 09:18:44,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:44,332 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-12 09:18:44,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:44,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:44,378 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-12 09:18:44,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:44,410 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-12 09:18:44,411 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-12 09:18:44,439 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-12 09:18:44,440 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:44,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:18:44,497 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 48 treesize of output 30 [2019-01-12 09:18:44,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:44,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 13 treesize of output 6 [2019-01-12 09:18:44,503 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:44,518 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-12 09:18:44,519 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:44,526 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:44,553 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-12 09:18:44,553 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:158, output treesize:4 [2019-01-12 09:18:44,581 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-12 09:18:44,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:18:44,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-01-12 09:18:44,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 09:18:44,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 09:18:44,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:18:44,600 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 14 states. [2019-01-12 09:18:45,500 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-12 09:18:47,706 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 115 [2019-01-12 09:18:48,446 WARN L181 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-12 09:18:54,939 WARN L181 SmtUtils]: Spent 6.41 s on a formula simplification that was a NOOP. DAG size: 152 [2019-01-12 09:18:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:55,076 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-01-12 09:18:55,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:18:55,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-12 09:18:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:55,078 INFO L225 Difference]: With dead ends: 79 [2019-01-12 09:18:55,078 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 09:18:55,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-01-12 09:18:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 09:18:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-12 09:18:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 09:18:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-01-12 09:18:55,092 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 27 [2019-01-12 09:18:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:55,092 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-01-12 09:18:55,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 09:18:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-01-12 09:18:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:18:55,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:55,093 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, 1, 1, 1] [2019-01-12 09:18:55,096 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -384468434, now seen corresponding path program 1 times [2019-01-12 09:18:55,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:55,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:55,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:55,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:55,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:55,542 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-12 09:18:55,719 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-12 09:18:55,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:18:55,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:18:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:55,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:18:55,790 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-12 09:18:55,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-12 09:18:55,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:18:55,824 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 10 treesize of output 9 [2019-01-12 09:18:55,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-12 09:18:55,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-12 09:18:55,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:55,852 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 24 treesize of output 33 [2019-01-12 09:18:55,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2019-01-12 09:18:55,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:55,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:55,882 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-12 09:18:55,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,902 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-12 09:18:55,905 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-12 09:18:55,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:55,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:56,163 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 25 treesize of output 20 [2019-01-12 09:18:56,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:56,230 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 20 treesize of output 27 [2019-01-12 09:18:56,231 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:56,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:56,304 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-12 09:18:56,305 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:55, output treesize:27 [2019-01-12 09:18:57,451 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 186 DAG size of output: 72 [2019-01-12 09:18:57,454 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-12 09:18:57,460 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-12 09:18:57,516 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 841 treesize of output 405 [2019-01-12 09:18:57,599 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-12 09:18:57,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:57,605 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-12 09:18:57,606 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,655 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 192 treesize of output 161 [2019-01-12 09:18:57,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:57,663 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 21 treesize of output 14 [2019-01-12 09:18:57,663 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,689 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 136 treesize of output 112 [2019-01-12 09:18:57,691 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:57,711 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-12 09:18:57,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:57,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2019-01-12 09:18:57,782 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-12 09:18:57,782 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,789 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,808 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 57 treesize of output 53 [2019-01-12 09:18:57,812 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 53 treesize of output 49 [2019-01-12 09:18:57,812 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:57,820 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:57,847 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-12 09:18:57,850 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 24 treesize of output 1 [2019-01-12 09:18:57,850 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,854 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,877 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2019-01-12 09:18:57,880 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 46 treesize of output 49 [2019-01-12 09:18:57,898 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 49 treesize of output 67 [2019-01-12 09:18:57,899 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2019-01-12 09:18:57,905 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:18:57,919 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:18:57,947 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 42 treesize of output 46 [2019-01-12 09:18:57,950 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 21 treesize of output 24 [2019-01-12 09:18:57,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:57,954 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 24 treesize of output 39 [2019-01-12 09:18:57,954 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,960 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,975 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 38 treesize of output 32 [2019-01-12 09:18:57,978 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 28 treesize of output 22 [2019-01-12 09:18:57,979 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-12 09:18:57,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:57,989 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 13 treesize of output 6 [2019-01-12 09:18:57,990 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:57,994 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:57,999 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:18:58,005 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 40 treesize of output 44 [2019-01-12 09:18:58,009 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 21 treesize of output 24 [2019-01-12 09:18:58,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:58,013 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 24 treesize of output 39 [2019-01-12 09:18:58,013 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,020 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,034 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 36 treesize of output 30 [2019-01-12 09:18:58,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:58,038 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-12 09:18:58,038 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,046 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 9 treesize of output 1 [2019-01-12 09:18:58,046 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,064 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,086 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,125 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:1901, output treesize:11 [2019-01-12 09:18:58,159 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 15 treesize of output 11 [2019-01-12 09:18:58,162 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 11 treesize of output 3 [2019-01-12 09:18:58,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:58,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-12 09:18:58,168 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-12 09:18:58,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:18:58,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 09:18:58,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:18:58,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:18:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:18:58,187 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2019-01-12 09:18:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:18:58,720 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-01-12 09:18:58,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:18:58,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-01-12 09:18:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:18:58,722 INFO L225 Difference]: With dead ends: 88 [2019-01-12 09:18:58,722 INFO L226 Difference]: Without dead ends: 86 [2019-01-12 09:18:58,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-01-12 09:18:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-12 09:18:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2019-01-12 09:18:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 09:18:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-01-12 09:18:58,741 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 30 [2019-01-12 09:18:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:18:58,741 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-01-12 09:18:58,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:18:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-01-12 09:18:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:18:58,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:18:58,745 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:18:58,745 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:18:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:18:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1885049124, now seen corresponding path program 2 times [2019-01-12 09:18:58,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:18:58,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:18:58,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:58,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:18:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:18:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:18:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:18:59,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:18:59,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:18:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:18:59,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:18:59,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:18:59,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:18:59,398 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-12 09:18:59,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-12 09:18:59,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-12 09:18:59,523 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 13 treesize of output 16 [2019-01-12 09:18:59,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,527 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 16 treesize of output 23 [2019-01-12 09:18:59,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-12 09:18:59,559 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 13 treesize of output 16 [2019-01-12 09:18:59,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,562 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 16 treesize of output 23 [2019-01-12 09:18:59,563 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,568 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,586 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:38, output treesize:38 [2019-01-12 09:18:59,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2019-01-12 09:18:59,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,630 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 29 treesize of output 37 [2019-01-12 09:18:59,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2019-01-12 09:18:59,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,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 29 treesize of output 37 [2019-01-12 09:18:59,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:38 [2019-01-12 09:18:59,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-01-12 09:18:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,728 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 46 [2019-01-12 09:18:59,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-01-12 09:18:59,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,779 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 46 [2019-01-12 09:18:59,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-01-12 09:18:59,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,866 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-12 09:18:59,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,897 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 37 treesize of output 28 [2019-01-12 09:18:59,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,910 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 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-12 09:18:59,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,966 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 37 treesize of output 28 [2019-01-12 09:18:59,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:18:59,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-12 09:18:59,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:18:59,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:00,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:00,006 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:83, output treesize:45 [2019-01-12 09:19:00,707 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 61 [2019-01-12 09:19:00,708 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-12 09:19:00,716 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-12 09:19:00,753 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-12 09:19:00,758 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-12 09:19:00,797 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 379 treesize of output 191 [2019-01-12 09:19:00,845 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-12 09:19:00,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:00,850 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-12 09:19:00,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:00,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:00,885 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 144 treesize of output 121 [2019-01-12 09:19:00,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:00,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:00,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:00,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2019-01-12 09:19:00,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:00,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:00,919 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 21 treesize of output 14 [2019-01-12 09:19:00,920 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:00,932 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:00,943 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:00,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 79 treesize of output 83 [2019-01-12 09:19:00,978 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 52 treesize of output 47 [2019-01-12 09:19:00,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:00,982 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 47 treesize of output 55 [2019-01-12 09:19:00,982 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:00,991 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:01,013 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 59 treesize of output 47 [2019-01-12 09:19:01,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,021 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 29 treesize of output 64 [2019-01-12 09:19:01,022 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:01,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2019-01-12 09:19:01,056 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:01,066 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:01,080 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 35 treesize of output 31 [2019-01-12 09:19:01,082 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-12 09:19:01,083 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:01,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:01,096 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 20 treesize of output 21 [2019-01-12 09:19:01,097 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:01,098 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:01,099 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:01,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:01,102 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:1893, output treesize:3 [2019-01-12 09:19:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:01,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:19:01,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-01-12 09:19:01,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 09:19:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 09:19:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:19:01,136 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 14 states. [2019-01-12 09:19:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:19:01,664 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2019-01-12 09:19:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:19:01,665 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-01-12 09:19:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:19:01,666 INFO L225 Difference]: With dead ends: 131 [2019-01-12 09:19:01,666 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:19:01,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-01-12 09:19:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:19:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:19:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:19:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:19:01,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-12 09:19:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:19:01,668 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:19:01,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 09:19:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:19:01,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:19:01,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:19:01,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:01,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:01,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:01,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:01,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:01,786 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 48 [2019-01-12 09:19:01,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:01,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:01,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:19:02,466 WARN L181 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 15 [2019-01-12 09:19:02,907 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2019-01-12 09:19:05,650 WARN L181 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 181 DAG size of output: 18 [2019-01-12 09:19:05,701 INFO L448 ceAbstractionStarter]: For program point L564-1(line 564) no Hoare annotation was computed. [2019-01-12 09:19:05,701 INFO L444 ceAbstractionStarter]: At program point L564-2(line 564) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_create_tree_~nodelast~0.base)) (not (= 0 ULTIMATE.start_inspect_~node.base)) (not (= 0 ULTIMATE.start_main_~data~0.base)) (not (= 0 |ULTIMATE.start_create_tree_#res.base|)) (= ULTIMATE.start_create_tree_~node~0.offset 0) (= ULTIMATE.start_create_tree_~node~0.base 0)) [2019-01-12 09:19:05,701 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 615) no Hoare annotation was computed. [2019-01-12 09:19:05,701 INFO L448 ceAbstractionStarter]: For program point L614-2(lines 614 615) no Hoare annotation was computed. [2019-01-12 09:19:05,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:19:05,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L451 ceAbstractionStarter]: At program point L606-2(lines 606 610) the Hoare annotation is: true [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 563 571) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 583) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 582 583) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 608) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 567) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 625) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L567-1(line 567) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L448 ceAbstractionStarter]: For program point L567-2(line 567) no Hoare annotation was computed. [2019-01-12 09:19:05,702 INFO L444 ceAbstractionStarter]: At program point L567-3(line 567) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_create_tree_~nodelast~0.base)) (not (= 0 ULTIMATE.start_main_~data~0.base)) (not (= 0 |ULTIMATE.start_create_tree_#res.base|)) (= ULTIMATE.start_create_tree_~node~0.offset 0) (= ULTIMATE.start_create_tree_~node~0.base 0)) [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 573 603) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L592-2(lines 592 601) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 576 589) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L444 ceAbstractionStarter]: At program point L576-3(lines 576 589) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_create_tree_~node~0.offset 0))) (or (and (= ULTIMATE.start_create_tree_~nodelast~0.offset 0) (= ULTIMATE.start_create_tree_~nodelast~0.base 0) .cse0 (= ULTIMATE.start_create_tree_~node~0.base 0)) (and (= ULTIMATE.start_create_tree_~node~0.offset ULTIMATE.start_create_tree_~nodelast~0.offset) (= ULTIMATE.start_create_tree_~node~0.base ULTIMATE.start_create_tree_~nodelast~0.base) (= (select |#valid| ULTIMATE.start_create_tree_~node~0.base) 1) .cse0))) [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L576-4(lines 573 603) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L568-1(line 568) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L568-2(lines 565 570) no Hoare annotation was computed. [2019-01-12 09:19:05,703 INFO L448 ceAbstractionStarter]: For program point L568-3(line 568) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 586) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 585 586) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L444 ceAbstractionStarter]: At program point L602(lines 572 603) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_create_tree_~nodelast~0.base)) (.cse2 (= ULTIMATE.start_create_tree_~node~0.offset 0)) (.cse1 (= 0 |ULTIMATE.start_create_tree_#res.base|)) (.cse3 (= ULTIMATE.start_create_tree_~node~0.base 0))) (or (and (not .cse0) (not .cse1) .cse2 .cse3) (and (= 0 ULTIMATE.start_create_tree_~nodelast~0.offset) .cse0 (= 0 |ULTIMATE.start_create_tree_#res.offset|) .cse2 .cse1 .cse3))) [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 595) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L594-2(lines 594 595) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 579) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L611-1(lines 604 620) no Hoare annotation was computed. [2019-01-12 09:19:05,704 INFO L448 ceAbstractionStarter]: For program point L611-2(lines 611 618) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point L578-2(lines 578 579) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L451 ceAbstractionStarter]: At program point L628(lines 621 629) the Hoare annotation is: true [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point L554-1(line 554) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point L554-2(line 554) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 613) no Hoare annotation was computed. [2019-01-12 09:19:05,705 INFO L448 ceAbstractionStarter]: For program point L612-2(lines 612 613) no Hoare annotation was computed. [2019-01-12 09:19:05,706 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 620) no Hoare annotation was computed. [2019-01-12 09:19:05,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:19:05 BoogieIcfgContainer [2019-01-12 09:19:05,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:19:05,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:19:05,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:19:05,730 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:19:05,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:18:24" (3/4) ... [2019-01-12 09:19:05,736 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:19:05,747 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 09:19:05,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 09:19:05,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:19:05,772 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == nodelast) && !(0 == \result)) && node == 0) && node == 0) || (((((0 == nodelast && 0 == nodelast) && 0 == \result) && node == 0) && 0 == \result) && node == 0) [2019-01-12 09:19:05,773 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(0 == nodelast) && !(0 == node)) && !(0 == data)) && !(0 == \result)) && node == 0) && node == 0 [2019-01-12 09:19:05,792 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:19:05,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:19:05,793 INFO L168 Benchmark]: Toolchain (without parser) took 42730.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -105.7 MB). Peak memory consumption was 222.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:19:05,793 INFO L168 Benchmark]: CDTParser took 0.16 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-12 09:19:05,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:19:05,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.16 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-12 09:19:05,796 INFO L168 Benchmark]: Boogie Preprocessor took 58.81 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-12 09:19:05,797 INFO L168 Benchmark]: RCFGBuilder took 765.09 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.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:19:05,797 INFO L168 Benchmark]: TraceAbstraction took 41108.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 203.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:19:05,797 INFO L168 Benchmark]: Witness Printer took 62.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:19:05,800 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.16 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 666.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.16 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 58.81 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. * RCFGBuilder took 765.09 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.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41108.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 203.0 MB. Max. memory is 11.5 GB. * Witness Printer took 62.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 554]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 554]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 621]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: (((!(0 == nodelast) && !(0 == data)) && !(0 == \result)) && node == 0) && node == 0 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((nodelast == 0 && nodelast == 0) && node == 0) && node == 0) || (((node == nodelast && node == nodelast) && \valid[node] == 1) && node == 0) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((!(0 == nodelast) && !(0 == node)) && !(0 == data)) && !(0 == \result)) && node == 0) && node == 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((!(0 == nodelast) && !(0 == \result)) && node == 0) && node == 0) || (((((0 == nodelast && 0 == nodelast) && 0 == \result) && node == 0) && 0 == \result) && node == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 3 error locations. SAFE Result, 41.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 16.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 651 SDslu, 919 SDs, 0 SdLazy, 836 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 104 SyntacticMatches, 21 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 22.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 95 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 28 NumberOfFragments, 108 HoareAnnotationTreeSize, 6 FomulaSimplifications, 49413 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1776 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 288 ConstructedInterpolants, 16 QuantifiedInterpolants, 196996 SizeOfPredicates, 57 NumberOfNonLiveVariables, 522 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 21/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...