./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec1_product33.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 3e754f75ca06d39e1069a0bad88498ddd2436bb7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-19 21:22:02,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:22:02,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:22:02,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:22:02,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:22:02,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:22:02,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:22:02,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:22:02,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:22:02,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:22:02,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:22:02,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:22:02,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:22:02,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:22:02,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:22:02,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:22:02,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:22:02,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:22:02,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:22:02,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:22:02,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:22:02,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:22:02,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:22:02,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:22:02,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:22:02,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:22:02,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:22:02,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:22:02,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:22:02,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:22:02,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:22:02,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:22:02,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:22:02,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:22:02,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:22:02,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:22:02,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:22:02,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:22:02,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:22:02,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:22:02,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:22:02,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:22:02,880 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:22:02,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:22:02,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:22:02,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:22:02,883 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:22:02,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:22:02,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:22:02,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:22:02,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:22:02,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:22:02,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:22:02,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:22:02,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:22:02,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:22:02,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:22:02,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:22:02,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:22:02,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:22:02,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:22:02,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:22:02,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:22:02,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:22:02,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:22:02,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:22:02,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:22:02,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:22:02,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:22:02,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:22:02,890 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 3e754f75ca06d39e1069a0bad88498ddd2436bb7 [2019-11-19 21:22:03,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:22:03,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:22:03,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:22:03,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:22:03,255 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:22:03,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2019-11-19 21:22:03,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855e4975/3925c898864a4fc98568a287effa269e/FLAGcccdfd8b6 [2019-11-19 21:22:03,845 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:22:03,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2019-11-19 21:22:03,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855e4975/3925c898864a4fc98568a287effa269e/FLAGcccdfd8b6 [2019-11-19 21:22:04,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855e4975/3925c898864a4fc98568a287effa269e [2019-11-19 21:22:04,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:22:04,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:22:04,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:04,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:22:04,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:22:04,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebf35e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04, skipping insertion in model container [2019-11-19 21:22:04,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,162 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:22:04,223 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:22:04,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:04,615 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:22:04,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:04,745 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:22:04,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04 WrapperNode [2019-11-19 21:22:04,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:04,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:04,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:22:04,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:22:04,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:04,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:22:04,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:22:04,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:22:04,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... [2019-11-19 21:22:04,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:22:04,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:22:04,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:22:04,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:22:04,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:22:04,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:22:04,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:22:04,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:22:04,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:22:05,683 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:22:05,683 INFO L285 CfgBuilder]: Removed 96 assume(true) statements. [2019-11-19 21:22:05,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:05 BoogieIcfgContainer [2019-11-19 21:22:05,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:22:05,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:22:05,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:22:05,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:22:05,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:22:04" (1/3) ... [2019-11-19 21:22:05,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2013dfaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:05, skipping insertion in model container [2019-11-19 21:22:05,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:04" (2/3) ... [2019-11-19 21:22:05,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2013dfaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:05, skipping insertion in model container [2019-11-19 21:22:05,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:05" (3/3) ... [2019-11-19 21:22:05,696 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product33.cil.c [2019-11-19 21:22:05,707 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:22:05,714 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 21:22:05,723 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 21:22:05,745 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:22:05,746 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:22:05,746 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:22:05,746 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:22:05,746 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:22:05,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:22:05,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:22:05,747 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:22:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-19 21:22:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:22:05,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:05,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:05,781 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:05,787 INFO L82 PathProgramCache]: Analyzing trace with hash 768274677, now seen corresponding path program 1 times [2019-11-19 21:22:05,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:05,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708513003] [2019-11-19 21:22:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:06,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708513003] [2019-11-19 21:22:06,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:06,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:06,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809618341] [2019-11-19 21:22:06,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:22:06,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:22:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:22:06,150 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-19 21:22:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:06,196 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-11-19 21:22:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:22:06,198 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 21:22:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:06,214 INFO L225 Difference]: With dead ends: 150 [2019-11-19 21:22:06,215 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 21:22:06,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:22:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 21:22:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 21:22:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 21:22:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-19 21:22:06,285 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-11-19 21:22:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:06,286 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-19 21:22:06,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:22:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-19 21:22:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:22:06,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:06,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:06,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1484097871, now seen corresponding path program 1 times [2019-11-19 21:22:06,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:06,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689401708] [2019-11-19 21:22:06,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:06,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689401708] [2019-11-19 21:22:06,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:06,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:22:06,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774096478] [2019-11-19 21:22:06,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:06,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:06,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:06,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:06,440 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-11-19 21:22:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:06,458 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-11-19 21:22:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:06,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 21:22:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:06,462 INFO L225 Difference]: With dead ends: 74 [2019-11-19 21:22:06,462 INFO L226 Difference]: Without dead ends: 34 [2019-11-19 21:22:06,463 INFO L630 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 [2019-11-19 21:22:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-19 21:22:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-19 21:22:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-19 21:22:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-19 21:22:06,474 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-11-19 21:22:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:06,474 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-19 21:22:06,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-19 21:22:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:22:06,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:06,477 INFO L410 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] [2019-11-19 21:22:06,477 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 670124178, now seen corresponding path program 1 times [2019-11-19 21:22:06,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:06,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530016421] [2019-11-19 21:22:06,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:06,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530016421] [2019-11-19 21:22:06,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:06,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:06,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672605518] [2019-11-19 21:22:06,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:06,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:06,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:06,599 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2019-11-19 21:22:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:06,608 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-11-19 21:22:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:06,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 21:22:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:06,609 INFO L225 Difference]: With dead ends: 62 [2019-11-19 21:22:06,609 INFO L226 Difference]: Without dead ends: 34 [2019-11-19 21:22:06,610 INFO L630 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 [2019-11-19 21:22:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-19 21:22:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-19 21:22:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-19 21:22:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-11-19 21:22:06,615 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-11-19 21:22:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:06,616 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-19 21:22:06,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-11-19 21:22:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 21:22:06,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:06,617 INFO L410 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] [2019-11-19 21:22:06,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1804645939, now seen corresponding path program 1 times [2019-11-19 21:22:06,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:06,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673952927] [2019-11-19 21:22:06,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:06,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673952927] [2019-11-19 21:22:06,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:06,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:06,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227111767] [2019-11-19 21:22:06,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:06,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:06,675 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-11-19 21:22:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:06,721 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-11-19 21:22:06,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:06,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 21:22:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:06,723 INFO L225 Difference]: With dead ends: 83 [2019-11-19 21:22:06,723 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 21:22:06,724 INFO L630 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 [2019-11-19 21:22:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 21:22:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-19 21:22:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 21:22:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-11-19 21:22:06,739 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-11-19 21:22:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:06,740 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-11-19 21:22:06,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-11-19 21:22:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 21:22:06,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:06,743 INFO L410 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] [2019-11-19 21:22:06,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1746371458, now seen corresponding path program 1 times [2019-11-19 21:22:06,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:06,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68377970] [2019-11-19 21:22:06,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:06,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68377970] [2019-11-19 21:22:06,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:06,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:06,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477992090] [2019-11-19 21:22:06,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:06,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:06,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:06,835 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-11-19 21:22:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:06,898 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-11-19 21:22:06,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:06,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-19 21:22:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:06,900 INFO L225 Difference]: With dead ends: 139 [2019-11-19 21:22:06,900 INFO L226 Difference]: Without dead ends: 92 [2019-11-19 21:22:06,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:22:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-19 21:22:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-19 21:22:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 21:22:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-11-19 21:22:06,909 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-11-19 21:22:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:06,910 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-11-19 21:22:06,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-11-19 21:22:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 21:22:06,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:06,911 INFO L410 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] [2019-11-19 21:22:06,911 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash 916139585, now seen corresponding path program 1 times [2019-11-19 21:22:06,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:06,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392660404] [2019-11-19 21:22:06,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:06,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392660404] [2019-11-19 21:22:06,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:06,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:06,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263256692] [2019-11-19 21:22:06,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:06,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:06,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:06,985 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2019-11-19 21:22:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:07,093 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-11-19 21:22:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:22:07,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-19 21:22:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:07,096 INFO L225 Difference]: With dead ends: 270 [2019-11-19 21:22:07,096 INFO L226 Difference]: Without dead ends: 220 [2019-11-19 21:22:07,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:22:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-19 21:22:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2019-11-19 21:22:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-19 21:22:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2019-11-19 21:22:07,114 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2019-11-19 21:22:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:07,114 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2019-11-19 21:22:07,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2019-11-19 21:22:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:07,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:07,116 INFO L410 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] [2019-11-19 21:22:07,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash -863305781, now seen corresponding path program 1 times [2019-11-19 21:22:07,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:07,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269753612] [2019-11-19 21:22:07,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:07,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269753612] [2019-11-19 21:22:07,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:07,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:07,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812861735] [2019-11-19 21:22:07,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:07,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:07,183 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2019-11-19 21:22:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:07,305 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2019-11-19 21:22:07,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:22:07,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:07,308 INFO L225 Difference]: With dead ends: 280 [2019-11-19 21:22:07,309 INFO L226 Difference]: Without dead ends: 278 [2019-11-19 21:22:07,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:22:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-19 21:22:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-11-19 21:22:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-19 21:22:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2019-11-19 21:22:07,336 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2019-11-19 21:22:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:07,337 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2019-11-19 21:22:07,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2019-11-19 21:22:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:07,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:07,345 INFO L410 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] [2019-11-19 21:22:07,345 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 376123462, now seen corresponding path program 1 times [2019-11-19 21:22:07,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:07,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843854593] [2019-11-19 21:22:07,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:07,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843854593] [2019-11-19 21:22:07,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:07,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:07,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780638898] [2019-11-19 21:22:07,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:07,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:07,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:07,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:07,425 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 5 states. [2019-11-19 21:22:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:07,489 INFO L93 Difference]: Finished difference Result 276 states and 374 transitions. [2019-11-19 21:22:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:07,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:07,492 INFO L225 Difference]: With dead ends: 276 [2019-11-19 21:22:07,492 INFO L226 Difference]: Without dead ends: 182 [2019-11-19 21:22:07,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:22:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-19 21:22:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 104. [2019-11-19 21:22:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-19 21:22:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2019-11-19 21:22:07,513 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2019-11-19 21:22:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:07,514 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2019-11-19 21:22:07,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2019-11-19 21:22:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:07,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:07,516 INFO L410 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] [2019-11-19 21:22:07,516 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash 634288900, now seen corresponding path program 1 times [2019-11-19 21:22:07,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:07,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248166135] [2019-11-19 21:22:07,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:07,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248166135] [2019-11-19 21:22:07,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:07,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:07,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076774737] [2019-11-19 21:22:07,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:07,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:07,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:07,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:07,569 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2019-11-19 21:22:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:07,596 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2019-11-19 21:22:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:07,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-19 21:22:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:07,598 INFO L225 Difference]: With dead ends: 250 [2019-11-19 21:22:07,598 INFO L226 Difference]: Without dead ends: 152 [2019-11-19 21:22:07,599 INFO L630 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 [2019-11-19 21:22:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-19 21:22:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-19 21:22:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-19 21:22:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2019-11-19 21:22:07,616 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2019-11-19 21:22:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:07,616 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2019-11-19 21:22:07,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2019-11-19 21:22:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:07,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:07,618 INFO L410 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] [2019-11-19 21:22:07,619 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:07,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1373527294, now seen corresponding path program 1 times [2019-11-19 21:22:07,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:07,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785478038] [2019-11-19 21:22:07,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:07,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:22:07,763 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:22:07,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:22:07 BoogieIcfgContainer [2019-11-19 21:22:07,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:22:07,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:22:07,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:22:07,878 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:22:07,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:05" (3/4) ... [2019-11-19 21:22:07,884 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:22:08,042 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:22:08,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:22:08,045 INFO L168 Benchmark]: Toolchain (without parser) took 3899.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 960.4 MB in the beginning and 844.3 MB in the end (delta: 116.1 MB). Peak memory consumption was 260.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:08,047 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:08,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -161.3 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:08,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.26 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:08,050 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:08,051 INFO L168 Benchmark]: RCFGBuilder took 831.16 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:08,051 INFO L168 Benchmark]: TraceAbstraction took 2190.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.5 MB in the end (delta: 204.5 MB). Peak memory consumption was 204.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:08,052 INFO L168 Benchmark]: Witness Printer took 165.43 ms. Allocated memory is still 1.2 GB. Free memory was 857.5 MB in the beginning and 844.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:08,055 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 600.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -161.3 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.26 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 831.16 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2190.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.5 MB in the end (delta: 204.5 MB). Peak memory consumption was 204.5 MB. Max. memory is 11.5 GB. * Witness Printer took 165.43 ms. Allocated memory is still 1.2 GB. Free memory was 857.5 MB in the beginning and 844.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 410]: 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; [L424] int pumpRunning = 0; [L425] int systemActive = 1; [L683] int cleanupTimeShifts = 4; [L806] int waterLevel = 1; [L807] int methaneLevelCritical = 0; [L756] int retValue_acc ; [L757] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L674] int retValue_acc ; [L677] retValue_acc = 1 [L678] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L763] tmp = valid_product() [L765] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L581] int splverifierCounter ; [L582] int tmp ; [L583] int tmp___0 ; [L584] int tmp___1 ; [L585] int tmp___2 ; [L588] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L590] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L592] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L598] tmp = __VERIFIER_nondet_int() [L600] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] COND TRUE waterLevel < 2 [L825] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] tmp___0 = __VERIFIER_nondet_int() [L610] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L836] COND FALSE !(\read(methaneLevelCritical)) [L839] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L618] tmp___2 = __VERIFIER_nondet_int() [L620] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] COND TRUE \read(systemActive) [L461] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L464] COND TRUE ! pumpRunning [L558] int retValue_acc ; [L559] int tmp ; [L560] int tmp___0 ; [L886] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L889] COND FALSE !(waterLevel < 2) [L893] retValue_acc = 0 [L894] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L564] tmp = isHighWaterSensorDry() [L566] COND FALSE !(\read(tmp)) [L569] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L571] retValue_acc = tmp___0 [L572] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] tmp = isHighWaterLevel() [L468] COND TRUE \read(tmp) [L489] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L780] int tmp ; [L781] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = methaneLevelCritical [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L785] tmp = isMethaneLevelCritical() [L787] COND TRUE \read(tmp) [L513] int retValue_acc ; [L516] retValue_acc = pumpRunning [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L789] tmp___0 = isPumpRunning() [L791] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] __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, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 577 SDtfs, 704 SDslu, 767 SDs, 0 SdLazy, 102 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 414 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 12233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...