./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product48_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_product48_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 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:44:07,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:44:07,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:44:07,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:44:07,198 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:44:07,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:44:07,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:44:07,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:44:07,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:44:07,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:44:07,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:44:07,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:44:07,207 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:44:07,208 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:44:07,209 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:44:07,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:44:07,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:44:07,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:44:07,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:44:07,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:44:07,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:44:07,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:44:07,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:44:07,231 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:44:07,231 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:44:07,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:44:07,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:44:07,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:44:07,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:44:07,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:44:07,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:44:07,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:44:07,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:44:07,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:44:07,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:44:07,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:44:07,247 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:44:07,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:44:07,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:44:07,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:44:07,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:44:07,262 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:44:07,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:44:07,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:44:07,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:44:07,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:44:07,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:44:07,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:44:07,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:44:07,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:44:07,264 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:44:07,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:44:07,264 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:44:07,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:44:07,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:44:07,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:44:07,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:44:07,265 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:44:07,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:44:07,265 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:44:07,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:44:07,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:44:07,266 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:44:07,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:44:07,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:44:07,266 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 -> 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b [2018-12-31 09:44:07,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:44:07,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:44:07,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:44:07,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:44:07,329 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:44:07,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product48_false-unreach-call_false-termination.cil.c [2018-12-31 09:44:07,398 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7dd78c3/a1a6d11ca6d54b44a06375ba57608860/FLAG140c134d9 [2018-12-31 09:44:07,903 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:44:07,904 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product48_false-unreach-call_false-termination.cil.c [2018-12-31 09:44:07,919 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7dd78c3/a1a6d11ca6d54b44a06375ba57608860/FLAG140c134d9 [2018-12-31 09:44:08,200 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7dd78c3/a1a6d11ca6d54b44a06375ba57608860 [2018-12-31 09:44:08,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:44:08,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:44:08,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:44:08,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:44:08,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:44:08,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:08,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d0e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08, skipping insertion in model container [2018-12-31 09:44:08,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:08,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:44:08,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:44:08,667 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:44:08,686 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:44:08,796 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:44:08,844 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:44:08,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08 WrapperNode [2018-12-31 09:44:08,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:44:08,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:44:08,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:44:08,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:44:08,926 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:44:08" (1/1) ... [2018-12-31 09:44:08,946 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:44:08" (1/1) ... [2018-12-31 09:44:09,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:44:09,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:44:09,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:44:09,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:44:09,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:09,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:09,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:09,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:09,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:09,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:09,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (1/1) ... [2018-12-31 09:44:09,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:44:09,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:44:09,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:44:09,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:44:09,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (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:44:09,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:44:09,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:44:09,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:44:09,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:44:10,748 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:44:10,749 INFO L280 CfgBuilder]: Removed 198 assue(true) statements. [2018-12-31 09:44:10,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:44:10 BoogieIcfgContainer [2018-12-31 09:44:10,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:44:10,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:44:10,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:44:10,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:44:10,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:44:08" (1/3) ... [2018-12-31 09:44:10,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2066b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:44:10, skipping insertion in model container [2018-12-31 09:44:10,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:08" (2/3) ... [2018-12-31 09:44:10,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2066b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:44:10, skipping insertion in model container [2018-12-31 09:44:10,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:44:10" (3/3) ... [2018-12-31 09:44:10,757 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product48_false-unreach-call_false-termination.cil.c [2018-12-31 09:44:10,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:44:10,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:44:10,795 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:44:10,830 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:44:10,831 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:44:10,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:44:10,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:44:10,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:44:10,832 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:44:10,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:44:10,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:44:10,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:44:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-12-31 09:44:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:44:10,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:10,859 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:44:10,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash 325683581, now seen corresponding path program 1 times [2018-12-31 09:44:10,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:10,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:10,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:10,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:11,132 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:44:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:44:11,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:44:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:44:11,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:44:11,154 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2018-12-31 09:44:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:11,193 INFO L93 Difference]: Finished difference Result 256 states and 383 transitions. [2018-12-31 09:44:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:44:11,195 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:44:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:11,209 INFO L225 Difference]: With dead ends: 256 [2018-12-31 09:44:11,210 INFO L226 Difference]: Without dead ends: 127 [2018-12-31 09:44:11,216 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:44:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-31 09:44:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-31 09:44:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-31 09:44:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2018-12-31 09:44:11,268 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 16 [2018-12-31 09:44:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:11,268 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2018-12-31 09:44:11,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:44:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2018-12-31 09:44:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:44:11,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:11,270 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:44:11,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1302516555, now seen corresponding path program 1 times [2018-12-31 09:44:11,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:11,434 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:44:11,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:11,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:44:11,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:44:11,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:44:11,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:44:11,439 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand 3 states. [2018-12-31 09:44:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:11,479 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2018-12-31 09:44:11,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:44:11,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:44:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:11,488 INFO L225 Difference]: With dead ends: 127 [2018-12-31 09:44:11,489 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 09:44:11,491 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:44:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 09:44:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-31 09:44:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 09:44:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2018-12-31 09:44:11,500 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 17 [2018-12-31 09:44:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:11,501 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2018-12-31 09:44:11,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:44:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2018-12-31 09:44:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:44:11,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:11,503 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:44:11,504 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1189907750, now seen corresponding path program 1 times [2018-12-31 09:44:11,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:11,707 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:44:11,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:11,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:44:11,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:11,708 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand 5 states. [2018-12-31 09:44:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:11,901 INFO L93 Difference]: Finished difference Result 123 states and 180 transitions. [2018-12-31 09:44:11,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:44:11,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 09:44:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:11,904 INFO L225 Difference]: With dead ends: 123 [2018-12-31 09:44:11,904 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 09:44:11,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:44:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 09:44:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-31 09:44:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-31 09:44:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2018-12-31 09:44:11,918 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 22 [2018-12-31 09:44:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:11,918 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2018-12-31 09:44:11,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2018-12-31 09:44:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:44:11,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:11,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:11,921 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:11,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:11,921 INFO L82 PathProgramCache]: Analyzing trace with hash 752688312, now seen corresponding path program 1 times [2018-12-31 09:44:11,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:11,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:11,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:12,018 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:44:12,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:44:12,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:44:12,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:44:12,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:44:12,021 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 3 states. [2018-12-31 09:44:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:12,128 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2018-12-31 09:44:12,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:44:12,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:44:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:12,131 INFO L225 Difference]: With dead ends: 159 [2018-12-31 09:44:12,131 INFO L226 Difference]: Without dead ends: 93 [2018-12-31 09:44:12,134 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:44:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-31 09:44:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-12-31 09:44:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-31 09:44:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2018-12-31 09:44:12,147 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 24 [2018-12-31 09:44:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:12,149 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2018-12-31 09:44:12,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:44:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2018-12-31 09:44:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:44:12,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:12,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:12,152 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1744683281, now seen corresponding path program 1 times [2018-12-31 09:44:12,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:12,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:12,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:12,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:12,352 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:44:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:12,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:44:12,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:44:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:44:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:44:12,356 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand 8 states. [2018-12-31 09:44:13,192 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 09:44:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:14,003 INFO L93 Difference]: Finished difference Result 585 states and 851 transitions. [2018-12-31 09:44:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 09:44:14,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-31 09:44:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:14,009 INFO L225 Difference]: With dead ends: 585 [2018-12-31 09:44:14,009 INFO L226 Difference]: Without dead ends: 500 [2018-12-31 09:44:14,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:44:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-31 09:44:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 227. [2018-12-31 09:44:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-31 09:44:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2018-12-31 09:44:14,069 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 25 [2018-12-31 09:44:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:14,071 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2018-12-31 09:44:14,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:44:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2018-12-31 09:44:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 09:44:14,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:14,075 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-12-31 09:44:14,075 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash 31993027, now seen corresponding path program 1 times [2018-12-31 09:44:14,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:14,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:14,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:14,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-31 09:44:14,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:14,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:44:14,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:14,361 INFO L87 Difference]: Start difference. First operand 227 states and 316 transitions. Second operand 5 states. [2018-12-31 09:44:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:14,800 INFO L93 Difference]: Finished difference Result 543 states and 767 transitions. [2018-12-31 09:44:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:44:14,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-12-31 09:44:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:14,805 INFO L225 Difference]: With dead ends: 543 [2018-12-31 09:44:14,805 INFO L226 Difference]: Without dead ends: 541 [2018-12-31 09:44:14,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:44:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-12-31 09:44:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 227. [2018-12-31 09:44:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-31 09:44:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 314 transitions. [2018-12-31 09:44:14,848 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 314 transitions. Word has length 41 [2018-12-31 09:44:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:14,849 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 314 transitions. [2018-12-31 09:44:14,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 314 transitions. [2018-12-31 09:44:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:44:14,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:14,853 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:14,854 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash 501007855, now seen corresponding path program 1 times [2018-12-31 09:44:14,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:14,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:14,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:14,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:14,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 09:44:15,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:44:15,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:15,028 INFO L87 Difference]: Start difference. First operand 227 states and 314 transitions. Second operand 5 states. [2018-12-31 09:44:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:15,457 INFO L93 Difference]: Finished difference Result 680 states and 933 transitions. [2018-12-31 09:44:15,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:44:15,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-31 09:44:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:15,462 INFO L225 Difference]: With dead ends: 680 [2018-12-31 09:44:15,462 INFO L226 Difference]: Without dead ends: 459 [2018-12-31 09:44:15,464 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:44:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-31 09:44:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 242. [2018-12-31 09:44:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-31 09:44:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 329 transitions. [2018-12-31 09:44:15,507 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 329 transitions. Word has length 51 [2018-12-31 09:44:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:15,508 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 329 transitions. [2018-12-31 09:44:15,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 329 transitions. [2018-12-31 09:44:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:44:15,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:15,517 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:15,518 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:15,518 INFO L82 PathProgramCache]: Analyzing trace with hash -85798159, now seen corresponding path program 1 times [2018-12-31 09:44:15,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:15,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:15,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 09:44:15,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:15,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:44:15,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:44:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:44:15,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:44:15,681 INFO L87 Difference]: Start difference. First operand 242 states and 329 transitions. Second operand 4 states. [2018-12-31 09:44:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:16,008 INFO L93 Difference]: Finished difference Result 560 states and 760 transitions. [2018-12-31 09:44:16,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:44:16,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-31 09:44:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:16,012 INFO L225 Difference]: With dead ends: 560 [2018-12-31 09:44:16,012 INFO L226 Difference]: Without dead ends: 324 [2018-12-31 09:44:16,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-31 09:44:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 211. [2018-12-31 09:44:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-31 09:44:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2018-12-31 09:44:16,046 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 51 [2018-12-31 09:44:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:16,046 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2018-12-31 09:44:16,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:44:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2018-12-31 09:44:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 09:44:16,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:16,047 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:16,049 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1687322796, now seen corresponding path program 1 times [2018-12-31 09:44:16,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:16,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:16,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:16,417 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:44:16,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:44:16,417 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:44:16,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:16,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:44:16,553 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:44:16,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:44:16,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:44:16,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:44:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:44:16,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:44:16,585 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 6 states. [2018-12-31 09:44:17,275 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 09:44:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:17,957 INFO L93 Difference]: Finished difference Result 598 states and 816 transitions. [2018-12-31 09:44:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:44:17,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 09:44:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:17,962 INFO L225 Difference]: With dead ends: 598 [2018-12-31 09:44:17,962 INFO L226 Difference]: Without dead ends: 435 [2018-12-31 09:44:17,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:44:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-31 09:44:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 274. [2018-12-31 09:44:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-12-31 09:44:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 365 transitions. [2018-12-31 09:44:18,011 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 365 transitions. Word has length 53 [2018-12-31 09:44:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:18,011 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 365 transitions. [2018-12-31 09:44:18,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:44:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 365 transitions. [2018-12-31 09:44:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 09:44:18,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:18,012 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-31 09:44:18,014 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1211162538, now seen corresponding path program 2 times [2018-12-31 09:44:18,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:18,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:18,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:18,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:44:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:44:18,663 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:44:18,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:44:18 BoogieIcfgContainer [2018-12-31 09:44:18,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:44:18,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:44:18,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:44:18,854 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:44:18,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:44:10" (3/4) ... [2018-12-31 09:44:18,859 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:44:19,067 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:44:19,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:44:19,073 INFO L168 Benchmark]: Toolchain (without parser) took 10868.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 946.0 MB in the beginning and 911.4 MB in the end (delta: 34.6 MB). Peak memory consumption was 241.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:19,073 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:44:19,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.61 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:19,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:19,076 INFO L168 Benchmark]: Boogie Preprocessor took 70.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:19,076 INFO L168 Benchmark]: RCFGBuilder took 1669.41 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: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:19,076 INFO L168 Benchmark]: TraceAbstraction took 8103.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 942.4 MB in the end (delta: 112.3 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:19,078 INFO L168 Benchmark]: Witness Printer took 218.02 ms. Allocated memory is still 1.2 GB. Free memory was 942.4 MB in the beginning and 911.4 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:19,081 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.61 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 161.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1669.41 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: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8103.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 942.4 MB in the end (delta: 112.3 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. * Witness Printer took 218.02 ms. Allocated memory is still 1.2 GB. Free memory was 942.4 MB in the beginning and 911.4 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 439]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L444] int cleanupTimeShifts = 4; [L556] int pumpRunning = 0; [L557] int systemActive = 1; [L774] int waterLevel = 1; [L775] int methaneLevelCritical = 0; [L525] int retValue_acc ; [L526] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L963] int retValue_acc ; [L966] retValue_acc = 1 [L967] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L532] tmp = valid_product() [L534] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L869] int splverifierCounter ; [L870] int tmp ; [L871] int tmp___0 ; [L872] int tmp___1 ; [L873] int tmp___2 ; [L876] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L880] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L886] tmp = __VERIFIER_nondet_int() [L888] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L792] COND TRUE waterLevel < 2 [L793] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L563] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L570] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L621] COND FALSE !(\read(pumpRunning)) [L592] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L595] COND TRUE ! pumpRunning [L732] int retValue_acc ; [L733] int tmp ; [L734] int tmp___0 ; [L854] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L857] COND FALSE !(waterLevel < 2) [L861] retValue_acc = 0 [L862] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L738] tmp = isHighWaterSensorDry() [L740] COND FALSE !(\read(tmp)) [L743] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L745] retValue_acc = tmp___0 [L746] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L597] tmp = isHighWaterLevel() [L599] COND TRUE \read(tmp) [L651] int tmp ; [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L655] tmp = isMethaneAlarm() [L657] COND FALSE !(\read(tmp)) [L646] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] 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] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L886] tmp = __VERIFIER_nondet_int() [L888] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L563] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L780] COND TRUE waterLevel > 0 [L781] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L570] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L621] COND TRUE \read(pumpRunning) [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L623] tmp = isMethaneAlarm() [L625] COND FALSE !(\read(tmp)) [L592] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L595] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] 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] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L880] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L886] tmp = __VERIFIER_nondet_int() [L888] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L563] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L780] COND TRUE waterLevel > 0 [L781] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L570] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L621] COND TRUE \read(pumpRunning) [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L623] tmp = isMethaneAlarm() [L625] COND FALSE !(\read(tmp)) [L592] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L595] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] 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 [L687] int retValue_acc ; [L690] retValue_acc = pumpRunning [L691] 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] [L439] __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, 131 locations, 3 error locations. UNSAFE Result, 8.0s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1025 SDtfs, 1698 SDslu, 1733 SDs, 0 SdLazy, 278 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1084 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 26367 SizeOfPredicates, 4 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 65/71 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...