./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product39_false-unreach-call_false-termination.cil.c --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/product-lines/minepump_spec1_product39_false-unreach-call_false-termination.cil.c -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 f2f38c4f83f0a2ec969b4b77f5129e3dfefde6fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:41:16,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:16,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:16,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:16,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:16,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:16,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:16,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:16,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:16,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:16,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:16,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:16,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:16,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:16,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:16,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:16,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:16,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:16,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:16,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:16,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:16,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:16,790 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:16,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:16,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:16,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:16,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:16,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:16,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:16,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:16,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:16,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:16,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:16,804 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:16,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:16,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:16,805 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:41:16,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:16,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:16,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:16,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:16,838 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:16,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:16,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:16,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:16,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:16,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:16,840 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:16,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:16,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:16,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:16,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:16,840 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:16,841 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:16,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:16,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:16,841 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:16,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:16,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:16,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:16,843 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:16,843 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:16,844 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:16,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:16,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:16,844 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 -> f2f38c4f83f0a2ec969b4b77f5129e3dfefde6fe [2018-12-31 09:41:16,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:16,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:16,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:16,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:16,929 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:16,930 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product39_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:16,985 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0db94b568/f4e20971ce61498b9f51652b40500040/FLAG56c851927 [2018-12-31 09:41:17,597 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:17,598 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product39_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:17,610 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0db94b568/f4e20971ce61498b9f51652b40500040/FLAG56c851927 [2018-12-31 09:41:17,837 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0db94b568/f4e20971ce61498b9f51652b40500040 [2018-12-31 09:41:17,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:17,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:17,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:17,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:17,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:17,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:17" (1/1) ... [2018-12-31 09:41:17,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52869081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:17, skipping insertion in model container [2018-12-31 09:41:17,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:17" (1/1) ... [2018-12-31 09:41:17,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:17,920 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:18,319 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:18,352 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:18,542 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:18,593 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:18,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18 WrapperNode [2018-12-31 09:41:18,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:18,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:18,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:18,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:18,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:18,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:18,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:18,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:18,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (1/1) ... [2018-12-31 09:41:18,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:18,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:18,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:18,785 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:18,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (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 09:41:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:20,380 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:20,381 INFO L280 CfgBuilder]: Removed 160 assue(true) statements. [2018-12-31 09:41:20,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:20 BoogieIcfgContainer [2018-12-31 09:41:20,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:20,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:20,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:20,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:20,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:17" (1/3) ... [2018-12-31 09:41:20,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6321ecdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:20, skipping insertion in model container [2018-12-31 09:41:20,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:18" (2/3) ... [2018-12-31 09:41:20,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6321ecdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:20, skipping insertion in model container [2018-12-31 09:41:20,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:20" (3/3) ... [2018-12-31 09:41:20,391 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product39_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:20,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:20,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:20,428 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:20,459 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:20,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:20,460 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:20,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:20,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:20,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:20,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:20,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:20,461 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-12-31 09:41:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:20,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:20,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:20,491 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1221872895, now seen corresponding path program 1 times [2018-12-31 09:41:20,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:20,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:20,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:20,730 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 09:41:20,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:20,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:20,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:20,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:20,756 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2018-12-31 09:41:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:20,790 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2018-12-31 09:41:20,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:20,792 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:20,806 INFO L225 Difference]: With dead ends: 220 [2018-12-31 09:41:20,807 INFO L226 Difference]: Without dead ends: 109 [2018-12-31 09:41:20,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-31 09:41:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-31 09:41:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-31 09:41:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2018-12-31 09:41:20,864 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2018-12-31 09:41:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:20,864 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2018-12-31 09:41:20,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2018-12-31 09:41:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:20,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:20,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:20,866 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 175115998, now seen corresponding path program 1 times [2018-12-31 09:41:20,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:20,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:20,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:20,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:20,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:21,106 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 09:41:21,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:21,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:21,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:21,111 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2018-12-31 09:41:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:21,149 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2018-12-31 09:41:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:21,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:21,153 INFO L225 Difference]: With dead ends: 109 [2018-12-31 09:41:21,153 INFO L226 Difference]: Without dead ends: 47 [2018-12-31 09:41:21,154 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 09:41:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-31 09:41:21,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-31 09:41:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 09:41:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2018-12-31 09:41:21,164 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2018-12-31 09:41:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:21,164 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2018-12-31 09:41:21,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2018-12-31 09:41:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:21,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:21,166 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 09:41:21,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:21,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1744081540, now seen corresponding path program 1 times [2018-12-31 09:41:21,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:21,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:21,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:21,369 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 09:41:21,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:21,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:21,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:41:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:41:21,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:41:21,371 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 6 states. [2018-12-31 09:41:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:21,558 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2018-12-31 09:41:21,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:21,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 09:41:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:21,561 INFO L225 Difference]: With dead ends: 152 [2018-12-31 09:41:21,561 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 09:41:21,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:41:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 09:41:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2018-12-31 09:41:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 09:41:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2018-12-31 09:41:21,576 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2018-12-31 09:41:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:21,576 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2018-12-31 09:41:21,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:41:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2018-12-31 09:41:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:41:21,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:21,578 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] [2018-12-31 09:41:21,578 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:21,579 INFO L82 PathProgramCache]: Analyzing trace with hash -595366227, now seen corresponding path program 1 times [2018-12-31 09:41:21,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:21,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:21,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:21,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:21,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:21,681 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 09:41:21,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:21,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:21,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:21,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:21,683 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2018-12-31 09:41:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:21,787 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2018-12-31 09:41:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:21,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:41:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:21,791 INFO L225 Difference]: With dead ends: 147 [2018-12-31 09:41:21,791 INFO L226 Difference]: Without dead ends: 87 [2018-12-31 09:41:21,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-31 09:41:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-12-31 09:41:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-31 09:41:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2018-12-31 09:41:21,813 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2018-12-31 09:41:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:21,813 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2018-12-31 09:41:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2018-12-31 09:41:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:21,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:21,815 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 09:41:21,815 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash 566175321, now seen corresponding path program 1 times [2018-12-31 09:41:21,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:21,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:21,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:21,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:22,086 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 09:41:22,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:22,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:22,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:22,087 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2018-12-31 09:41:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:22,508 INFO L93 Difference]: Finished difference Result 413 states and 601 transitions. [2018-12-31 09:41:22,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:22,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:41:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:22,513 INFO L225 Difference]: With dead ends: 413 [2018-12-31 09:41:22,513 INFO L226 Difference]: Without dead ends: 334 [2018-12-31 09:41:22,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-31 09:41:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 156. [2018-12-31 09:41:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-31 09:41:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2018-12-31 09:41:22,550 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 25 [2018-12-31 09:41:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:22,550 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2018-12-31 09:41:22,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2018-12-31 09:41:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:41:22,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:22,555 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, 1] [2018-12-31 09:41:22,555 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:22,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash 362368227, now seen corresponding path program 1 times [2018-12-31 09:41:22,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:22,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:22,847 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 09:41:22,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:22,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:22,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:22,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:22,850 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand 5 states. [2018-12-31 09:41:23,316 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 09:41:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:23,785 INFO L93 Difference]: Finished difference Result 436 states and 619 transitions. [2018-12-31 09:41:23,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:23,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:41:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:23,790 INFO L225 Difference]: With dead ends: 436 [2018-12-31 09:41:23,791 INFO L226 Difference]: Without dead ends: 434 [2018-12-31 09:41:23,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-12-31 09:41:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 156. [2018-12-31 09:41:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-31 09:41:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2018-12-31 09:41:23,825 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 26 [2018-12-31 09:41:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:23,826 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2018-12-31 09:41:23,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2018-12-31 09:41:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:23,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:23,828 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, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:23,830 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash 922855028, now seen corresponding path program 1 times [2018-12-31 09:41:23,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:23,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:23,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:23,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:23,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:23,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:23,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:23,985 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand 5 states. [2018-12-31 09:41:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:24,308 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2018-12-31 09:41:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:24,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:24,317 INFO L225 Difference]: With dead ends: 468 [2018-12-31 09:41:24,320 INFO L226 Difference]: Without dead ends: 318 [2018-12-31 09:41:24,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:41:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-31 09:41:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 168. [2018-12-31 09:41:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-31 09:41:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2018-12-31 09:41:24,367 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 31 [2018-12-31 09:41:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:24,368 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2018-12-31 09:41:24,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2018-12-31 09:41:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:24,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:24,376 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, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:24,377 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:24,377 INFO L82 PathProgramCache]: Analyzing trace with hash 529828018, now seen corresponding path program 1 times [2018-12-31 09:41:24,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:24,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:24,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:24,539 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 09:41:24,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:24,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:24,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:41:24,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:41:24,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:41:24,540 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand 4 states. [2018-12-31 09:41:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:24,901 INFO L93 Difference]: Finished difference Result 426 states and 580 transitions. [2018-12-31 09:41:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:41:24,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-31 09:41:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:24,906 INFO L225 Difference]: With dead ends: 426 [2018-12-31 09:41:24,906 INFO L226 Difference]: Without dead ends: 264 [2018-12-31 09:41:24,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-31 09:41:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 176. [2018-12-31 09:41:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-31 09:41:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2018-12-31 09:41:24,949 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 31 [2018-12-31 09:41:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:24,949 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2018-12-31 09:41:24,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:41:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2018-12-31 09:41:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:24,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:24,952 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, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:24,953 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash 787993456, now seen corresponding path program 1 times [2018-12-31 09:41:24,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:24,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:24,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:24,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:24,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:25,060 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 09:41:25,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:25,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:25,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:25,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:25,062 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand 3 states. [2018-12-31 09:41:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:25,231 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2018-12-31 09:41:25,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:25,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-31 09:41:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:25,237 INFO L225 Difference]: With dead ends: 434 [2018-12-31 09:41:25,237 INFO L226 Difference]: Without dead ends: 264 [2018-12-31 09:41:25,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-31 09:41:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-12-31 09:41:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-31 09:41:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 348 transitions. [2018-12-31 09:41:25,285 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 348 transitions. Word has length 31 [2018-12-31 09:41:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:25,286 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 348 transitions. [2018-12-31 09:41:25,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2018-12-31 09:41:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:25,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:25,288 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:25,289 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1324766414, now seen corresponding path program 1 times [2018-12-31 09:41:25,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:25,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:25,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:25,946 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:41:26,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:41:26 BoogieIcfgContainer [2018-12-31 09:41:26,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:41:26,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:41:26,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:41:26,108 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:41:26,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:20" (3/4) ... [2018-12-31 09:41:26,112 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:41:26,262 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:41:26,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:41:26,263 INFO L168 Benchmark]: Toolchain (without parser) took 8421.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -85.5 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:26,266 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:26,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:26,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:26,268 INFO L168 Benchmark]: Boogie Preprocessor took 67.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:26,268 INFO L168 Benchmark]: RCFGBuilder took 1599.24 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:26,268 INFO L168 Benchmark]: TraceAbstraction took 5723.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -270.2 kB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:26,271 INFO L168 Benchmark]: Witness Printer took 154.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:26,279 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 752.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1599.24 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5723.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -270.2 kB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. * Witness Printer took 154.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 439]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L450] int waterLevel = 1; [L451] int methaneLevelCritical = 0; [L617] int pumpRunning = 0; [L618] int systemActive = 1; [L848] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L921] int retValue_acc ; [L922] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L839] int retValue_acc ; [L842] retValue_acc = 1 [L843] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L928] tmp = valid_product() [L930] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L548] int splverifierCounter ; [L549] int tmp ; [L550] int tmp___0 ; [L551] int tmp___1 ; [L552] int tmp___2 ; [L555] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L557] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L559] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L565] tmp = __VERIFIER_nondet_int() [L567] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L468] COND TRUE waterLevel < 2 [L469] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L575] tmp___0 = __VERIFIER_nondet_int() [L577] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L480] COND FALSE !(\read(methaneLevelCritical)) [L483] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L585] tmp___2 = __VERIFIER_nondet_int() [L587] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L624] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L631] COND TRUE \read(systemActive) [L679] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L682] COND FALSE !(\read(pumpRunning)) [L653] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L656] COND TRUE ! pumpRunning [L776] int retValue_acc ; [L777] int tmp ; [L778] int tmp___0 ; [L530] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L533] COND FALSE !(waterLevel < 2) [L537] retValue_acc = 0 [L538] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L782] tmp = isHighWaterSensorDry() [L784] COND FALSE !(\read(tmp)) [L787] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L789] retValue_acc = tmp___0 [L790] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L658] tmp = isHighWaterLevel() [L660] COND TRUE \read(tmp) [L707] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] int tmp ; [L411] int tmp___0 ; [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L415] tmp = isMethaneLevelCritical() [L417] COND TRUE \read(tmp) [L731] int retValue_acc ; [L734] retValue_acc = pumpRunning [L735] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L419] tmp___0 = isPumpRunning() [L421] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L439] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 3 error locations. UNSAFE Result, 5.6s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 831 SDtfs, 1084 SDslu, 1323 SDs, 0 SdLazy, 169 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=9, 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 741 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...