./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product34_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_spec4_product34_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 feddb53df5c889a09349b532f3a03633c4161684 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:43:36,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:43:36,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:43:36,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:43:36,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:43:36,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:43:36,876 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:43:36,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:43:36,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:43:36,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:43:36,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:43:36,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:43:36,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:43:36,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:43:36,898 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:43:36,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:43:36,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:43:36,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:43:36,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:43:36,912 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:43:36,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:43:36,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:43:36,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:43:36,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:43:36,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:43:36,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:43:36,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:43:36,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:43:36,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:43:36,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:43:36,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:43:36,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:43:36,935 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:43:36,935 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:43:36,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:43:36,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:43:36,942 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:43:36,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:43:36,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:43:36,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:43:36,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:43:36,969 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:43:36,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:43:36,969 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:43:36,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:43:36,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:43:36,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:43:36,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:43:36,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:43:36,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:43:36,971 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:43:36,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:43:36,971 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:43:36,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:43:36,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:43:36,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:43:36,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:43:36,972 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:43:36,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:36,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:43:36,974 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:43:36,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:43:36,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:43:36,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:43:36,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:43:36,975 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 -> feddb53df5c889a09349b532f3a03633c4161684 [2018-12-31 09:43:37,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:43:37,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:43:37,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:43:37,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:43:37,032 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:43:37,033 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product34_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:37,092 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbc385118/bd60e707d83f488e86ba16c05b385c78/FLAGc2daf28dc [2018-12-31 09:43:37,626 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:43:37,628 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product34_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:37,646 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbc385118/bd60e707d83f488e86ba16c05b385c78/FLAGc2daf28dc [2018-12-31 09:43:37,879 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbc385118/bd60e707d83f488e86ba16c05b385c78 [2018-12-31 09:43:37,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:43:37,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:43:37,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:37,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:43:37,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:43:37,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:37" (1/1) ... [2018-12-31 09:43:37,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f622d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:37, skipping insertion in model container [2018-12-31 09:43:37,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:37" (1/1) ... [2018-12-31 09:43:37,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:43:37,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:43:38,391 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:38,406 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:43:38,491 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:38,532 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:43:38,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38 WrapperNode [2018-12-31 09:43:38,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:38,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:38,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:43:38,534 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:43:38,611 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:43:38" (1/1) ... [2018-12-31 09:43:38,631 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:43:38" (1/1) ... [2018-12-31 09:43:38,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:38,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:43:38,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:43:38,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:43:38,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (1/1) ... [2018-12-31 09:43:38,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (1/1) ... [2018-12-31 09:43:38,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (1/1) ... [2018-12-31 09:43:38,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (1/1) ... [2018-12-31 09:43:38,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (1/1) ... [2018-12-31 09:43:38,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (1/1) ... [2018-12-31 09:43:38,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (1/1) ... [2018-12-31 09:43:38,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:43:38,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:43:38,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:43:38,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:43:38,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (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:43:38,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:43:38,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:43:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:43:38,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:43:39,978 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:43:39,978 INFO L280 CfgBuilder]: Removed 98 assue(true) statements. [2018-12-31 09:43:39,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:39 BoogieIcfgContainer [2018-12-31 09:43:39,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:43:39,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:43:39,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:43:39,985 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:43:39,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:43:37" (1/3) ... [2018-12-31 09:43:39,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19df0f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:39, skipping insertion in model container [2018-12-31 09:43:39,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:38" (2/3) ... [2018-12-31 09:43:39,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19df0f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:39, skipping insertion in model container [2018-12-31 09:43:39,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:39" (3/3) ... [2018-12-31 09:43:39,992 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product34_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:40,004 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:43:40,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:43:40,034 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:43:40,076 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:43:40,077 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:43:40,077 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:43:40,078 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:43:40,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:43:40,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:43:40,079 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:43:40,079 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:43:40,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:43:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-12-31 09:43:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:43:40,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:40,107 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:43:40,109 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204181, now seen corresponding path program 1 times [2018-12-31 09:43:40,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:40,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:40,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:40,399 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:43:40,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:40,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:40,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:43:40,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:43:40,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:40,422 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-12-31 09:43:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:40,451 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2018-12-31 09:43:40,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:43:40,453 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:43:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:40,466 INFO L225 Difference]: With dead ends: 150 [2018-12-31 09:43:40,466 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 09:43:40,470 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:43:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 09:43:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-31 09:43:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 09:43:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2018-12-31 09:43:40,517 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2018-12-31 09:43:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:40,518 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2018-12-31 09:43:40,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:43:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2018-12-31 09:43:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:43:40,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:40,520 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:43:40,520 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -631654862, now seen corresponding path program 1 times [2018-12-31 09:43:40,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:40,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:40,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:40,693 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:43:40,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:40,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:43:40,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:40,697 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2018-12-31 09:43:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:40,721 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2018-12-31 09:43:40,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:40,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:43:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:40,723 INFO L225 Difference]: With dead ends: 74 [2018-12-31 09:43:40,723 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:43:40,724 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:43:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:43:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 09:43:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 09:43:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2018-12-31 09:43:40,730 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2018-12-31 09:43:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:40,730 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2018-12-31 09:43:40,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2018-12-31 09:43:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:43:40,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:40,731 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:43:40,732 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash -964945646, now seen corresponding path program 1 times [2018-12-31 09:43:40,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:40,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:40,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:40,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:40,935 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:43:40,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:40,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:40,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:40,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:40,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:40,939 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2018-12-31 09:43:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:41,027 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2018-12-31 09:43:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:43:41,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 09:43:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:41,029 INFO L225 Difference]: With dead ends: 62 [2018-12-31 09:43:41,029 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:43:41,030 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:43:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:43:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 09:43:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 09:43:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2018-12-31 09:43:41,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2018-12-31 09:43:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:41,036 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2018-12-31 09:43:41,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2018-12-31 09:43:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:43:41,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:41,038 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] [2018-12-31 09:43:41,038 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:41,039 INFO L82 PathProgramCache]: Analyzing trace with hash -952202930, now seen corresponding path program 1 times [2018-12-31 09:43:41,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:41,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:41,134 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:43:41,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:41,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:41,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:41,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:41,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:41,136 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2018-12-31 09:43:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:41,230 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2018-12-31 09:43:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:41,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:43:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:41,232 INFO L225 Difference]: With dead ends: 83 [2018-12-31 09:43:41,232 INFO L226 Difference]: Without dead ends: 55 [2018-12-31 09:43:41,234 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:43:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-31 09:43:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-12-31 09:43:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 09:43:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2018-12-31 09:43:41,244 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2018-12-31 09:43:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:41,244 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2018-12-31 09:43:41,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2018-12-31 09:43:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:43:41,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:41,246 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] [2018-12-31 09:43:41,246 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:41,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2049720417, now seen corresponding path program 1 times [2018-12-31 09:43:41,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:41,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:41,393 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:43:41,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:41,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:41,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:41,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:41,395 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2018-12-31 09:43:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:41,541 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2018-12-31 09:43:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:41,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-31 09:43:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:41,547 INFO L225 Difference]: With dead ends: 139 [2018-12-31 09:43:41,547 INFO L226 Difference]: Without dead ends: 92 [2018-12-31 09:43:41,548 INFO L631 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 [2018-12-31 09:43:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-31 09:43:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2018-12-31 09:43:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 09:43:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2018-12-31 09:43:41,570 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2018-12-31 09:43:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:41,570 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2018-12-31 09:43:41,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2018-12-31 09:43:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:43:41,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:41,572 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] [2018-12-31 09:43:41,572 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 612790626, now seen corresponding path program 1 times [2018-12-31 09:43:41,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:41,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:41,749 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:43:41,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:41,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:43:41,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:43:41,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:43:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:41,751 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 8 states. [2018-12-31 09:43:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:43,250 INFO L93 Difference]: Finished difference Result 347 states and 497 transitions. [2018-12-31 09:43:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 09:43:43,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-31 09:43:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:43,255 INFO L225 Difference]: With dead ends: 347 [2018-12-31 09:43:43,255 INFO L226 Difference]: Without dead ends: 297 [2018-12-31 09:43:43,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:43:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-31 09:43:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 140. [2018-12-31 09:43:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-31 09:43:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2018-12-31 09:43:43,286 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 29 [2018-12-31 09:43:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:43,287 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2018-12-31 09:43:43,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:43:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2018-12-31 09:43:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 09:43:43,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:43,291 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:43,292 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash -230943976, now seen corresponding path program 1 times [2018-12-31 09:43:43,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:43,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:43,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:43,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 09:43:43,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:43,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:43:43,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:43:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:43:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:43:43,698 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2018-12-31 09:43:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:44,246 INFO L93 Difference]: Finished difference Result 325 states and 442 transitions. [2018-12-31 09:43:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:43:44,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-12-31 09:43:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:44,248 INFO L225 Difference]: With dead ends: 325 [2018-12-31 09:43:44,249 INFO L226 Difference]: Without dead ends: 191 [2018-12-31 09:43:44,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:43:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-31 09:43:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 120. [2018-12-31 09:43:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-31 09:43:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2018-12-31 09:43:44,275 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 44 [2018-12-31 09:43:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:44,276 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2018-12-31 09:43:44,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:43:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2018-12-31 09:43:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 09:43:44,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:44,280 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:44,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash -187398120, now seen corresponding path program 1 times [2018-12-31 09:43:44,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:44,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:44,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:44,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:43:44,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:43:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:44,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:43:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:44,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:43:44,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-31 09:43:44,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:43:44,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:43:44,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:44,787 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand 8 states. [2018-12-31 09:43:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,930 INFO L93 Difference]: Finished difference Result 412 states and 570 transitions. [2018-12-31 09:43:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 09:43:45,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-12-31 09:43:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,941 INFO L225 Difference]: With dead ends: 412 [2018-12-31 09:43:45,941 INFO L226 Difference]: Without dead ends: 321 [2018-12-31 09:43:45,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:43:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-31 09:43:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 159. [2018-12-31 09:43:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-31 09:43:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 211 transitions. [2018-12-31 09:43:45,991 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 211 transitions. Word has length 45 [2018-12-31 09:43:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,991 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 211 transitions. [2018-12-31 09:43:45,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:43:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 211 transitions. [2018-12-31 09:43:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 09:43:45,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,994 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:45,994 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,995 INFO L82 PathProgramCache]: Analyzing trace with hash 774082429, now seen corresponding path program 2 times [2018-12-31 09:43:45,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:46,697 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:43:46,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:43:46 BoogieIcfgContainer [2018-12-31 09:43:46,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:43:46,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:43:46,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:43:46,837 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:43:46,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:39" (3/4) ... [2018-12-31 09:43:46,841 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:43:47,019 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:43:47,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:43:47,021 INFO L168 Benchmark]: Toolchain (without parser) took 9136.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -91.5 MB). Peak memory consumption was 114.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:47,023 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:43:47,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 920.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:47,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:47,024 INFO L168 Benchmark]: Boogie Preprocessor took 40.67 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:43:47,025 INFO L168 Benchmark]: RCFGBuilder took 1250.91 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.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:47,025 INFO L168 Benchmark]: TraceAbstraction took 6855.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:47,025 INFO L168 Benchmark]: Witness Printer took 183.51 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: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:47,031 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 920.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.67 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 1250.91 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.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6855.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. * Witness Printer took 183.51 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: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 540]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] int cleanupTimeShifts = 4; [L282] int pumpRunning = 0; [L283] int systemActive = 1; [L442] int waterLevel = 1; [L443] int methaneLevelCritical = 0; [L714] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L150] int retValue_acc ; [L151] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L199] int retValue_acc ; [L202] retValue_acc = 1 [L203] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] tmp = valid_product() [L159] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L210] int splverifierCounter ; [L211] int tmp ; [L212] int tmp___0 ; [L213] int tmp___1 ; [L214] int tmp___2 ; [L217] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L227] tmp = __VERIFIER_nondet_int() [L229] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L460] COND TRUE waterLevel < 2 [L461] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L289] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L321] COND TRUE ! pumpRunning [L415] int retValue_acc ; [L416] int tmp ; [L417] int tmp___0 ; [L522] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L525] COND FALSE !(waterLevel < 2) [L529] retValue_acc = 0 [L530] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L421] tmp = isHighWaterSensorDry() [L423] COND FALSE !(\read(tmp)) [L426] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L428] retValue_acc = tmp___0 [L429] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L323] tmp = isHighWaterLevel() [L325] COND TRUE \read(tmp) [L346] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L227] tmp = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L289] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L448] COND TRUE waterLevel > 0 [L449] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L321] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L227] tmp = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L289] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L448] COND TRUE waterLevel > 0 [L449] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L321] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L370] int retValue_acc ; [L373] retValue_acc = pumpRunning [L374] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L540] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 3 error locations. UNSAFE Result, 6.7s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 552 SDtfs, 1019 SDslu, 1121 SDs, 0 SdLazy, 205 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 428 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 16395 SizeOfPredicates, 4 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 36/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...