./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.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 a85198d3f93b8c751f2c6e712deab62f97c1022f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/ssh/s3_srvr.blast.04.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a85198d3f93b8c751f2c6e712deab62f97c1022f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:51:55,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:51:55,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:51:55,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:51:55,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:51:55,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:51:55,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:51:55,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:51:55,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:51:55,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:51:55,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:51:55,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:51:55,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:51:55,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:51:55,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:51:55,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:51:55,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:51:55,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:51:55,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:51:55,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:51:55,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:51:55,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:51:55,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:51:55,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:51:55,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:51:55,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:51:55,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:51:55,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:51:55,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:51:55,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:51:55,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:51:55,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:51:55,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:51:55,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:51:55,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:51:55,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:51:55,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:51:55,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:51:55,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:51:55,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:51:55,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:51:55,072 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:51:55,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:51:55,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:51:55,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:51:55,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:51:55,088 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:51:55,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:51:55,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:51:55,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:51:55,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:51:55,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:51:55,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:51:55,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:51:55,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:51:55,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:51:55,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:51:55,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:51:55,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:51:55,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:51:55,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:51:55,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:51:55,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:51:55,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:51:55,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:51:55,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:51:55,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:51:55,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:51:55,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:51:55,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:51:55,093 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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-19 20:51:55,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:51:55,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:51:55,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:51:55,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:51:55,447 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:51:55,448 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 20:51:55,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74cbefae/75f3c2985f4744208c22f2e75f3784a4/FLAG6e82434bb [2019-11-19 20:51:56,046 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:51:56,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 20:51:56,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74cbefae/75f3c2985f4744208c22f2e75f3784a4/FLAG6e82434bb [2019-11-19 20:51:56,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74cbefae/75f3c2985f4744208c22f2e75f3784a4 [2019-11-19 20:51:56,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:51:56,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:51:56,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:51:56,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:51:56,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:51:56,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:56" (1/1) ... [2019-11-19 20:51:56,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b15ed6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:56, skipping insertion in model container [2019-11-19 20:51:56,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:56" (1/1) ... [2019-11-19 20:51:56,271 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:51:56,335 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:51:56,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:51:56,891 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:51:57,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:51:57,097 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:51:57,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57 WrapperNode [2019-11-19 20:51:57,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:51:57,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:51:57,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:51:57,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:51:57,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:51:57,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:51:57,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:51:57,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:51:57,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (1/1) ... [2019-11-19 20:51:57,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:51:57,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:51:57,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:51:57,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:51:57,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (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 20:51:57,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 20:51:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 20:51:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 20:51:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 20:51:57,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 20:51:57,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 20:51:57,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:51:57,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:51:57,870 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 20:51:58,966 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 20:51:58,969 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 20:51:58,970 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:51:58,971 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:51:58,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:58 BoogieIcfgContainer [2019-11-19 20:51:58,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:51:58,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:51:58,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:51:58,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:51:58,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:51:56" (1/3) ... [2019-11-19 20:51:58,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43383112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:58, skipping insertion in model container [2019-11-19 20:51:58,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:57" (2/3) ... [2019-11-19 20:51:58,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43383112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:58, skipping insertion in model container [2019-11-19 20:51:58,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:58" (3/3) ... [2019-11-19 20:51:58,982 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-19 20:51:58,993 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:51:59,002 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:51:59,015 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:51:59,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:51:59,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:51:59,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:51:59,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:51:59,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:51:59,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:51:59,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:51:59,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:51:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-19 20:51:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 20:51:59,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:59,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:51:59,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-19 20:51:59,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:59,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367006294] [2019-11-19 20:51:59,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:59,528 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 20:51:59,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367006294] [2019-11-19 20:51:59,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:59,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:51:59,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553562577] [2019-11-19 20:51:59,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:51:59,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:51:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:51:59,556 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-19 20:52:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:00,112 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-19 20:52:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:00,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 20:52:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:00,141 INFO L225 Difference]: With dead ends: 313 [2019-11-19 20:52:00,141 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 20:52:00,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 20:52:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-19 20:52:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-19 20:52:00,223 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-19 20:52:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:00,224 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-19 20:52:00,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-19 20:52:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 20:52:00,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:00,233 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:00,234 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-19 20:52:00,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:00,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082206204] [2019-11-19 20:52:00,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:00,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082206204] [2019-11-19 20:52:00,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:00,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:00,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361098170] [2019-11-19 20:52:00,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:00,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:00,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:00,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:00,445 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-19 20:52:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:00,865 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-19 20:52:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:00,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 20:52:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:00,867 INFO L225 Difference]: With dead ends: 280 [2019-11-19 20:52:00,868 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 20:52:00,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 20:52:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-19 20:52:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-19 20:52:00,881 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-19 20:52:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:00,881 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-19 20:52:00,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-19 20:52:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 20:52:00,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:00,884 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:00,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-19 20:52:00,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:00,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845771064] [2019-11-19 20:52:00,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:00,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845771064] [2019-11-19 20:52:00,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:00,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:00,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325066237] [2019-11-19 20:52:00,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:00,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:00,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:00,989 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-19 20:52:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:01,344 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-19 20:52:01,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:01,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 20:52:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:01,348 INFO L225 Difference]: With dead ends: 279 [2019-11-19 20:52:01,348 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 20:52:01,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 20:52:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-19 20:52:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-19 20:52:01,359 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-19 20:52:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:01,360 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-19 20:52:01,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-19 20:52:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 20:52:01,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:01,362 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:01,362 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-19 20:52:01,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:01,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608815854] [2019-11-19 20:52:01,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:01,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608815854] [2019-11-19 20:52:01,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:01,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:01,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483542514] [2019-11-19 20:52:01,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:01,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:01,438 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-19 20:52:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:01,816 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-19 20:52:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:01,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 20:52:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:01,818 INFO L225 Difference]: With dead ends: 277 [2019-11-19 20:52:01,818 INFO L226 Difference]: Without dead ends: 155 [2019-11-19 20:52:01,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-19 20:52:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-19 20:52:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-19 20:52:01,836 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-19 20:52:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:01,836 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-19 20:52:01,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-19 20:52:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 20:52:01,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:01,840 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:01,840 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:01,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-19 20:52:01,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:01,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189225082] [2019-11-19 20:52:01,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:01,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189225082] [2019-11-19 20:52:01,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:01,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:01,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918577601] [2019-11-19 20:52:01,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:01,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:01,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:01,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:01,942 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-19 20:52:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:02,236 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-19 20:52:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:02,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 20:52:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:02,238 INFO L225 Difference]: With dead ends: 276 [2019-11-19 20:52:02,238 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 20:52:02,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 20:52:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 20:52:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-19 20:52:02,256 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-19 20:52:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:02,256 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-19 20:52:02,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-19 20:52:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 20:52:02,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:02,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:02,260 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:02,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-19 20:52:02,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:02,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939034143] [2019-11-19 20:52:02,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:02,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939034143] [2019-11-19 20:52:02,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719641613] [2019-11-19 20:52:02,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:02,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:02,346 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-19 20:52:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:02,635 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-19 20:52:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:02,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 20:52:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:02,637 INFO L225 Difference]: With dead ends: 276 [2019-11-19 20:52:02,637 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 20:52:02,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 20:52:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 20:52:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-19 20:52:02,644 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-19 20:52:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:02,645 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-19 20:52:02,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-19 20:52:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 20:52:02,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:02,646 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:02,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-19 20:52:02,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:02,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117858510] [2019-11-19 20:52:02,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:02,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117858510] [2019-11-19 20:52:02,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:02,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:02,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848250329] [2019-11-19 20:52:02,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:02,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:02,706 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-19 20:52:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:02,954 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-19 20:52:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:02,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-19 20:52:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:02,956 INFO L225 Difference]: With dead ends: 276 [2019-11-19 20:52:02,956 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 20:52:02,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 20:52:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 20:52:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-19 20:52:02,962 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-19 20:52:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:02,963 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-19 20:52:02,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-19 20:52:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-19 20:52:02,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:02,964 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:02,965 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-19 20:52:02,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:02,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122725855] [2019-11-19 20:52:02,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:03,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122725855] [2019-11-19 20:52:03,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:03,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:03,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560898270] [2019-11-19 20:52:03,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:03,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:03,015 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-19 20:52:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:03,269 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-19 20:52:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:03,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-19 20:52:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:03,270 INFO L225 Difference]: With dead ends: 276 [2019-11-19 20:52:03,270 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 20:52:03,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 20:52:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 20:52:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-19 20:52:03,274 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-19 20:52:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:03,275 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-19 20:52:03,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-19 20:52:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 20:52:03,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:03,276 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:03,276 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-19 20:52:03,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:03,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741999805] [2019-11-19 20:52:03,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:03,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741999805] [2019-11-19 20:52:03,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:03,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:03,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579753456] [2019-11-19 20:52:03,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:03,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:03,344 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-19 20:52:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:03,589 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-19 20:52:03,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:03,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 20:52:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:03,590 INFO L225 Difference]: With dead ends: 266 [2019-11-19 20:52:03,591 INFO L226 Difference]: Without dead ends: 144 [2019-11-19 20:52:03,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-19 20:52:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-19 20:52:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 20:52:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-19 20:52:03,596 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-19 20:52:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:03,596 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-19 20:52:03,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-19 20:52:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 20:52:03,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:03,597 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:03,598 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:03,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-19 20:52:03,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:03,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673147989] [2019-11-19 20:52:03,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:03,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673147989] [2019-11-19 20:52:03,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:03,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:03,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986580358] [2019-11-19 20:52:03,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:03,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:03,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:03,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:03,661 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-19 20:52:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:03,968 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-19 20:52:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:03,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 20:52:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:03,970 INFO L225 Difference]: With dead ends: 306 [2019-11-19 20:52:03,970 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 20:52:03,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 20:52:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-19 20:52:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-19 20:52:03,977 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-19 20:52:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:03,977 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-19 20:52:03,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-19 20:52:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 20:52:03,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:03,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:03,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-19 20:52:03,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:03,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361869029] [2019-11-19 20:52:03,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:04,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361869029] [2019-11-19 20:52:04,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:04,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:04,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6624734] [2019-11-19 20:52:04,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:04,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:04,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:04,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:04,028 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-19 20:52:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:04,362 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-19 20:52:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:04,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-19 20:52:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:04,364 INFO L225 Difference]: With dead ends: 328 [2019-11-19 20:52:04,364 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 20:52:04,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 20:52:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-19 20:52:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-19 20:52:04,372 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-19 20:52:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:04,372 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-19 20:52:04,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-19 20:52:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 20:52:04,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:04,374 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:04,374 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-19 20:52:04,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:04,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140006401] [2019-11-19 20:52:04,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:04,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140006401] [2019-11-19 20:52:04,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:04,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:04,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996200837] [2019-11-19 20:52:04,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:04,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:04,428 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-19 20:52:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:04,761 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-19 20:52:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:04,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 20:52:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:04,764 INFO L225 Difference]: With dead ends: 327 [2019-11-19 20:52:04,764 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 20:52:04,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 20:52:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-19 20:52:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-19 20:52:04,774 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-19 20:52:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:04,774 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-19 20:52:04,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-19 20:52:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 20:52:04,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:04,777 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:04,778 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-19 20:52:04,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:04,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305799766] [2019-11-19 20:52:04,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:04,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305799766] [2019-11-19 20:52:04,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:04,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:04,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634739227] [2019-11-19 20:52:04,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:04,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:04,884 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-19 20:52:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:05,192 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-19 20:52:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:05,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 20:52:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:05,195 INFO L225 Difference]: With dead ends: 325 [2019-11-19 20:52:05,195 INFO L226 Difference]: Without dead ends: 181 [2019-11-19 20:52:05,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-19 20:52:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-19 20:52:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-19 20:52:05,201 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-19 20:52:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:05,202 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-19 20:52:05,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-19 20:52:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 20:52:05,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:05,203 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:05,203 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:05,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:05,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-19 20:52:05,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:05,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343852900] [2019-11-19 20:52:05,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:05,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343852900] [2019-11-19 20:52:05,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:05,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:05,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250613327] [2019-11-19 20:52:05,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:05,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:05,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:05,258 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-19 20:52:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:05,532 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-19 20:52:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:05,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 20:52:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:05,534 INFO L225 Difference]: With dead ends: 324 [2019-11-19 20:52:05,534 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 20:52:05,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 20:52:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 20:52:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-19 20:52:05,542 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-19 20:52:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:05,543 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-19 20:52:05,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-19 20:52:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 20:52:05,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:05,544 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:05,545 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-19 20:52:05,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:05,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964580066] [2019-11-19 20:52:05,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:05,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964580066] [2019-11-19 20:52:05,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:05,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:05,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131125678] [2019-11-19 20:52:05,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:05,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:05,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:05,596 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-19 20:52:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:05,893 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-19 20:52:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:05,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 20:52:05,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:05,895 INFO L225 Difference]: With dead ends: 324 [2019-11-19 20:52:05,896 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 20:52:05,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 20:52:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 20:52:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-19 20:52:05,907 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-19 20:52:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:05,907 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-19 20:52:05,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-19 20:52:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 20:52:05,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:05,909 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:05,909 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-19 20:52:05,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:05,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901345154] [2019-11-19 20:52:05,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:05,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901345154] [2019-11-19 20:52:05,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:05,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:05,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906932295] [2019-11-19 20:52:05,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:05,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:05,969 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-19 20:52:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:06,277 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-19 20:52:06,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:06,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-19 20:52:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:06,279 INFO L225 Difference]: With dead ends: 324 [2019-11-19 20:52:06,279 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 20:52:06,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 20:52:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 20:52:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-19 20:52:06,285 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-19 20:52:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:06,286 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-19 20:52:06,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-19 20:52:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 20:52:06,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:06,287 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:06,287 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-19 20:52:06,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:06,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516021970] [2019-11-19 20:52:06,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:06,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516021970] [2019-11-19 20:52:06,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:06,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:06,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612173844] [2019-11-19 20:52:06,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:06,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:06,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:06,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:06,333 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-19 20:52:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:06,619 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-19 20:52:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:06,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-19 20:52:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:06,623 INFO L225 Difference]: With dead ends: 324 [2019-11-19 20:52:06,623 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 20:52:06,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 20:52:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 20:52:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-19 20:52:06,630 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-19 20:52:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:06,630 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-19 20:52:06,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-19 20:52:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-19 20:52:06,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:06,632 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:06,632 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-19 20:52:06,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:06,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110228860] [2019-11-19 20:52:06,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:06,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110228860] [2019-11-19 20:52:06,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:06,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:06,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764857445] [2019-11-19 20:52:06,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:06,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:06,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:06,693 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-19 20:52:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:07,007 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-19 20:52:07,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:07,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-19 20:52:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:07,009 INFO L225 Difference]: With dead ends: 314 [2019-11-19 20:52:07,009 INFO L226 Difference]: Without dead ends: 170 [2019-11-19 20:52:07,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:52:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-19 20:52:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-19 20:52:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 20:52:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-19 20:52:07,015 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-19 20:52:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:07,015 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-19 20:52:07,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-19 20:52:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 20:52:07,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:07,017 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:07,017 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:07,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-11-19 20:52:07,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:07,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207075205] [2019-11-19 20:52:07,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:07,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207075205] [2019-11-19 20:52:07,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:07,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:07,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33534617] [2019-11-19 20:52:07,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:07,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:07,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:07,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:07,129 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-19 20:52:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:07,545 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-11-19 20:52:07,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:07,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 20:52:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:07,548 INFO L225 Difference]: With dead ends: 402 [2019-11-19 20:52:07,548 INFO L226 Difference]: Without dead ends: 258 [2019-11-19 20:52:07,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-19 20:52:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-11-19 20:52:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-19 20:52:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-19 20:52:07,555 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-19 20:52:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:07,556 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-19 20:52:07,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-19 20:52:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 20:52:07,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:07,557 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:07,557 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-11-19 20:52:07,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:07,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653352990] [2019-11-19 20:52:07,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:07,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653352990] [2019-11-19 20:52:07,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:07,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:07,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850741890] [2019-11-19 20:52:07,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:07,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:07,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:07,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:07,621 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-19 20:52:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:08,000 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-19 20:52:08,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:08,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 20:52:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:08,004 INFO L225 Difference]: With dead ends: 442 [2019-11-19 20:52:08,004 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 20:52:08,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 20:52:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-19 20:52:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 20:52:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-19 20:52:08,016 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-19 20:52:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:08,016 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-19 20:52:08,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-19 20:52:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 20:52:08,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:08,018 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:08,019 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-11-19 20:52:08,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:08,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667162418] [2019-11-19 20:52:08,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:08,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667162418] [2019-11-19 20:52:08,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:08,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:08,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734449041] [2019-11-19 20:52:08,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:08,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:08,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:08,133 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-19 20:52:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:08,632 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-11-19 20:52:08,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:08,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 20:52:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:08,635 INFO L225 Difference]: With dead ends: 493 [2019-11-19 20:52:08,635 INFO L226 Difference]: Without dead ends: 282 [2019-11-19 20:52:08,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-19 20:52:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-19 20:52:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 20:52:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-19 20:52:08,642 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-19 20:52:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:08,643 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-19 20:52:08,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-19 20:52:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 20:52:08,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:08,645 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:08,645 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-11-19 20:52:08,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:08,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83346484] [2019-11-19 20:52:08,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:08,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83346484] [2019-11-19 20:52:08,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:08,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:08,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735075060] [2019-11-19 20:52:08,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:08,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:08,781 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-19 20:52:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:09,248 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-19 20:52:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:09,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 20:52:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:09,254 INFO L225 Difference]: With dead ends: 466 [2019-11-19 20:52:09,254 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 20:52:09,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 20:52:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-19 20:52:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 20:52:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-19 20:52:09,265 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-19 20:52:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:09,266 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-19 20:52:09,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-19 20:52:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:52:09,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:09,269 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:09,269 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-11-19 20:52:09,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:09,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325022826] [2019-11-19 20:52:09,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:09,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325022826] [2019-11-19 20:52:09,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:09,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:09,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757095927] [2019-11-19 20:52:09,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:09,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:09,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:09,371 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-19 20:52:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:09,970 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-19 20:52:09,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:09,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 20:52:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:09,974 INFO L225 Difference]: With dead ends: 492 [2019-11-19 20:52:09,974 INFO L226 Difference]: Without dead ends: 281 [2019-11-19 20:52:09,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-19 20:52:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-11-19 20:52:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 20:52:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-19 20:52:09,985 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-19 20:52:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:09,986 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-19 20:52:09,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-19 20:52:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:52:09,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:09,989 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:09,989 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-11-19 20:52:09,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:09,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679561102] [2019-11-19 20:52:09,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:10,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679561102] [2019-11-19 20:52:10,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:10,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:10,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303643440] [2019-11-19 20:52:10,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:10,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:10,106 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-19 20:52:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:10,703 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-11-19 20:52:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:10,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 20:52:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:10,706 INFO L225 Difference]: With dead ends: 490 [2019-11-19 20:52:10,707 INFO L226 Difference]: Without dead ends: 279 [2019-11-19 20:52:10,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-19 20:52:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-19 20:52:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 20:52:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-19 20:52:10,720 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-19 20:52:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:10,721 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-19 20:52:10,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-19 20:52:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:52:10,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:10,724 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:10,724 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:10,725 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-11-19 20:52:10,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:10,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031062563] [2019-11-19 20:52:10,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:10,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031062563] [2019-11-19 20:52:10,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:10,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:10,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617088345] [2019-11-19 20:52:10,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:10,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:10,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:10,825 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-19 20:52:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:11,342 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-11-19 20:52:11,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:11,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 20:52:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:11,344 INFO L225 Difference]: With dead ends: 489 [2019-11-19 20:52:11,344 INFO L226 Difference]: Without dead ends: 278 [2019-11-19 20:52:11,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-19 20:52:11,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-11-19 20:52:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 20:52:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-19 20:52:11,352 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-19 20:52:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:11,352 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-19 20:52:11,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-19 20:52:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:52:11,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:11,354 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:11,354 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-11-19 20:52:11,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:11,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960649352] [2019-11-19 20:52:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 20:52:11,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960649352] [2019-11-19 20:52:11,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:11,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 20:52:11,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768784579] [2019-11-19 20:52:11,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:52:11,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:52:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:52:11,457 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-19 20:52:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:12,008 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-19 20:52:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 20:52:12,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-19 20:52:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:12,010 INFO L225 Difference]: With dead ends: 462 [2019-11-19 20:52:12,011 INFO L226 Difference]: Without dead ends: 251 [2019-11-19 20:52:12,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:52:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-19 20:52:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-19 20:52:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-19 20:52:12,019 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-19 20:52:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:12,019 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-19 20:52:12,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:52:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-19 20:52:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:52:12,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:12,021 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:12,021 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-11-19 20:52:12,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:12,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976927192] [2019-11-19 20:52:12,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:12,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976927192] [2019-11-19 20:52:12,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:12,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:12,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655894421] [2019-11-19 20:52:12,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:12,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:12,110 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-19 20:52:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:12,483 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-19 20:52:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:12,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 20:52:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:12,486 INFO L225 Difference]: With dead ends: 503 [2019-11-19 20:52:12,486 INFO L226 Difference]: Without dead ends: 272 [2019-11-19 20:52:12,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-19 20:52:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-19 20:52:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-19 20:52:12,506 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-19 20:52:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:12,506 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-19 20:52:12,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-19 20:52:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:52:12,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:12,509 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:12,509 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-11-19 20:52:12,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:12,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743772528] [2019-11-19 20:52:12,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:12,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743772528] [2019-11-19 20:52:12,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:12,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:12,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230094051] [2019-11-19 20:52:12,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:12,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:12,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:12,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:12,589 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-19 20:52:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:12,965 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-19 20:52:12,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:12,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 20:52:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:12,968 INFO L225 Difference]: With dead ends: 502 [2019-11-19 20:52:12,968 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 20:52:12,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 20:52:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 20:52:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-19 20:52:12,976 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-19 20:52:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:12,976 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-19 20:52:12,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-19 20:52:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 20:52:12,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:12,978 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:12,978 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-11-19 20:52:12,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:12,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380436461] [2019-11-19 20:52:12,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:13,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380436461] [2019-11-19 20:52:13,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:13,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:13,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348179312] [2019-11-19 20:52:13,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:13,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:13,041 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-19 20:52:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:13,448 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-11-19 20:52:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:13,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 20:52:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:13,450 INFO L225 Difference]: With dead ends: 529 [2019-11-19 20:52:13,450 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 20:52:13,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 20:52:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 20:52:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-19 20:52:13,459 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-19 20:52:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:13,459 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-19 20:52:13,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-19 20:52:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 20:52:13,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:13,460 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:13,461 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-11-19 20:52:13,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:13,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611916432] [2019-11-19 20:52:13,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:13,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611916432] [2019-11-19 20:52:13,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:13,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:13,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995898081] [2019-11-19 20:52:13,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:13,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:13,510 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-19 20:52:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:13,807 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-19 20:52:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:13,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 20:52:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:13,811 INFO L225 Difference]: With dead ends: 502 [2019-11-19 20:52:13,811 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 20:52:13,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 20:52:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 20:52:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-19 20:52:13,820 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-19 20:52:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:13,820 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-19 20:52:13,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-19 20:52:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 20:52:13,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:13,822 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:13,822 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-11-19 20:52:13,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:13,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179132571] [2019-11-19 20:52:13,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:13,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179132571] [2019-11-19 20:52:13,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:13,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:13,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678896191] [2019-11-19 20:52:13,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:13,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:13,886 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-19 20:52:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:14,313 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-11-19 20:52:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:14,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 20:52:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:14,316 INFO L225 Difference]: With dead ends: 529 [2019-11-19 20:52:14,316 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 20:52:14,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:14,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 20:52:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 20:52:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-19 20:52:14,326 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-19 20:52:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:14,326 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-19 20:52:14,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-19 20:52:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 20:52:14,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:14,328 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:14,328 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-11-19 20:52:14,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:14,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897795972] [2019-11-19 20:52:14,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:14,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897795972] [2019-11-19 20:52:14,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:14,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:14,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507776246] [2019-11-19 20:52:14,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:14,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:14,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:14,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:14,384 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-19 20:52:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:14,715 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-19 20:52:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:14,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 20:52:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:14,717 INFO L225 Difference]: With dead ends: 502 [2019-11-19 20:52:14,717 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 20:52:14,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 20:52:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 20:52:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-19 20:52:14,724 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-19 20:52:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:14,724 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-19 20:52:14,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-19 20:52:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 20:52:14,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:14,725 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:14,725 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-11-19 20:52:14,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:14,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948356534] [2019-11-19 20:52:14,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:14,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948356534] [2019-11-19 20:52:14,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:14,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:14,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862387239] [2019-11-19 20:52:14,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:14,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:14,784 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-19 20:52:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:15,212 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-11-19 20:52:15,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:15,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 20:52:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:15,215 INFO L225 Difference]: With dead ends: 529 [2019-11-19 20:52:15,215 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 20:52:15,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 20:52:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 20:52:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-19 20:52:15,223 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-19 20:52:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:15,223 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-19 20:52:15,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-19 20:52:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 20:52:15,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:15,225 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:15,225 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-11-19 20:52:15,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:15,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371243999] [2019-11-19 20:52:15,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:15,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371243999] [2019-11-19 20:52:15,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:15,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:15,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354018170] [2019-11-19 20:52:15,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:15,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:15,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:15,281 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-19 20:52:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:15,613 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-19 20:52:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:15,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 20:52:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:15,619 INFO L225 Difference]: With dead ends: 502 [2019-11-19 20:52:15,619 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 20:52:15,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 20:52:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 20:52:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-19 20:52:15,626 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-19 20:52:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:15,626 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-19 20:52:15,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-19 20:52:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 20:52:15,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:15,627 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:15,627 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-11-19 20:52:15,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:15,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557291268] [2019-11-19 20:52:15,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:15,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557291268] [2019-11-19 20:52:15,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:15,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:15,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429109821] [2019-11-19 20:52:15,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:15,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:15,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:15,692 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-19 20:52:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:16,120 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-11-19 20:52:16,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:16,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 20:52:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:16,123 INFO L225 Difference]: With dead ends: 519 [2019-11-19 20:52:16,124 INFO L226 Difference]: Without dead ends: 288 [2019-11-19 20:52:16,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-19 20:52:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-19 20:52:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-19 20:52:16,133 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-19 20:52:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:16,133 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-19 20:52:16,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-19 20:52:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 20:52:16,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:16,135 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:16,135 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-11-19 20:52:16,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:16,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408961690] [2019-11-19 20:52:16,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:16,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408961690] [2019-11-19 20:52:16,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:16,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:16,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740863374] [2019-11-19 20:52:16,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:16,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:16,218 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-19 20:52:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:16,511 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-19 20:52:16,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:16,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 20:52:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:16,514 INFO L225 Difference]: With dead ends: 492 [2019-11-19 20:52:16,514 INFO L226 Difference]: Without dead ends: 261 [2019-11-19 20:52:16,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-19 20:52:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-19 20:52:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-19 20:52:16,523 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-19 20:52:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:16,523 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-19 20:52:16,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-19 20:52:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 20:52:16,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:16,524 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:16,524 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-11-19 20:52:16,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:16,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886789493] [2019-11-19 20:52:16,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 20:52:16,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886789493] [2019-11-19 20:52:16,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:16,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:16,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575035798] [2019-11-19 20:52:16,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:16,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:16,589 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-19 20:52:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:17,025 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-11-19 20:52:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:17,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-19 20:52:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:17,028 INFO L225 Difference]: With dead ends: 519 [2019-11-19 20:52:17,028 INFO L226 Difference]: Without dead ends: 288 [2019-11-19 20:52:17,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:52:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-19 20:52:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-19 20:52:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 20:52:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-19 20:52:17,036 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-19 20:52:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:17,036 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-19 20:52:17,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-19 20:52:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 20:52:17,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:17,037 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:17,037 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:17,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-11-19 20:52:17,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:17,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163656049] [2019-11-19 20:52:17,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 20:52:17,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163656049] [2019-11-19 20:52:17,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:17,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:17,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841333687] [2019-11-19 20:52:17,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:17,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:17,103 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-19 20:52:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:17,153 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-19 20:52:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:17,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 20:52:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:17,156 INFO L225 Difference]: With dead ends: 710 [2019-11-19 20:52:17,156 INFO L226 Difference]: Without dead ends: 479 [2019-11-19 20:52:17,157 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 20:52:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-19 20:52:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-19 20:52:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-19 20:52:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-19 20:52:17,170 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-19 20:52:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:17,170 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-19 20:52:17,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-19 20:52:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 20:52:17,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:17,172 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:17,172 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-19 20:52:17,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:17,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427955507] [2019-11-19 20:52:17,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:52:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:52:17,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:52:17,484 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 20:52:17,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:52:17 BoogieIcfgContainer [2019-11-19 20:52:17,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:52:17,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:52:17,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:52:17,662 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:52:17,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:58" (3/4) ... [2019-11-19 20:52:17,671 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 20:52:17,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:52:17,678 INFO L168 Benchmark]: Toolchain (without parser) took 21420.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 198.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:17,678 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:52:17,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:17,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:17,679 INFO L168 Benchmark]: Boogie Preprocessor took 71.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:17,680 INFO L168 Benchmark]: RCFGBuilder took 1681.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:17,680 INFO L168 Benchmark]: TraceAbstraction took 18687.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 255.3 MB). Free memory was 976.6 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 119.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:17,680 INFO L168 Benchmark]: Witness Printer took 9.18 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:52:17,682 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 842.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 119.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1681.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18687.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 255.3 MB). Free memory was 976.6 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 119.8 MB. Max. memory is 11.5 GB. * Witness Printer took 9.18 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={9:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 18.6s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 10603 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 20:52:19,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:52:19,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:52:19,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:52:19,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:52:19,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:52:19,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:52:19,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:52:19,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:52:19,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:52:19,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:52:19,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:52:19,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:52:19,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:52:19,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:52:19,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:52:19,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:52:19,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:52:19,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:52:19,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:52:19,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:52:19,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:52:19,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:52:19,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:52:19,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:52:19,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:52:19,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:52:19,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:52:19,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:52:19,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:52:19,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:52:19,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:52:19,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:52:19,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:52:19,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:52:19,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:52:19,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:52:19,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:52:19,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:52:19,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:52:19,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:52:19,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 20:52:19,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:52:19,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:52:19,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:52:19,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:52:19,642 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:52:19,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:52:19,643 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:52:19,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:52:19,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:52:19,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:52:19,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:52:19,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:52:19,647 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 20:52:19,648 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 20:52:19,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:52:19,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:52:19,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:52:19,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:52:19,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:52:19,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:52:19,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:52:19,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:52:19,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:52:19,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:52:19,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:52:19,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:52:19,652 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 20:52:19,653 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 20:52:19,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:52:19,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 20:52:19,654 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-19 20:52:19,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:52:19,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:52:19,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:52:19,996 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:52:19,997 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:52:19,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 20:52:20,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038e6aef3/2c62fccc2b7342979a96bf98ab56df98/FLAGecddcd528 [2019-11-19 20:52:20,683 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:52:20,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 20:52:20,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038e6aef3/2c62fccc2b7342979a96bf98ab56df98/FLAGecddcd528 [2019-11-19 20:52:20,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038e6aef3/2c62fccc2b7342979a96bf98ab56df98 [2019-11-19 20:52:20,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:52:20,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:52:20,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:20,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:52:20,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:52:20,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:20" (1/1) ... [2019-11-19 20:52:20,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3873c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:20, skipping insertion in model container [2019-11-19 20:52:20,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:20" (1/1) ... [2019-11-19 20:52:20,963 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:52:21,042 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:52:21,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:21,605 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:52:21,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:21,753 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:52:21,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21 WrapperNode [2019-11-19 20:52:21,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:21,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:21,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:52:21,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:52:21,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:21,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:52:21,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:52:21,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:52:21,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (1/1) ... [2019-11-19 20:52:21,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:52:21,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:52:21,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:52:21,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:52:21,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (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 20:52:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 20:52:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 20:52:22,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 20:52:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 20:52:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 20:52:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:52:22,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:52:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 20:52:22,381 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 20:52:25,624 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 20:52:25,625 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 20:52:25,626 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:52:25,627 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:52:25,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:25 BoogieIcfgContainer [2019-11-19 20:52:25,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:52:25,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:52:25,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:52:25,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:52:25,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:52:20" (1/3) ... [2019-11-19 20:52:25,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30608ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:25, skipping insertion in model container [2019-11-19 20:52:25,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:21" (2/3) ... [2019-11-19 20:52:25,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30608ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:25, skipping insertion in model container [2019-11-19 20:52:25,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:25" (3/3) ... [2019-11-19 20:52:25,635 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-19 20:52:25,643 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:52:25,649 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:52:25,659 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:52:25,685 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:52:25,685 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:52:25,685 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:52:25,685 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:52:25,686 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:52:25,686 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:52:25,686 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:52:25,686 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:52:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-19 20:52:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 20:52:25,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:25,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:25,716 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-19 20:52:25,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 20:52:25,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2137391875] [2019-11-19 20:52:25,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 20:52:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:26,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:52:26,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:52:26,059 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 20:52:26,059 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 20:52:26,086 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 20:52:26,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2137391875] [2019-11-19 20:52:26,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:26,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 20:52:26,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063651520] [2019-11-19 20:52:26,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:26,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 20:52:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:26,113 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-19 20:52:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:26,327 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-11-19 20:52:26,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:26,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 20:52:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:26,356 INFO L225 Difference]: With dead ends: 540 [2019-11-19 20:52:26,356 INFO L226 Difference]: Without dead ends: 366 [2019-11-19 20:52:26,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-19 20:52:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-11-19 20:52:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-19 20:52:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-11-19 20:52:26,455 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-11-19 20:52:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:26,456 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-11-19 20:52:26,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-11-19 20:52:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 20:52:26,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:26,462 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:26,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 20:52:26,666 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2019-11-19 20:52:26,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 20:52:26,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1236214788] [2019-11-19 20:52:26,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 20:52:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:26,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:52:26,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:52:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:26,966 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 20:52:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:27,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1236214788] [2019-11-19 20:52:27,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:27,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 20:52:27,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748730901] [2019-11-19 20:52:27,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:27,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 20:52:27,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:27,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:27,028 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2019-11-19 20:52:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:27,271 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2019-11-19 20:52:27,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:27,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-19 20:52:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:27,275 INFO L225 Difference]: With dead ends: 839 [2019-11-19 20:52:27,275 INFO L226 Difference]: Without dead ends: 600 [2019-11-19 20:52:27,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-19 20:52:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-11-19 20:52:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-19 20:52:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-19 20:52:27,319 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2019-11-19 20:52:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:27,320 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-19 20:52:27,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-19 20:52:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 20:52:27,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:27,324 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:27,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 20:52:27,533 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-19 20:52:27,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 20:52:27,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [756660206] [2019-11-19 20:52:27,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 20:52:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:52:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:52:29,992 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 20:52:29,992 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 20:52:30,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 20:52:30,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:52:30 BoogieIcfgContainer [2019-11-19 20:52:30,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:52:30,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:52:30,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:52:30,385 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:52:30,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:25" (3/4) ... [2019-11-19 20:52:30,389 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 20:52:30,565 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:52:30,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:52:30,568 INFO L168 Benchmark]: Toolchain (without parser) took 9623.99 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 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:30,568 INFO L168 Benchmark]: CDTParser took 0.19 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 20:52:30,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:30,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.58 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 20:52:30,569 INFO L168 Benchmark]: Boogie Preprocessor took 78.62 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 20:52:30,570 INFO L168 Benchmark]: RCFGBuilder took 3691.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.7 MB in the end (delta: 91.4 MB). Peak memory consumption was 91.4 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:30,570 INFO L168 Benchmark]: TraceAbstraction took 4753.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 997.7 MB in the beginning and 1.1 GB in the end (delta: -137.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:52:30,570 INFO L168 Benchmark]: Witness Printer took 182.43 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: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:30,572 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.19 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 807.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.58 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 78.62 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. * RCFGBuilder took 3691.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.7 MB in the end (delta: 91.4 MB). Peak memory consumption was 91.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4753.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 997.7 MB in the beginning and 1.1 GB in the end (delta: -137.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 182.43 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: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={2147483645:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={2147483645:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={2147483645:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2147483645:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.6s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...