./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5667765c016e1c72bafcc0c365d87d7652cb3eb1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:57:37,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:57:37,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:57:37,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:57:37,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:57:37,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:57:37,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:57:37,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:57:37,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:57:37,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:57:37,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:57:37,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:57:37,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:57:37,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:57:37,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:57:37,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:57:37,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:57:37,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:57:37,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:57:37,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:57:37,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:57:37,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:57:37,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:57:37,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:57:37,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:57:37,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:57:37,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:57:37,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:57:37,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:57:37,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:57:37,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:57:37,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:57:37,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:57:37,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:57:37,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:57:37,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:57:37,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:57:37,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:57:37,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:57:37,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:57:37,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:57:37,110 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:57:37,139 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:57:37,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:57:37,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:57:37,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:57:37,142 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:57:37,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:57:37,143 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:57:37,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:57:37,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:57:37,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:57:37,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:57:37,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:57:37,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:57:37,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:57:37,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:57:37,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:57:37,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:57:37,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:57:37,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:57:37,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:57:37,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:57:37,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:57:37,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:57:37,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:57:37,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:57:37,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:57:37,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:57:37,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:57:37,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5667765c016e1c72bafcc0c365d87d7652cb3eb1 [2019-11-19 18:57:37,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:57:37,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:57:37,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:57:37,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:57:37,486 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:57:37,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c [2019-11-19 18:57:37,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2c562e02/8930b9325aab44aaa3515f40291539a4/FLAGbcaa9ec80 [2019-11-19 18:57:38,032 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:57:38,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c [2019-11-19 18:57:38,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2c562e02/8930b9325aab44aaa3515f40291539a4/FLAGbcaa9ec80 [2019-11-19 18:57:38,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2c562e02/8930b9325aab44aaa3515f40291539a4 [2019-11-19 18:57:38,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:57:38,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:57:38,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:38,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:57:38,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:57:38,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:38,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3721bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38, skipping insertion in model container [2019-11-19 18:57:38,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:38,382 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:57:38,448 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:57:38,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:38,863 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:57:38,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:38,978 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:57:38,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38 WrapperNode [2019-11-19 18:57:38,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:38,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:38,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:57:38,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:57:38,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:39,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:57:39,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:57:39,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:57:39,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (1/1) ... [2019-11-19 18:57:39,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:57:39,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:57:39,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:57:39,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:57:39,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57: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 [2019-11-19 18:57:39,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:57:39,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 18:57:39,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:57:39,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:57:39,857 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:57:39,858 INFO L285 CfgBuilder]: Removed 102 assume(true) statements. [2019-11-19 18:57:39,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:39 BoogieIcfgContainer [2019-11-19 18:57:39,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:57:39,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:57:39,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:57:39,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:57:39,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:57:38" (1/3) ... [2019-11-19 18:57:39,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5d677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:39, skipping insertion in model container [2019-11-19 18:57:39,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:38" (2/3) ... [2019-11-19 18:57:39,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5d677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:39, skipping insertion in model container [2019-11-19 18:57:39,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:39" (3/3) ... [2019-11-19 18:57:39,868 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product33.cil.c [2019-11-19 18:57:39,877 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:57:39,885 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 18:57:39,894 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 18:57:39,916 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:57:39,916 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:57:39,916 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:57:39,916 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:57:39,917 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:57:39,917 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:57:39,917 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:57:39,917 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:57:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-19 18:57:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 18:57:39,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:39,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:39,940 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1284074395, now seen corresponding path program 1 times [2019-11-19 18:57:39,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:39,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725357406] [2019-11-19 18:57:39,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:40,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725357406] [2019-11-19 18:57:40,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:40,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:40,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894968475] [2019-11-19 18:57:40,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:57:40,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:57:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:57:40,263 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-11-19 18:57:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:40,293 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2019-11-19 18:57:40,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:57:40,295 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-19 18:57:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:40,305 INFO L225 Difference]: With dead ends: 162 [2019-11-19 18:57:40,305 INFO L226 Difference]: Without dead ends: 80 [2019-11-19 18:57:40,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:57:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-19 18:57:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-19 18:57:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-19 18:57:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2019-11-19 18:57:40,348 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2019-11-19 18:57:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:40,348 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2019-11-19 18:57:40,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:57:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2019-11-19 18:57:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 18:57:40,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:40,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:40,351 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash 373043642, now seen corresponding path program 1 times [2019-11-19 18:57:40,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:40,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901347839] [2019-11-19 18:57:40,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:40,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901347839] [2019-11-19 18:57:40,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:40,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:57:40,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147253038] [2019-11-19 18:57:40,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:40,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:40,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:40,476 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2019-11-19 18:57:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:40,488 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2019-11-19 18:57:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:40,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 18:57:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:40,491 INFO L225 Difference]: With dead ends: 80 [2019-11-19 18:57:40,491 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 18:57:40,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 18:57:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 18:57:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 18:57:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-19 18:57:40,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-11-19 18:57:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:40,499 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-19 18:57:40,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-19 18:57:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 18:57:40,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:40,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:40,501 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:40,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:40,502 INFO L82 PathProgramCache]: Analyzing trace with hash -196588044, now seen corresponding path program 1 times [2019-11-19 18:57:40,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:40,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075467001] [2019-11-19 18:57:40,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:40,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075467001] [2019-11-19 18:57:40,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:40,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:40,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770862727] [2019-11-19 18:57:40,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:40,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:40,628 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-11-19 18:57:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:40,648 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-11-19 18:57:40,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:40,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 18:57:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:40,652 INFO L225 Difference]: With dead ends: 66 [2019-11-19 18:57:40,653 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 18:57:40,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 18:57:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 18:57:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 18:57:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-11-19 18:57:40,664 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-11-19 18:57:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:40,664 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-11-19 18:57:40,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-11-19 18:57:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 18:57:40,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:40,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:40,667 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash 961211503, now seen corresponding path program 1 times [2019-11-19 18:57:40,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:40,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456366148] [2019-11-19 18:57:40,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:40,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456366148] [2019-11-19 18:57:40,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:40,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:40,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549376461] [2019-11-19 18:57:40,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:40,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:40,749 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-11-19 18:57:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:40,793 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-19 18:57:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:40,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 18:57:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:40,795 INFO L225 Difference]: With dead ends: 89 [2019-11-19 18:57:40,795 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 18:57:40,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 18:57:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-11-19 18:57:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-19 18:57:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-11-19 18:57:40,811 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2019-11-19 18:57:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:40,812 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-11-19 18:57:40,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-11-19 18:57:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:40,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:40,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:40,815 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1128412896, now seen corresponding path program 1 times [2019-11-19 18:57:40,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:40,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133530937] [2019-11-19 18:57:40,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:40,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133530937] [2019-11-19 18:57:40,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:40,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:40,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067923964] [2019-11-19 18:57:40,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:40,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:40,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:40,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:40,932 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2019-11-19 18:57:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:41,003 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2019-11-19 18:57:41,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:57:41,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 18:57:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:41,007 INFO L225 Difference]: With dead ends: 149 [2019-11-19 18:57:41,007 INFO L226 Difference]: Without dead ends: 98 [2019-11-19 18:57:41,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:57:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-19 18:57:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-11-19 18:57:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 18:57:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2019-11-19 18:57:41,018 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2019-11-19 18:57:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:41,019 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2019-11-19 18:57:41,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2019-11-19 18:57:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:41,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:41,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:41,021 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1016803, now seen corresponding path program 1 times [2019-11-19 18:57:41,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:41,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077799481] [2019-11-19 18:57:41,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:41,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077799481] [2019-11-19 18:57:41,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:41,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:41,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11174111] [2019-11-19 18:57:41,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:41,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:41,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:41,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:41,101 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2019-11-19 18:57:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:41,224 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2019-11-19 18:57:41,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:57:41,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 18:57:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:41,228 INFO L225 Difference]: With dead ends: 314 [2019-11-19 18:57:41,228 INFO L226 Difference]: Without dead ends: 260 [2019-11-19 18:57:41,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:57:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-19 18:57:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2019-11-19 18:57:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-19 18:57:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-11-19 18:57:41,247 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2019-11-19 18:57:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:41,248 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-11-19 18:57:41,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-11-19 18:57:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:41,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:41,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:41,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:41,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:41,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2111743067, now seen corresponding path program 1 times [2019-11-19 18:57:41,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:41,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49407665] [2019-11-19 18:57:41,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:41,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49407665] [2019-11-19 18:57:41,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:41,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:41,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471137611] [2019-11-19 18:57:41,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:41,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:41,335 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2019-11-19 18:57:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:41,485 INFO L93 Difference]: Finished difference Result 446 states and 629 transitions. [2019-11-19 18:57:41,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:57:41,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-19 18:57:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:41,488 INFO L225 Difference]: With dead ends: 446 [2019-11-19 18:57:41,488 INFO L226 Difference]: Without dead ends: 392 [2019-11-19 18:57:41,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:57:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-19 18:57:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 152. [2019-11-19 18:57:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-19 18:57:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-11-19 18:57:41,511 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2019-11-19 18:57:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:41,511 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-11-19 18:57:41,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-11-19 18:57:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:41,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:41,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:41,513 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1172106979, now seen corresponding path program 1 times [2019-11-19 18:57:41,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:41,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511569352] [2019-11-19 18:57:41,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:41,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511569352] [2019-11-19 18:57:41,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:41,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:41,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020434007] [2019-11-19 18:57:41,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:57:41,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:57:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:57:41,566 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2019-11-19 18:57:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:41,613 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2019-11-19 18:57:41,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:57:41,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-19 18:57:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:41,616 INFO L225 Difference]: With dead ends: 352 [2019-11-19 18:57:41,616 INFO L226 Difference]: Without dead ends: 250 [2019-11-19 18:57:41,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-19 18:57:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-11-19 18:57:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-19 18:57:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-11-19 18:57:41,641 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2019-11-19 18:57:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:41,642 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-11-19 18:57:41,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:57:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-11-19 18:57:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:41,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:41,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:41,650 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1737298786, now seen corresponding path program 1 times [2019-11-19 18:57:41,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:41,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187218498] [2019-11-19 18:57:41,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:41,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187218498] [2019-11-19 18:57:41,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:41,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:57:41,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307273328] [2019-11-19 18:57:41,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:57:41,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:57:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:57:41,738 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 6 states. [2019-11-19 18:57:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:41,906 INFO L93 Difference]: Finished difference Result 383 states and 531 transitions. [2019-11-19 18:57:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:57:41,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-19 18:57:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:41,908 INFO L225 Difference]: With dead ends: 383 [2019-11-19 18:57:41,908 INFO L226 Difference]: Without dead ends: 120 [2019-11-19 18:57:41,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:57:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-19 18:57:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 60. [2019-11-19 18:57:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 18:57:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-11-19 18:57:41,921 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2019-11-19 18:57:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:41,922 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-11-19 18:57:41,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:57:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-11-19 18:57:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:41,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:41,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:41,926 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1430272417, now seen corresponding path program 1 times [2019-11-19 18:57:41,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:41,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113887662] [2019-11-19 18:57:41,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:42,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113887662] [2019-11-19 18:57:42,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:42,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:42,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207312056] [2019-11-19 18:57:42,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:42,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:42,027 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2019-11-19 18:57:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:42,078 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-11-19 18:57:42,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:57:42,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-19 18:57:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:42,081 INFO L225 Difference]: With dead ends: 103 [2019-11-19 18:57:42,081 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:57:42,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:57:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:57:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:57:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:57:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:57:42,088 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-11-19 18:57:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:42,089 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:57:42,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:57:42,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:57:42,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:57:42,269 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-11-19 18:57:42,949 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 13 [2019-11-19 18:57:43,198 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-11-19 18:57:43,332 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 20 [2019-11-19 18:57:43,483 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-11-19 18:57:43,603 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2019-11-19 18:57:43,712 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 19 [2019-11-19 18:57:43,902 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-11-19 18:57:43,910 INFO L444 ceAbstractionStarter]: For program point L828(lines 828 832) no Hoare annotation was computed. [2019-11-19 18:57:43,910 INFO L444 ceAbstractionStarter]: For program point L828-2(lines 828 832) no Hoare annotation was computed. [2019-11-19 18:57:43,911 INFO L444 ceAbstractionStarter]: For program point L828-3(lines 828 832) no Hoare annotation was computed. [2019-11-19 18:57:43,911 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-11-19 18:57:43,911 INFO L444 ceAbstractionStarter]: For program point L828-5(lines 828 832) no Hoare annotation was computed. [2019-11-19 18:57:43,911 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-19 18:57:43,911 INFO L444 ceAbstractionStarter]: For program point L828-6(lines 828 832) no Hoare annotation was computed. [2019-11-19 18:57:43,911 INFO L444 ceAbstractionStarter]: For program point L828-8(lines 828 832) no Hoare annotation was computed. [2019-11-19 18:57:43,912 INFO L440 ceAbstractionStarter]: At program point L779(lines 774 782) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (not (= |ULTIMATE.start_isPumpRunning_#res| 0)) (not (= ~pumpRunning~0 0)) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-11-19 18:57:43,912 INFO L440 ceAbstractionStarter]: At program point L779-1(lines 774 782) the Hoare annotation is: false [2019-11-19 18:57:43,912 INFO L440 ceAbstractionStarter]: At program point L779-2(lines 774 782) the Hoare annotation is: false [2019-11-19 18:57:43,912 INFO L440 ceAbstractionStarter]: At program point L135(lines 126 139) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) (and .cse0 .cse1 .cse2)) (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2))) [2019-11-19 18:57:43,912 INFO L440 ceAbstractionStarter]: At program point L135-1(lines 126 139) the Hoare annotation is: false [2019-11-19 18:57:43,912 INFO L440 ceAbstractionStarter]: At program point L135-2(lines 126 139) the Hoare annotation is: false [2019-11-19 18:57:43,913 INFO L440 ceAbstractionStarter]: At program point L895(lines 1 906) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-19 18:57:43,915 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:57:43,915 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 738) no Hoare annotation was computed. [2019-11-19 18:57:43,915 INFO L444 ceAbstractionStarter]: For program point L730-1(lines 730 738) no Hoare annotation was computed. [2019-11-19 18:57:43,915 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-19 18:57:43,915 INFO L444 ceAbstractionStarter]: For program point L730-2(lines 730 738) no Hoare annotation was computed. [2019-11-19 18:57:43,916 INFO L444 ceAbstractionStarter]: For program point L664-2(lines 694 700) no Hoare annotation was computed. [2019-11-19 18:57:43,916 INFO L444 ceAbstractionStarter]: For program point L53(lines 53 57) no Hoare annotation was computed. [2019-11-19 18:57:43,916 INFO L444 ceAbstractionStarter]: For program point L53-3(lines 53 57) no Hoare annotation was computed. [2019-11-19 18:57:43,917 INFO L444 ceAbstractionStarter]: For program point L53-6(lines 53 57) no Hoare annotation was computed. [2019-11-19 18:57:43,917 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 204) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-19 18:57:43,917 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 654) no Hoare annotation was computed. [2019-11-19 18:57:43,917 INFO L440 ceAbstractionStarter]: At program point L648-1(lines 648 654) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-11-19 18:57:43,918 INFO L440 ceAbstractionStarter]: At program point L153-2(lines 153 167) the Hoare annotation is: false [2019-11-19 18:57:43,918 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 18:57:43,918 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 868) no Hoare annotation was computed. [2019-11-19 18:57:43,918 INFO L444 ceAbstractionStarter]: For program point L848-2(lines 848 868) no Hoare annotation was computed. [2019-11-19 18:57:43,918 INFO L444 ceAbstractionStarter]: For program point L848-4(lines 848 868) no Hoare annotation was computed. [2019-11-19 18:57:43,919 INFO L440 ceAbstractionStarter]: At program point L122(lines 117 125) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= |ULTIMATE.start_getWaterLevel_#res| 1) (<= ~waterLevel~0 1) .cse1 .cse2) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (not .cse1) .cse2))) [2019-11-19 18:57:43,919 INFO L440 ceAbstractionStarter]: At program point L122-1(lines 117 125) the Hoare annotation is: false [2019-11-19 18:57:43,920 INFO L440 ceAbstractionStarter]: At program point L122-2(lines 117 125) the Hoare annotation is: false [2019-11-19 18:57:43,920 INFO L447 ceAbstractionStarter]: At program point L238(lines 219 241) the Hoare annotation is: true [2019-11-19 18:57:43,920 INFO L440 ceAbstractionStarter]: At program point L701(lines 701 707) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1) (not .cse2)) (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= ~waterLevel~0 1) .cse2 .cse1))) [2019-11-19 18:57:43,920 INFO L440 ceAbstractionStarter]: At program point L701-1(lines 701 707) the Hoare annotation is: false [2019-11-19 18:57:43,920 INFO L440 ceAbstractionStarter]: At program point L701-2(lines 701 707) the Hoare annotation is: false [2019-11-19 18:57:43,921 INFO L440 ceAbstractionStarter]: At program point L90(lines 85 93) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (and .cse0 .cse1)) (not .cse2)) (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= ~waterLevel~0 1) .cse2 .cse1))) [2019-11-19 18:57:43,921 INFO L440 ceAbstractionStarter]: At program point L90-1(lines 85 93) the Hoare annotation is: false [2019-11-19 18:57:43,921 INFO L440 ceAbstractionStarter]: At program point L90-2(lines 85 93) the Hoare annotation is: false [2019-11-19 18:57:43,921 INFO L440 ceAbstractionStarter]: At program point L834(lines 819 837) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 1)) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) .cse0 (and .cse1 .cse3 .cse4)) (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse2 .cse3 .cse4))) [2019-11-19 18:57:43,922 INFO L440 ceAbstractionStarter]: At program point L834-1(lines 819 837) the Hoare annotation is: false [2019-11-19 18:57:43,922 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:57:43,922 INFO L440 ceAbstractionStarter]: At program point L834-2(lines 819 837) the Hoare annotation is: false [2019-11-19 18:57:43,922 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 161) no Hoare annotation was computed. [2019-11-19 18:57:43,922 INFO L444 ceAbstractionStarter]: For program point L157-1(lines 694 700) no Hoare annotation was computed. [2019-11-19 18:57:43,923 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-11-19 18:57:43,923 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-19 18:57:43,923 INFO L440 ceAbstractionStarter]: At program point L638-1(lines 638 644) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-11-19 18:57:43,923 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-19 18:57:43,924 INFO L440 ceAbstractionStarter]: At program point L903(lines 898 906) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-19 18:57:43,924 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:57:43,924 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 867) no Hoare annotation was computed. [2019-11-19 18:57:43,924 INFO L440 ceAbstractionStarter]: At program point L854-1(lines 1 906) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0)) (.cse1 (= ~pumpRunning~0 0))) (or (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2) (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (and .cse0 .cse2)) (not .cse1)))) [2019-11-19 18:57:43,924 INFO L444 ceAbstractionStarter]: For program point L854-2(lines 854 867) no Hoare annotation was computed. [2019-11-19 18:57:43,925 INFO L440 ceAbstractionStarter]: At program point L854-3(lines 1 906) the Hoare annotation is: false [2019-11-19 18:57:43,925 INFO L444 ceAbstractionStarter]: For program point L854-4(lines 854 867) no Hoare annotation was computed. [2019-11-19 18:57:43,925 INFO L440 ceAbstractionStarter]: At program point L854-5(lines 1 906) the Hoare annotation is: false [2019-11-19 18:57:43,925 INFO L440 ceAbstractionStarter]: At program point L674(lines 627 675) the Hoare annotation is: false [2019-11-19 18:57:43,926 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 669) no Hoare annotation was computed. [2019-11-19 18:57:43,926 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 236) no Hoare annotation was computed. [2019-11-19 18:57:43,926 INFO L447 ceAbstractionStarter]: At program point L229-1(lines 229 236) the Hoare annotation is: true [2019-11-19 18:57:43,926 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 136) no Hoare annotation was computed. [2019-11-19 18:57:43,926 INFO L444 ceAbstractionStarter]: For program point L130-1(lines 130 136) no Hoare annotation was computed. [2019-11-19 18:57:43,927 INFO L444 ceAbstractionStarter]: For program point L130-2(lines 130 136) no Hoare annotation was computed. [2019-11-19 18:57:43,927 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 69) no Hoare annotation was computed. [2019-11-19 18:57:43,927 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 18:57:43,927 INFO L444 ceAbstractionStarter]: For program point L858(lines 858 864) no Hoare annotation was computed. [2019-11-19 18:57:43,928 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-11-19 18:57:43,928 INFO L444 ceAbstractionStarter]: For program point L858-2(lines 858 864) no Hoare annotation was computed. [2019-11-19 18:57:43,928 INFO L444 ceAbstractionStarter]: For program point L726(lines 726 743) no Hoare annotation was computed. [2019-11-19 18:57:43,928 INFO L444 ceAbstractionStarter]: For program point L858-4(lines 858 864) no Hoare annotation was computed. [2019-11-19 18:57:43,928 INFO L444 ceAbstractionStarter]: For program point L726-1(lines 726 743) no Hoare annotation was computed. [2019-11-19 18:57:43,929 INFO L444 ceAbstractionStarter]: For program point L726-2(lines 726 743) no Hoare annotation was computed. [2019-11-19 18:57:43,929 INFO L440 ceAbstractionStarter]: At program point L694(lines 693 712) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-11-19 18:57:43,929 INFO L444 ceAbstractionStarter]: For program point L694-1(lines 694 700) no Hoare annotation was computed. [2019-11-19 18:57:43,929 INFO L440 ceAbstractionStarter]: At program point L694-2(lines 693 712) the Hoare annotation is: false [2019-11-19 18:57:43,929 INFO L440 ceAbstractionStarter]: At program point L694-3(lines 693 712) the Hoare annotation is: false [2019-11-19 18:57:43,930 INFO L444 ceAbstractionStarter]: For program point L629(lines 628 673) no Hoare annotation was computed. [2019-11-19 18:57:43,930 INFO L444 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2019-11-19 18:57:43,930 INFO L444 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2019-11-19 18:57:43,930 INFO L444 ceAbstractionStarter]: For program point L613-2(line 613) no Hoare annotation was computed. [2019-11-19 18:57:43,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:57:43 BoogieIcfgContainer [2019-11-19 18:57:43,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:57:43,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:57:43,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:57:43,970 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:57:43,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:39" (3/4) ... [2019-11-19 18:57:43,974 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:57:43,991 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-11-19 18:57:43,992 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-19 18:57:43,993 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-19 18:57:43,993 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 18:57:43,994 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 18:57:43,995 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 18:57:44,030 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-19 18:57:44,031 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == systemActive && 0 == tmp) && \result <= 1) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && !(pumpRunning == 0)) && 0 == splverifierCounter) [2019-11-19 18:57:44,031 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == tmp && 1 == systemActive) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 0 && 0 == tmp) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-19 18:57:44,032 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && 0 == tmp) && !(\result == 0)) && !(pumpRunning == 0)) && 0 == splverifierCounter [2019-11-19 18:57:44,100 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:57:44,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:57:44,102 INFO L168 Benchmark]: Toolchain (without parser) took 5740.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 956.3 MB in the beginning and 892.9 MB in the end (delta: 63.4 MB). Peak memory consumption was 277.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:44,102 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:57:44,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:44,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.27 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:44,104 INFO L168 Benchmark]: Boogie Preprocessor took 38.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:57:44,104 INFO L168 Benchmark]: RCFGBuilder took 774.95 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:44,105 INFO L168 Benchmark]: TraceAbstraction took 4106.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.0 GB in the beginning and 900.9 MB in the end (delta: 148.4 MB). Peak memory consumption was 252.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:44,105 INFO L168 Benchmark]: Witness Printer took 130.47 ms. Allocated memory is still 1.2 GB. Free memory was 900.9 MB in the beginning and 892.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:44,108 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.27 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.36 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 774.95 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4106.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.0 GB in the beginning and 900.9 MB in the end (delta: 148.4 MB). Peak memory consumption was 252.4 MB. Max. memory is 11.5 GB. * Witness Printer took 130.47 ms. Allocated memory is still 1.2 GB. Free memory was 900.9 MB in the beginning and 892.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((1 == systemActive && 0 == tmp) && \result <= 1) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && !(pumpRunning == 0)) && 0 == splverifierCounter) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 898]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((0 == tmp && 1 == systemActive && 0 == splverifierCounter) && !(pumpRunning == 0)) || ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((((0 == tmp && 1 == systemActive) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 0 && 0 == tmp) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((1 == systemActive && 0 == tmp) && !(\result == 0)) && !(pumpRunning == 0)) && 0 == splverifierCounter - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive && 0 == splverifierCounter) && !(pumpRunning == 0)) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) && !(pumpRunning == 0)) || ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, HoareTripleCheckerStatistics: 751 SDtfs, 863 SDslu, 1100 SDs, 0 SdLazy, 178 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 595 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 94 NumberOfFragments, 348 HoareAnnotationTreeSize, 33 FomulaSimplifications, 23600 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 33 FomulaSimplificationsInter, 5002 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 13265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...