./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/eureka_01_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/loops/eureka_01_false-unreach-call_true-termination.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 70bf824eb1ce7a6b047f1b7928100a687c12a44d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:36:35,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:36:35,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:36:35,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:36:35,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:36:35,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:36:35,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:36:35,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:36:35,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:36:35,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:36:35,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:36:35,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:36:35,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:36:35,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:36:35,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:36:35,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:36:35,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:36:35,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:36:35,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:36:35,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:36:35,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:36:35,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:36:35,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:36:35,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:36:35,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:36:35,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:36:35,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:36:35,370 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:36:35,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:36:35,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:36:35,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:36:35,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:36:35,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:36:35,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:36:35,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:36:35,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:36:35,386 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:36:35,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:36:35,419 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:36:35,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:36:35,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:36:35,422 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:36:35,422 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:36:35,422 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:36:35,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:36:35,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:36:35,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:36:35,423 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:36:35,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:36:35,423 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:36:35,423 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:36:35,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:36:35,426 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:36:35,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:36:35,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:36:35,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:36:35,426 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:36:35,426 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:36:35,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:36:35,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:36:35,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:36:35,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:36:35,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:36:35,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:36:35,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:36:35,432 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 -> 70bf824eb1ce7a6b047f1b7928100a687c12a44d [2018-12-31 05:36:35,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:36:35,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:36:35,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:36:35,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:36:35,501 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:36:35,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-12-31 05:36:35,584 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac792ffe4/d244532e735b4eab93f66b00173142b2/FLAG51e453e31 [2018-12-31 05:36:36,010 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:36:36,011 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-12-31 05:36:36,021 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac792ffe4/d244532e735b4eab93f66b00173142b2/FLAG51e453e31 [2018-12-31 05:36:36,391 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac792ffe4/d244532e735b4eab93f66b00173142b2 [2018-12-31 05:36:36,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:36:36,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:36:36,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:36:36,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:36:36,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:36:36,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283bee70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36, skipping insertion in model container [2018-12-31 05:36:36,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:36:36,440 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:36:36,685 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:36:36,691 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:36:36,740 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:36:36,764 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:36:36,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36 WrapperNode [2018-12-31 05:36:36,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:36:36,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:36:36,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:36:36,765 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:36:36,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:36:36,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:36:36,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:36:36,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:36:36,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (1/1) ... [2018-12-31 05:36:36,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:36:36,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:36:36,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:36:36,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:36:36,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (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 [2018-12-31 05:36:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 05:36:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:36:37,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:36:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 05:36:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 05:36:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 05:36:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:36:37,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:36:37,689 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-31 05:36:37,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:36:37 BoogieIcfgContainer [2018-12-31 05:36:37,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:36:37,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:36:37,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:36:37,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:36:37,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:36:36" (1/3) ... [2018-12-31 05:36:37,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cddf99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:36:37, skipping insertion in model container [2018-12-31 05:36:37,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:36" (2/3) ... [2018-12-31 05:36:37,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cddf99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:36:37, skipping insertion in model container [2018-12-31 05:36:37,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:36:37" (3/3) ... [2018-12-31 05:36:37,699 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_false-unreach-call_true-termination.i [2018-12-31 05:36:37,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:36:37,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:36:37,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:36:37,774 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:36:37,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:36:37,775 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:36:37,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:36:37,776 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:36:37,776 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:36:37,776 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:36:37,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:36:37,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:36:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 05:36:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 05:36:37,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:37,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:37,806 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:37,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2018-12-31 05:36:37,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:37,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:37,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:38,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:36:38,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 05:36:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:36:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:36:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:36:38,221 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-31 05:36:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:38,539 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2018-12-31 05:36:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:36:38,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-31 05:36:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:38,552 INFO L225 Difference]: With dead ends: 89 [2018-12-31 05:36:38,553 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 05:36:38,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:36:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 05:36:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2018-12-31 05:36:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 05:36:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-12-31 05:36:38,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2018-12-31 05:36:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:38,598 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-31 05:36:38,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:36:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-12-31 05:36:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 05:36:38,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:38,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:38,600 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:38,601 INFO L82 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2018-12-31 05:36:38,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:38,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:38,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:38,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:39,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:39,007 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 [2018-12-31 05:36:39,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:39,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:39,156 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 11 treesize of output 8 [2018-12-31 05:36:39,162 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 [2018-12-31 05:36:39,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:39,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:39,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:39,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-31 05:36:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:39,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:39,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 05:36:39,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 05:36:39,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 05:36:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:36:39,412 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 6 states. [2018-12-31 05:36:39,900 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 05:36:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:40,172 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2018-12-31 05:36:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:36:40,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 05:36:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:40,178 INFO L225 Difference]: With dead ends: 69 [2018-12-31 05:36:40,178 INFO L226 Difference]: Without dead ends: 67 [2018-12-31 05:36:40,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:36:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-31 05:36:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-12-31 05:36:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 05:36:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-12-31 05:36:40,190 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2018-12-31 05:36:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:40,190 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-12-31 05:36:40,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 05:36:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-12-31 05:36:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 05:36:40,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:40,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:40,192 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2018-12-31 05:36:40,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:40,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:40,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:40,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:36:40,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:36:40,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:36:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:36:40,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:36:40,259 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2018-12-31 05:36:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:40,514 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-12-31 05:36:40,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:36:40,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 05:36:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:40,515 INFO L225 Difference]: With dead ends: 66 [2018-12-31 05:36:40,516 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 05:36:40,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:36:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 05:36:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-31 05:36:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 05:36:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-12-31 05:36:40,530 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2018-12-31 05:36:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:40,531 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-12-31 05:36:40,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:36:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-12-31 05:36:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 05:36:40,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:40,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:40,534 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:40,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2018-12-31 05:36:40,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:40,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:40,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:40,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:40,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:40,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:40,907 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 [2018-12-31 05:36:40,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:40,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:41,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:41,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-31 05:36:41,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:36:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:36:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:36:41,056 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 8 states. [2018-12-31 05:36:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:41,213 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2018-12-31 05:36:41,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:36:41,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-31 05:36:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:41,218 INFO L225 Difference]: With dead ends: 114 [2018-12-31 05:36:41,219 INFO L226 Difference]: Without dead ends: 86 [2018-12-31 05:36:41,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 05:36:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-31 05:36:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-12-31 05:36:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 05:36:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-12-31 05:36:41,230 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2018-12-31 05:36:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:41,231 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-12-31 05:36:41,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:36:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2018-12-31 05:36:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 05:36:41,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:41,232 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:41,233 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2018-12-31 05:36:41,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:41,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:41,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:41,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:41,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:41,369 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 [2018-12-31 05:36:41,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:41,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:41,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:41,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-31 05:36:41,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 05:36:41,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 05:36:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 05:36:41,610 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand 10 states. [2018-12-31 05:36:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:42,370 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2018-12-31 05:36:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 05:36:42,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-31 05:36:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:42,375 INFO L225 Difference]: With dead ends: 181 [2018-12-31 05:36:42,375 INFO L226 Difference]: Without dead ends: 159 [2018-12-31 05:36:42,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-31 05:36:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-31 05:36:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2018-12-31 05:36:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-31 05:36:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2018-12-31 05:36:42,397 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2018-12-31 05:36:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:42,398 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2018-12-31 05:36:42,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 05:36:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2018-12-31 05:36:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 05:36:42,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:42,399 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] [2018-12-31 05:36:42,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2018-12-31 05:36:42,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:42,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:42,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:42,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:42,810 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 [2018-12-31 05:36:42,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:42,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:42,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:42,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-31 05:36:42,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 05:36:42,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 05:36:42,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-31 05:36:42,929 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand 10 states. [2018-12-31 05:36:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:43,156 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2018-12-31 05:36:43,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 05:36:43,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-31 05:36:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:43,158 INFO L225 Difference]: With dead ends: 206 [2018-12-31 05:36:43,158 INFO L226 Difference]: Without dead ends: 146 [2018-12-31 05:36:43,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:36:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-31 05:36:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2018-12-31 05:36:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-31 05:36:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2018-12-31 05:36:43,179 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2018-12-31 05:36:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:43,179 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-12-31 05:36:43,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 05:36:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2018-12-31 05:36:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 05:36:43,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:43,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:43,181 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2018-12-31 05:36:43,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:43,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:43,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:43,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:44,126 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 23 [2018-12-31 05:36:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:44,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:44,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:36:44,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:44,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:44,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:44,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-12-31 05:36:44,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:36:44,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:44,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:44,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:44,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 05:36:44,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,541 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:21 [2018-12-31 05:36:44,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:44,583 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-12-31 05:36:44,606 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 18 treesize of output 16 [2018-12-31 05:36:44,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-12-31 05:36:44,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:45,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:45,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:45,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2018-12-31 05:36:45,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:45,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:45,062 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-12-31 05:36:45,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:36:45,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:45,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 05:36:45,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-12-31 05:36:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:45,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:45,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-12-31 05:36:45,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 05:36:45,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 05:36:45,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-12-31 05:36:45,408 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand 20 states. [2018-12-31 05:36:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:48,443 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2018-12-31 05:36:48,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-31 05:36:48,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-12-31 05:36:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:48,449 INFO L225 Difference]: With dead ends: 252 [2018-12-31 05:36:48,449 INFO L226 Difference]: Without dead ends: 230 [2018-12-31 05:36:48,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=558, Invalid=1892, Unknown=0, NotChecked=0, Total=2450 [2018-12-31 05:36:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-31 05:36:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 96. [2018-12-31 05:36:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-31 05:36:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2018-12-31 05:36:48,477 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 25 [2018-12-31 05:36:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:48,477 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2018-12-31 05:36:48,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 05:36:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2018-12-31 05:36:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 05:36:48,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:48,479 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:48,479 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:48,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:48,479 INFO L82 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2018-12-31 05:36:48,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:48,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:48,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:48,760 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 6 [2018-12-31 05:36:48,950 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-12-31 05:36:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 05:36:49,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:49,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:36:49,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:36:49,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:36:49,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:36:49,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:49,146 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 15 treesize of output 12 [2018-12-31 05:36:49,149 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 12 treesize of output 11 [2018-12-31 05:36:49,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:49,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:49,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:49,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-31 05:36:49,251 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 21 treesize of output 16 [2018-12-31 05:36:49,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:49,267 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 [2018-12-31 05:36:49,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:49,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:49,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:49,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-12-31 05:36:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 05:36:49,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:49,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-31 05:36:49,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 05:36:49,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 05:36:49,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-31 05:36:49,323 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 10 states. [2018-12-31 05:36:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:49,623 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2018-12-31 05:36:49,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 05:36:49,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-31 05:36:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:49,634 INFO L225 Difference]: With dead ends: 204 [2018-12-31 05:36:49,634 INFO L226 Difference]: Without dead ends: 136 [2018-12-31 05:36:49,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:36:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-31 05:36:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 98. [2018-12-31 05:36:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-31 05:36:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2018-12-31 05:36:49,660 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 25 [2018-12-31 05:36:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:49,661 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2018-12-31 05:36:49,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 05:36:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-12-31 05:36:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 05:36:49,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:49,662 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:49,663 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2018-12-31 05:36:49,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:49,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:49,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:36:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:50,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:50,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:36:50,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:36:50,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:36:50,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:36:50,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:50,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:50,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-31 05:36:50,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 05:36:50,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 05:36:50,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 05:36:50,495 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 10 states. [2018-12-31 05:36:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:51,179 INFO L93 Difference]: Finished difference Result 202 states and 251 transitions. [2018-12-31 05:36:51,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 05:36:51,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-12-31 05:36:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:51,182 INFO L225 Difference]: With dead ends: 202 [2018-12-31 05:36:51,182 INFO L226 Difference]: Without dead ends: 189 [2018-12-31 05:36:51,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-12-31 05:36:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-31 05:36:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 131. [2018-12-31 05:36:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-31 05:36:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2018-12-31 05:36:51,201 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 171 transitions. Word has length 28 [2018-12-31 05:36:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:51,201 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 171 transitions. [2018-12-31 05:36:51,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 05:36:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2018-12-31 05:36:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 05:36:51,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:51,203 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:51,204 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2018-12-31 05:36:51,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:51,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:51,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:51,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:36:51,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 05:36:51,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:51,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:36:51,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:51,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:51,717 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 [2018-12-31 05:36:51,719 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 [2018-12-31 05:36:51,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:51,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:51,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:51,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-31 05:36:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 05:36:51,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:51,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-12-31 05:36:51,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 05:36:51,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 05:36:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-31 05:36:51,790 INFO L87 Difference]: Start difference. First operand 131 states and 171 transitions. Second operand 14 states. [2018-12-31 05:36:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:52,609 INFO L93 Difference]: Finished difference Result 304 states and 397 transitions. [2018-12-31 05:36:52,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 05:36:52,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-12-31 05:36:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:52,614 INFO L225 Difference]: With dead ends: 304 [2018-12-31 05:36:52,614 INFO L226 Difference]: Without dead ends: 302 [2018-12-31 05:36:52,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-12-31 05:36:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-31 05:36:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 225. [2018-12-31 05:36:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-31 05:36:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 298 transitions. [2018-12-31 05:36:52,646 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 298 transitions. Word has length 29 [2018-12-31 05:36:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:52,646 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 298 transitions. [2018-12-31 05:36:52,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 05:36:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 298 transitions. [2018-12-31 05:36:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 05:36:52,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:52,648 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:52,648 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2018-12-31 05:36:52,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:52,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:52,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:52,914 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 27 [2018-12-31 05:36:53,224 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 31 [2018-12-31 05:36:53,669 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 32 [2018-12-31 05:36:54,333 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 17 [2018-12-31 05:36:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:54,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:54,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:36:54,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:36:54,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 05:36:54,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:36:54,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:54,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:54,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-12-31 05:36:54,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:36:54,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:54,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:54,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:54,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 05:36:54,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:54,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:54,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:54,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:54,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:39 [2018-12-31 05:36:54,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:54,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2018-12-31 05:36:54,697 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 18 treesize of output 16 [2018-12-31 05:36:54,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:54,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:54,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:54,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2018-12-31 05:36:55,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 77 [2018-12-31 05:36:55,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,100 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-12-31 05:36:55,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:36:55,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:55,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:36:55,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-12-31 05:36:55,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 87 [2018-12-31 05:36:55,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,447 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 97 [2018-12-31 05:36:55,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-31 05:36:55,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-31 05:36:55,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-12-31 05:36:55,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:328 [2018-12-31 05:36:58,447 WARN L181 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 131 DAG size of output: 42 [2018-12-31 05:36:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:36:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:58,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-12-31 05:36:58,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 05:36:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 05:36:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-12-31 05:36:58,826 INFO L87 Difference]: Start difference. First operand 225 states and 298 transitions. Second operand 25 states. [2018-12-31 05:37:00,086 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-12-31 05:37:00,777 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 65 [2018-12-31 05:37:01,412 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-12-31 05:37:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:02,075 INFO L93 Difference]: Finished difference Result 260 states and 338 transitions. [2018-12-31 05:37:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 05:37:02,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-12-31 05:37:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:02,078 INFO L225 Difference]: With dead ends: 260 [2018-12-31 05:37:02,078 INFO L226 Difference]: Without dead ends: 241 [2018-12-31 05:37:02,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=355, Invalid=1367, Unknown=0, NotChecked=0, Total=1722 [2018-12-31 05:37:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-31 05:37:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 228. [2018-12-31 05:37:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-31 05:37:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 302 transitions. [2018-12-31 05:37:02,105 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 302 transitions. Word has length 31 [2018-12-31 05:37:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:02,106 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 302 transitions. [2018-12-31 05:37:02,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 05:37:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 302 transitions. [2018-12-31 05:37:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 05:37:02,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:02,107 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:02,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2018-12-31 05:37:02,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:02,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:02,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 05:37:02,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:02,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:02,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:02,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 05:37:02,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:02,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-31 05:37:02,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 05:37:02,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 05:37:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:37:02,772 INFO L87 Difference]: Start difference. First operand 228 states and 302 transitions. Second operand 7 states. [2018-12-31 05:37:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:02,978 INFO L93 Difference]: Finished difference Result 368 states and 480 transitions. [2018-12-31 05:37:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:37:02,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-31 05:37:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:02,989 INFO L225 Difference]: With dead ends: 368 [2018-12-31 05:37:02,989 INFO L226 Difference]: Without dead ends: 266 [2018-12-31 05:37:02,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:37:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-31 05:37:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 232. [2018-12-31 05:37:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-31 05:37:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 302 transitions. [2018-12-31 05:37:03,028 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 302 transitions. Word has length 31 [2018-12-31 05:37:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:03,029 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 302 transitions. [2018-12-31 05:37:03,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 05:37:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 302 transitions. [2018-12-31 05:37:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 05:37:03,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:03,030 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:03,030 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash 651964356, now seen corresponding path program 3 times [2018-12-31 05:37:03,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:03,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:03,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 05:37:03,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:03,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:03,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:37:03,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 05:37:03,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:03,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:03,331 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 15 treesize of output 12 [2018-12-31 05:37:03,333 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 12 treesize of output 11 [2018-12-31 05:37:03,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-31 05:37:03,400 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 28 treesize of output 23 [2018-12-31 05:37:03,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:03,406 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 23 treesize of output 37 [2018-12-31 05:37:03,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2018-12-31 05:37:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 05:37:03,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16] total 19 [2018-12-31 05:37:03,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 05:37:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 05:37:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-12-31 05:37:03,689 INFO L87 Difference]: Start difference. First operand 232 states and 302 transitions. Second operand 19 states. [2018-12-31 05:37:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:05,384 INFO L93 Difference]: Finished difference Result 518 states and 655 transitions. [2018-12-31 05:37:05,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 05:37:05,388 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-12-31 05:37:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:05,391 INFO L225 Difference]: With dead ends: 518 [2018-12-31 05:37:05,392 INFO L226 Difference]: Without dead ends: 420 [2018-12-31 05:37:05,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 05:37:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-12-31 05:37:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 122. [2018-12-31 05:37:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-31 05:37:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2018-12-31 05:37:05,421 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 31 [2018-12-31 05:37:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:05,421 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2018-12-31 05:37:05,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 05:37:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2018-12-31 05:37:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 05:37:05,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:05,422 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:05,425 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 2 times [2018-12-31 05:37:05,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:05,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:05,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:05,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 05:37:06,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:06,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:06,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:37:06,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:37:06,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:06,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 05:37:06,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:06,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-31 05:37:06,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 05:37:06,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 05:37:06,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:37:06,623 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand 13 states. [2018-12-31 05:37:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:07,542 INFO L93 Difference]: Finished difference Result 404 states and 504 transitions. [2018-12-31 05:37:07,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 05:37:07,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-31 05:37:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:07,545 INFO L225 Difference]: With dead ends: 404 [2018-12-31 05:37:07,545 INFO L226 Difference]: Without dead ends: 298 [2018-12-31 05:37:07,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-12-31 05:37:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-31 05:37:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 205. [2018-12-31 05:37:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-31 05:37:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2018-12-31 05:37:07,587 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 33 [2018-12-31 05:37:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:07,587 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2018-12-31 05:37:07,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 05:37:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2018-12-31 05:37:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:37:07,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:07,589 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:07,589 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2018-12-31 05:37:07,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:07,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:37:07,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:07,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:07,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:37:07,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:37:07,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:07,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:37:07,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:07,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-31 05:37:07,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 05:37:07,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 05:37:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:37:07,851 INFO L87 Difference]: Start difference. First operand 205 states and 262 transitions. Second operand 13 states. [2018-12-31 05:37:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:09,049 INFO L93 Difference]: Finished difference Result 485 states and 608 transitions. [2018-12-31 05:37:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 05:37:09,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-12-31 05:37:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:09,051 INFO L225 Difference]: With dead ends: 485 [2018-12-31 05:37:09,052 INFO L226 Difference]: Without dead ends: 463 [2018-12-31 05:37:09,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2018-12-31 05:37:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-31 05:37:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 290. [2018-12-31 05:37:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-12-31 05:37:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 380 transitions. [2018-12-31 05:37:09,121 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 380 transitions. Word has length 34 [2018-12-31 05:37:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:09,123 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 380 transitions. [2018-12-31 05:37:09,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 05:37:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 380 transitions. [2018-12-31 05:37:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:37:09,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:09,126 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:09,126 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2018-12-31 05:37:09,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:09,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:09,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:09,583 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-12-31 05:37:09,703 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2018-12-31 05:37:10,040 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-12-31 05:37:10,384 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2018-12-31 05:37:10,570 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 46 [2018-12-31 05:37:10,872 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 51 [2018-12-31 05:37:11,031 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 35 [2018-12-31 05:37:11,752 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2018-12-31 05:37:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:12,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:12,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:12,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:37:12,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:37:12,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:12,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:12,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-12-31 05:37:12,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:12,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 05:37:12,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,318 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:24 [2018-12-31 05:37:12,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,359 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:12,363 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 26 treesize of output 20 [2018-12-31 05:37:12,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-12-31 05:37:12,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2018-12-31 05:37:12,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,489 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-31 05:37:12,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:37:12,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-12-31 05:37:12,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2018-12-31 05:37:12,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,724 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 78 [2018-12-31 05:37:12,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:37:12,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:12,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-31 05:37:12,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,903 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:12,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 84 [2018-12-31 05:37:12,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:12,936 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 66 [2018-12-31 05:37:12,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:12,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:12,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:12,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:45 [2018-12-31 05:37:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:37:13,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:13,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-12-31 05:37:13,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-31 05:37:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-31 05:37:13,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2018-12-31 05:37:13,129 INFO L87 Difference]: Start difference. First operand 290 states and 380 transitions. Second operand 29 states. [2018-12-31 05:37:13,988 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2018-12-31 05:37:14,168 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2018-12-31 05:37:14,363 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2018-12-31 05:37:15,280 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 53 [2018-12-31 05:37:15,473 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2018-12-31 05:37:15,635 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-12-31 05:37:16,584 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2018-12-31 05:37:16,735 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2018-12-31 05:37:17,235 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2018-12-31 05:37:17,841 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2018-12-31 05:37:18,002 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2018-12-31 05:37:20,194 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2018-12-31 05:37:20,593 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2018-12-31 05:37:20,737 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2018-12-31 05:37:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:21,983 INFO L93 Difference]: Finished difference Result 652 states and 835 transitions. [2018-12-31 05:37:21,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-31 05:37:21,985 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-12-31 05:37:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:21,990 INFO L225 Difference]: With dead ends: 652 [2018-12-31 05:37:21,990 INFO L226 Difference]: Without dead ends: 650 [2018-12-31 05:37:21,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2239 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1349, Invalid=6661, Unknown=0, NotChecked=0, Total=8010 [2018-12-31 05:37:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-12-31 05:37:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 470. [2018-12-31 05:37:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-12-31 05:37:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 631 transitions. [2018-12-31 05:37:22,099 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 631 transitions. Word has length 34 [2018-12-31 05:37:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:22,099 INFO L480 AbstractCegarLoop]: Abstraction has 470 states and 631 transitions. [2018-12-31 05:37:22,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-31 05:37:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 631 transitions. [2018-12-31 05:37:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 05:37:22,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:22,103 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:22,103 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1136182421, now seen corresponding path program 5 times [2018-12-31 05:37:22,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:22,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:22,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:22,558 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2018-12-31 05:37:22,904 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 38 [2018-12-31 05:37:23,091 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 42 [2018-12-31 05:37:23,222 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 37 [2018-12-31 05:37:23,365 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 40 [2018-12-31 05:37:23,538 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 47 [2018-12-31 05:37:23,716 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 39 [2018-12-31 05:37:23,913 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2018-12-31 05:37:24,339 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2018-12-31 05:37:24,476 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2018-12-31 05:37:24,627 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2018-12-31 05:37:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:24,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:24,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:24,785 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 05:37:24,909 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-12-31 05:37:24,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:24,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:25,074 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-31 05:37:25,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-12-31 05:37:25,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:25,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 05:37:25,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,138 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:39 [2018-12-31 05:37:25,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2018-12-31 05:37:25,189 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 18 treesize of output 16 [2018-12-31 05:37:25,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2018-12-31 05:37:25,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 77 [2018-12-31 05:37:25,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,388 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-12-31 05:37:25,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:37:25,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:25,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:25,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-12-31 05:37:25,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 95 [2018-12-31 05:37:25,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:25,754 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 97 [2018-12-31 05:37:25,757 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-31 05:37:25,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-31 05:37:26,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-12-31 05:37:26,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:382 [2018-12-31 05:37:26,760 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 48 [2018-12-31 05:37:27,018 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-31 05:37:27,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 113 [2018-12-31 05:37:27,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,218 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 128 [2018-12-31 05:37:27,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-31 05:37:27,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-31 05:37:27,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-12-31 05:37:27,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:468 [2018-12-31 05:37:36,631 WARN L181 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 158 DAG size of output: 60 [2018-12-31 05:37:39,351 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-31 05:37:41,561 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-31 05:37:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:44,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-12-31 05:37:44,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-31 05:37:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-31 05:37:44,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1174, Unknown=3, NotChecked=0, Total=1332 [2018-12-31 05:37:44,552 INFO L87 Difference]: Start difference. First operand 470 states and 631 transitions. Second operand 37 states. [2018-12-31 05:37:46,208 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2018-12-31 05:37:47,055 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2018-12-31 05:37:50,926 WARN L181 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 56 [2018-12-31 05:37:54,529 WARN L181 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2018-12-31 05:37:55,119 WARN L181 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2018-12-31 05:37:55,928 WARN L181 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2018-12-31 05:37:57,121 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2018-12-31 05:37:57,296 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-12-31 05:37:57,831 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 47 [2018-12-31 05:37:59,960 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-12-31 05:38:00,295 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2018-12-31 05:38:01,994 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2018-12-31 05:38:05,780 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-31 05:38:06,166 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 51 [2018-12-31 05:38:12,806 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2018-12-31 05:38:13,420 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2018-12-31 05:38:13,727 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 61 [2018-12-31 05:38:15,434 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 58 [2018-12-31 05:38:15,999 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 51 [2018-12-31 05:38:18,031 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 53 [2018-12-31 05:38:18,309 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2018-12-31 05:38:19,001 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 49 [2018-12-31 05:38:22,762 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2018-12-31 05:38:23,458 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 52 [2018-12-31 05:38:24,601 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 43 [2018-12-31 05:38:27,036 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-12-31 05:38:27,279 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-12-31 05:38:27,930 WARN L181 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2018-12-31 05:38:28,860 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2018-12-31 05:38:31,752 WARN L181 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2018-12-31 05:38:34,101 WARN L181 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 53 [2018-12-31 05:38:37,735 WARN L181 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2018-12-31 05:38:39,901 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 102 DAG size of output: 47 [2018-12-31 05:38:43,098 WARN L181 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 50 [2018-12-31 05:38:44,238 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2018-12-31 05:38:44,548 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2018-12-31 05:38:46,748 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 59 [2018-12-31 05:38:47,883 WARN L181 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2018-12-31 05:38:48,559 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2018-12-31 05:38:51,328 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 55 [2018-12-31 05:38:53,675 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2018-12-31 05:38:55,326 WARN L181 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-12-31 05:38:58,013 WARN L181 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 111 DAG size of output: 47 [2018-12-31 05:38:58,670 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-12-31 05:38:59,759 WARN L181 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 45 [2018-12-31 05:38:59,953 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-31 05:39:02,465 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2018-12-31 05:39:03,371 WARN L181 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 49 [2018-12-31 05:39:05,224 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2018-12-31 05:39:06,058 WARN L181 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 51 [2018-12-31 05:39:06,291 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2018-12-31 05:39:07,112 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2018-12-31 05:39:08,430 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 49 [2018-12-31 05:39:08,749 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 55 [2018-12-31 05:39:08,929 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2018-12-31 05:39:09,525 WARN L181 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 58 [2018-12-31 05:39:10,254 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 53 [2018-12-31 05:39:10,789 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2018-12-31 05:39:11,255 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 53 [2018-12-31 05:39:11,445 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 60 [2018-12-31 05:39:11,939 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2018-12-31 05:39:12,465 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2018-12-31 05:39:13,039 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2018-12-31 05:39:13,284 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2018-12-31 05:39:18,151 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2018-12-31 05:39:18,312 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2018-12-31 05:39:19,189 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2018-12-31 05:39:22,650 WARN L181 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2018-12-31 05:39:23,233 WARN L181 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 50 [2018-12-31 05:39:24,150 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 56 [2018-12-31 05:39:24,780 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 52 [2018-12-31 05:39:27,109 WARN L181 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2018-12-31 05:39:27,903 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2018-12-31 05:39:28,245 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2018-12-31 05:39:28,844 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 61 [2018-12-31 05:39:29,204 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 56 [2018-12-31 05:39:29,890 WARN L181 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 62 [2018-12-31 05:39:30,555 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 46 [2018-12-31 05:39:30,910 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 52 [2018-12-31 05:39:31,437 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 55 [2018-12-31 05:39:31,634 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 54 [2018-12-31 05:39:33,712 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2018-12-31 05:39:33,918 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2018-12-31 05:39:34,120 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 57 [2018-12-31 05:39:34,745 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 51 [2018-12-31 05:39:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:39:34,751 INFO L93 Difference]: Finished difference Result 2164 states and 2683 transitions. [2018-12-31 05:39:34,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-12-31 05:39:34,751 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-31 05:39:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:39:34,759 INFO L225 Difference]: With dead ends: 2164 [2018-12-31 05:39:34,759 INFO L226 Difference]: Without dead ends: 2136 [2018-12-31 05:39:34,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19545 ImplicationChecksByTransitivity, 104.1s TimeCoverageRelationStatistics Valid=4649, Invalid=46187, Unknown=14, NotChecked=0, Total=50850 [2018-12-31 05:39:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2018-12-31 05:39:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 394. [2018-12-31 05:39:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-31 05:39:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 531 transitions. [2018-12-31 05:39:34,927 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 531 transitions. Word has length 37 [2018-12-31 05:39:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:39:34,928 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 531 transitions. [2018-12-31 05:39:34,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-31 05:39:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 531 transitions. [2018-12-31 05:39:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:39:34,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:39:34,929 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:39:34,930 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:39:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:39:34,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1630806470, now seen corresponding path program 1 times [2018-12-31 05:39:34,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:39:34,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:39:34,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:34,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:39:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:39:35,543 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2018-12-31 05:39:35,727 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2018-12-31 05:39:35,906 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 36 [2018-12-31 05:39:36,167 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 46 [2018-12-31 05:39:36,597 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 51 [2018-12-31 05:39:36,895 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 52 [2018-12-31 05:39:37,070 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 46 [2018-12-31 05:39:37,595 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 47 [2018-12-31 05:39:37,802 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 35 [2018-12-31 05:39:37,943 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2018-12-31 05:39:38,128 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 35 [2018-12-31 05:39:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:38,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:39:38,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:39:38,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:39:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:39:38,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:39:38,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-12-31 05:39:38,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:39:38,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 05:39:38,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:39:38,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:38,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:38,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:38,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:62, output treesize:52 [2018-12-31 05:39:38,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 71 [2018-12-31 05:39:38,590 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 26 treesize of output 20 [2018-12-31 05:39:38,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:39:38,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:38,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:38,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:59 [2018-12-31 05:39:38,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 78 [2018-12-31 05:39:38,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:38,956 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-31 05:39:38,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:39:39,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:39,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:39,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:49 [2018-12-31 05:39:39,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:39,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:39,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:39,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:39,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:39,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 90 [2018-12-31 05:39:39,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:39,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:39:39,314 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 78 [2018-12-31 05:39:39,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:39:39,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:39,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:39,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2018-12-31 05:39:39,582 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-31 05:39:39,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:39:39,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:39:39,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:1 [2018-12-31 05:39:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 05:39:39,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:39:39,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-12-31 05:39:39,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-31 05:39:39,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-31 05:39:39,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-12-31 05:39:39,616 INFO L87 Difference]: Start difference. First operand 394 states and 531 transitions. Second operand 26 states. [2018-12-31 05:39:40,782 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2018-12-31 05:39:42,636 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2018-12-31 05:39:42,868 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-31 05:39:43,386 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2018-12-31 05:39:43,533 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2018-12-31 05:39:43,778 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 67 [2018-12-31 05:39:43,968 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2018-12-31 05:39:44,169 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-12-31 05:39:44,311 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2018-12-31 05:39:44,794 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2018-12-31 05:39:45,127 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-31 05:39:46,726 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-12-31 05:39:47,862 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-12-31 05:39:48,305 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2018-12-31 05:39:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:39:48,651 INFO L93 Difference]: Finished difference Result 1051 states and 1365 transitions. [2018-12-31 05:39:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-31 05:39:48,652 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-12-31 05:39:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:39:48,655 INFO L225 Difference]: With dead ends: 1051 [2018-12-31 05:39:48,655 INFO L226 Difference]: Without dead ends: 926 [2018-12-31 05:39:48,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=793, Invalid=6347, Unknown=0, NotChecked=0, Total=7140 [2018-12-31 05:39:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-12-31 05:39:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 487. [2018-12-31 05:39:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-12-31 05:39:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 668 transitions. [2018-12-31 05:39:48,844 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 668 transitions. Word has length 38 [2018-12-31 05:39:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:39:48,845 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 668 transitions. [2018-12-31 05:39:48,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-31 05:39:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 668 transitions. [2018-12-31 05:39:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:39:48,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:39:48,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:39:48,850 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:39:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:39:48,850 INFO L82 PathProgramCache]: Analyzing trace with hash 670016120, now seen corresponding path program 1 times [2018-12-31 05:39:48,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:39:48,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:39:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:48,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:39:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:39:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:39:48,976 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:39:49,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:39:49 BoogieIcfgContainer [2018-12-31 05:39:49,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:39:49,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:39:49,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:39:49,050 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:39:49,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:36:37" (3/4) ... [2018-12-31 05:39:49,053 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 05:39:49,153 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:39:49,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:39:49,160 INFO L168 Benchmark]: Toolchain (without parser) took 192762.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 952.7 MB in the beginning and 983.6 MB in the end (delta: -30.8 MB). Peak memory consumption was 309.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:39:49,160 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-12-31 05:39:49,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:39:49,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.10 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:39:49,162 INFO L168 Benchmark]: Boogie Preprocessor took 117.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-31 05:39:49,163 INFO L168 Benchmark]: RCFGBuilder took 739.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:39:49,165 INFO L168 Benchmark]: TraceAbstraction took 191357.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 983.6 MB in the end (delta: 97.0 MB). Peak memory consumption was 312.0 MB. Max. memory is 11.5 GB. [2018-12-31 05:39:49,166 INFO L168 Benchmark]: Witness Printer took 107.81 ms. Allocated memory is still 1.4 GB. Free memory is still 983.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:39:49,169 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.17 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 365.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.10 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 739.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 191357.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 983.6 MB in the end (delta: 97.0 MB). Peak memory consumption was 312.0 MB. Max. memory is 11.5 GB. * Witness Printer took 107.81 ms. Allocated memory is still 1.4 GB. Free memory is still 983.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] int INFINITY = 899; VAL [INFINITY=899] [L13] int nodecount = __VERIFIER_nondet_int(); [L14] int edgecount = __VERIFIER_nondet_int(); [L15] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [INFINITY=899] [L16] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L17] int source = 0; [L18] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L19] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L20] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L21] int distance[5]; [L22] int x,y; [L23] int i,j; [L25] i = 0 VAL [INFINITY=899] [L25] COND TRUE i < nodecount VAL [INFINITY=899] [L26] COND TRUE i == source [L27] distance[i] = 0 VAL [INFINITY=899] [L25] i++ VAL [INFINITY=899] [L25] COND TRUE i < nodecount VAL [INFINITY=899] [L26] COND FALSE !(i == source) [L30] distance[i] = INFINITY VAL [INFINITY=899] [L25] i++ VAL [INFINITY=899] [L25] COND FALSE !(i < nodecount) VAL [INFINITY=899] [L34] i = 0 VAL [INFINITY=899] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [INFINITY=899] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [INFINITY=899] [L40] COND TRUE distance[x] > distance[y] + Weight[j] [L42] distance[x] = -1 VAL [INFINITY=899] [L36] j++ VAL [INFINITY=899] [L36] COND FALSE !(j < edgecount) VAL [INFINITY=899] [L34] i++ VAL [INFINITY=899] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [INFINITY=899] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [INFINITY=899] [L40] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L36] j++ VAL [INFINITY=899] [L36] COND FALSE !(j < edgecount) VAL [INFINITY=899] [L34] i++ VAL [INFINITY=899] [L34] COND FALSE !(i < nodecount) VAL [INFINITY=899] [L46] i = 0 VAL [INFINITY=899] [L46] COND TRUE i < edgecount [L48] EXPR Dest[i] [L48] x = Dest[i] [L49] EXPR Source[i] [L49] y = Source[i] [L50] EXPR distance[x] [L50] EXPR distance[y] [L50] EXPR Weight[i] VAL [INFINITY=899] [L50] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L46] i++ VAL [INFINITY=899] [L46] COND FALSE !(i < edgecount) VAL [INFINITY=899] [L56] i = 0 VAL [INFINITY=899] [L56] COND TRUE i < nodecount [L58] distance[i] [L6] COND FALSE !(!(cond)) VAL [INFINITY=899] [L56] i++ VAL [INFINITY=899] [L56] COND TRUE i < nodecount [L58] distance[i] [L6] COND TRUE !(cond) VAL [INFINITY=899] [L7] __VERIFIER_error() VAL [INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. UNSAFE Result, 191.2s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 142.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 698 SDtfs, 5376 SDslu, 4661 SDs, 0 SdLazy, 7732 SolverSat, 2712 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 35.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 376 SyntacticMatches, 25 SemanticMatches, 651 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25566 ImplicationChecksByTransitivity, 142.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=18, 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.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 3488 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 44.9s InterpolantComputationTime, 994 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 922 ConstructedInterpolants, 78 QuantifiedInterpolants, 513305 SizeOfPredicates, 153 NumberOfNonLiveVariables, 3631 ConjunctsInSsa, 336 ConjunctsInUnsatCore, 34 InterpolantComputations, 2 PerfectInterpolantSequences, 155/406 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...