./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/bitvector/s3_clnt_2.BV.c.cil-2a.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/bitvector/s3_clnt_2.BV.c.cil-2a.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-25 19:35:29,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:35:29,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:35:29,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:35:29,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:35:29,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:35:29,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:35:29,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:35:29,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:35:29,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:35:29,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:35:29,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:35:29,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:35:29,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:35:29,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:35:29,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:35:29,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:35:29,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:35:29,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:35:29,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:35:29,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:35:29,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:35:29,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:35:29,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:35:29,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:35:29,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:35:29,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:35:29,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:35:29,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:35:29,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:35:29,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:35:29,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:35:29,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:35:29,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:35:29,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:35:29,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:35:29,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:35:29,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:35:29,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:35:29,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:35:29,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:35:29,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:35:29,332 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:35:29,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:35:29,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:35:29,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:35:29,339 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:35:29,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:35:29,339 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:35:29,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:35:29,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:35:29,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:35:29,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:35:29,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:35:29,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:35:29,342 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:35:29,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:35:29,343 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:35:29,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:35:29,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:35:29,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:35:29,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:35:29,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:35:29,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:35:29,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:35:29,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:35:29,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:35:29,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:35:29,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:35:29,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:35:29,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:35:29,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 [2020-10-25 19:35:29,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:35:29,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:35:29,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:35:29,862 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:35:29,863 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:35:29,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2020-10-25 19:35:29,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ba06f63/632067ccba994de68093d3ac7a75ec63/FLAG5867c2e58 [2020-10-25 19:35:30,594 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:35:30,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2020-10-25 19:35:30,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ba06f63/632067ccba994de68093d3ac7a75ec63/FLAG5867c2e58 [2020-10-25 19:35:30,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ba06f63/632067ccba994de68093d3ac7a75ec63 [2020-10-25 19:35:30,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:35:30,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:35:30,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:30,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:35:30,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:35:30,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:30" (1/1) ... [2020-10-25 19:35:30,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7519d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:30, skipping insertion in model container [2020-10-25 19:35:30,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:30" (1/1) ... [2020-10-25 19:35:30,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:35:31,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:35:31,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:31,427 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:35:31,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:31,578 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:35:31,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31 WrapperNode [2020-10-25 19:35:31,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:31,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:31,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:35:31,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:35:31,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:31,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:35:31,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:35:31,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:35:31,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (1/1) ... [2020-10-25 19:35:31,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:35:31,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:35:31,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:35:31,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:35:31,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (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 [2020-10-25 19:35:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:35:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:35:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:35:31,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:35:31,952 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:35:32,768 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2020-10-25 19:35:32,769 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2020-10-25 19:35:32,779 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:35:32,780 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:35:32,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:32 BoogieIcfgContainer [2020-10-25 19:35:32,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:35:32,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:35:32,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:35:32,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:35:32,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:35:30" (1/3) ... [2020-10-25 19:35:32,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef5dd74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:32, skipping insertion in model container [2020-10-25 19:35:32,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:31" (2/3) ... [2020-10-25 19:35:32,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef5dd74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:32, skipping insertion in model container [2020-10-25 19:35:32,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:32" (3/3) ... [2020-10-25 19:35:32,794 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2020-10-25 19:35:32,810 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:35:32,817 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:35:32,832 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:35:32,868 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:35:32,868 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:35:32,868 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:35:32,869 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:35:32,869 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:35:32,869 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:35:32,869 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:35:32,870 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:35:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-10-25 19:35:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:35:32,900 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:32,902 INFO L422 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] [2020-10-25 19:35:32,902 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:32,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2020-10-25 19:35:32,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:32,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037512394] [2020-10-25 19:35:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:33,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037512394] [2020-10-25 19:35:33,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:33,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:33,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296553231] [2020-10-25 19:35:33,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:33,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:33,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:33,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:33,201 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2020-10-25 19:35:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:33,429 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2020-10-25 19:35:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:33,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:35:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:33,446 INFO L225 Difference]: With dead ends: 247 [2020-10-25 19:35:33,446 INFO L226 Difference]: Without dead ends: 112 [2020-10-25 19:35:33,451 INFO L677 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 [2020-10-25 19:35:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-25 19:35:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-25 19:35:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-25 19:35:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2020-10-25 19:35:33,511 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2020-10-25 19:35:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:33,512 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2020-10-25 19:35:33,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2020-10-25 19:35:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 19:35:33,514 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:33,515 INFO L422 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] [2020-10-25 19:35:33,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:35:33,515 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2020-10-25 19:35:33,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:33,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938639930] [2020-10-25 19:35:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:33,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938639930] [2020-10-25 19:35:33,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:33,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:33,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483701669] [2020-10-25 19:35:33,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:33,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:33,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:33,678 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2020-10-25 19:35:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:33,867 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2020-10-25 19:35:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:33,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 19:35:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:33,870 INFO L225 Difference]: With dead ends: 233 [2020-10-25 19:35:33,870 INFO L226 Difference]: Without dead ends: 131 [2020-10-25 19:35:33,872 INFO L677 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 [2020-10-25 19:35:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-25 19:35:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2020-10-25 19:35:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-25 19:35:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2020-10-25 19:35:33,887 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2020-10-25 19:35:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:33,887 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2020-10-25 19:35:33,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2020-10-25 19:35:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 19:35:33,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:33,890 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 19:35:33,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:35:33,891 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2020-10-25 19:35:33,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:33,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093336320] [2020-10-25 19:35:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-25 19:35:34,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093336320] [2020-10-25 19:35:34,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:34,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:34,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64728396] [2020-10-25 19:35:34,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:34,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:34,039 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2020-10-25 19:35:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:34,208 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2020-10-25 19:35:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:34,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-25 19:35:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:34,211 INFO L225 Difference]: With dead ends: 265 [2020-10-25 19:35:34,211 INFO L226 Difference]: Without dead ends: 148 [2020-10-25 19:35:34,213 INFO L677 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 [2020-10-25 19:35:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-25 19:35:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2020-10-25 19:35:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-25 19:35:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2020-10-25 19:35:34,225 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2020-10-25 19:35:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:34,225 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2020-10-25 19:35:34,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2020-10-25 19:35:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-25 19:35:34,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:34,238 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-10-25 19:35:34,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:35:34,238 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2020-10-25 19:35:34,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:34,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637241202] [2020-10-25 19:35:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 19:35:34,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637241202] [2020-10-25 19:35:34,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:34,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:34,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512378038] [2020-10-25 19:35:34,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:34,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:34,337 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 3 states. [2020-10-25 19:35:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:34,568 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2020-10-25 19:35:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:34,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-10-25 19:35:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:34,570 INFO L225 Difference]: With dead ends: 328 [2020-10-25 19:35:34,571 INFO L226 Difference]: Without dead ends: 193 [2020-10-25 19:35:34,572 INFO L677 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 [2020-10-25 19:35:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-10-25 19:35:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2020-10-25 19:35:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-25 19:35:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2020-10-25 19:35:34,584 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2020-10-25 19:35:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:34,585 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2020-10-25 19:35:34,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2020-10-25 19:35:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-25 19:35:34,587 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:34,588 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-10-25 19:35:34,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:35:34,588 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1434615126, now seen corresponding path program 1 times [2020-10-25 19:35:34,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:34,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157993473] [2020-10-25 19:35:34,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 19:35:34,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157993473] [2020-10-25 19:35:34,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:34,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:34,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511964198] [2020-10-25 19:35:34,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:34,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:34,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:34,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:34,678 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand 3 states. [2020-10-25 19:35:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:34,845 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2020-10-25 19:35:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:34,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-10-25 19:35:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:34,848 INFO L225 Difference]: With dead ends: 383 [2020-10-25 19:35:34,849 INFO L226 Difference]: Without dead ends: 208 [2020-10-25 19:35:34,850 INFO L677 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 [2020-10-25 19:35:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-25 19:35:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2020-10-25 19:35:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-25 19:35:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2020-10-25 19:35:34,860 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2020-10-25 19:35:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:34,861 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2020-10-25 19:35:34,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2020-10-25 19:35:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-25 19:35:34,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:34,864 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2020-10-25 19:35:34,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:35:34,865 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:34,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1023824768, now seen corresponding path program 1 times [2020-10-25 19:35:34,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:34,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916290377] [2020-10-25 19:35:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-10-25 19:35:34,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916290377] [2020-10-25 19:35:34,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:34,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:34,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515536500] [2020-10-25 19:35:34,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:34,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:34,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:34,978 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand 3 states. [2020-10-25 19:35:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:35,172 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2020-10-25 19:35:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:35,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-10-25 19:35:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:35,178 INFO L225 Difference]: With dead ends: 422 [2020-10-25 19:35:35,178 INFO L226 Difference]: Without dead ends: 228 [2020-10-25 19:35:35,179 INFO L677 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 [2020-10-25 19:35:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-10-25 19:35:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2020-10-25 19:35:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-10-25 19:35:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2020-10-25 19:35:35,201 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2020-10-25 19:35:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:35,203 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2020-10-25 19:35:35,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2020-10-25 19:35:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-25 19:35:35,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:35,213 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:35,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:35:35,213 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2020-10-25 19:35:35,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:35,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580870570] [2020-10-25 19:35:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 19:35:35,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580870570] [2020-10-25 19:35:35,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:35,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:35,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608154891] [2020-10-25 19:35:35,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:35,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:35,376 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand 3 states. [2020-10-25 19:35:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:35,434 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2020-10-25 19:35:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:35,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-10-25 19:35:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:35,437 INFO L225 Difference]: With dead ends: 652 [2020-10-25 19:35:35,438 INFO L226 Difference]: Without dead ends: 437 [2020-10-25 19:35:35,441 INFO L677 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 [2020-10-25 19:35:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-25 19:35:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-10-25 19:35:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-10-25 19:35:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 600 transitions. [2020-10-25 19:35:35,468 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 600 transitions. Word has length 103 [2020-10-25 19:35:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:35,469 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 600 transitions. [2020-10-25 19:35:35,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 600 transitions. [2020-10-25 19:35:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-25 19:35:35,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:35,480 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:35,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:35:35,481 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash -713589126, now seen corresponding path program 1 times [2020-10-25 19:35:35,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:35,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62169346] [2020-10-25 19:35:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-10-25 19:35:35,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62169346] [2020-10-25 19:35:35,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:35,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:35,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451519880] [2020-10-25 19:35:35,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:35,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:35,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:35,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:35,592 INFO L87 Difference]: Start difference. First operand 437 states and 600 transitions. Second operand 3 states. [2020-10-25 19:35:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:35,631 INFO L93 Difference]: Finished difference Result 885 states and 1214 transitions. [2020-10-25 19:35:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:35,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-10-25 19:35:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:35,635 INFO L225 Difference]: With dead ends: 885 [2020-10-25 19:35:35,635 INFO L226 Difference]: Without dead ends: 458 [2020-10-25 19:35:35,637 INFO L677 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 [2020-10-25 19:35:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-25 19:35:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-25 19:35:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-25 19:35:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 627 transitions. [2020-10-25 19:35:35,652 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 627 transitions. Word has length 103 [2020-10-25 19:35:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:35,652 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 627 transitions. [2020-10-25 19:35:35,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 627 transitions. [2020-10-25 19:35:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-10-25 19:35:35,655 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:35,655 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:35,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:35:35,655 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:35,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:35,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1034569449, now seen corresponding path program 1 times [2020-10-25 19:35:35,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:35,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87652624] [2020-10-25 19:35:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-10-25 19:35:35,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87652624] [2020-10-25 19:35:35,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:35,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:35,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916522923] [2020-10-25 19:35:35,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:35,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:35,719 INFO L87 Difference]: Start difference. First operand 458 states and 627 transitions. Second operand 3 states. [2020-10-25 19:35:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:35,771 INFO L93 Difference]: Finished difference Result 932 states and 1274 transitions. [2020-10-25 19:35:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:35,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-10-25 19:35:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:35,776 INFO L225 Difference]: With dead ends: 932 [2020-10-25 19:35:35,777 INFO L226 Difference]: Without dead ends: 484 [2020-10-25 19:35:35,778 INFO L677 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 [2020-10-25 19:35:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-10-25 19:35:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2020-10-25 19:35:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2020-10-25 19:35:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 660 transitions. [2020-10-25 19:35:35,805 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 660 transitions. Word has length 104 [2020-10-25 19:35:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:35,806 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 660 transitions. [2020-10-25 19:35:35,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 660 transitions. [2020-10-25 19:35:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-25 19:35:35,808 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:35,809 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:35,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:35:35,809 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:35,810 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2020-10-25 19:35:35,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:35,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806012687] [2020-10-25 19:35:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-10-25 19:35:35,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806012687] [2020-10-25 19:35:35,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:35,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:35,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102485786] [2020-10-25 19:35:35,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:35,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:35,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:35,919 INFO L87 Difference]: Start difference. First operand 484 states and 660 transitions. Second operand 3 states. [2020-10-25 19:35:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:35,979 INFO L93 Difference]: Finished difference Result 699 states and 957 transitions. [2020-10-25 19:35:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:35,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-10-25 19:35:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:35,986 INFO L225 Difference]: With dead ends: 699 [2020-10-25 19:35:35,986 INFO L226 Difference]: Without dead ends: 697 [2020-10-25 19:35:35,988 INFO L677 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 [2020-10-25 19:35:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-10-25 19:35:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2020-10-25 19:35:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-10-25 19:35:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2020-10-25 19:35:36,015 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 105 [2020-10-25 19:35:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:36,015 INFO L481 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2020-10-25 19:35:36,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2020-10-25 19:35:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-10-25 19:35:36,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:36,020 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1] [2020-10-25 19:35:36,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:35:36,020 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2020-10-25 19:35:36,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:36,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865848080] [2020-10-25 19:35:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-10-25 19:35:36,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865848080] [2020-10-25 19:35:36,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:36,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:36,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756443314] [2020-10-25 19:35:36,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:36,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:36,166 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand 3 states. [2020-10-25 19:35:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:36,450 INFO L93 Difference]: Finished difference Result 1508 states and 2127 transitions. [2020-10-25 19:35:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:36,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2020-10-25 19:35:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:36,456 INFO L225 Difference]: With dead ends: 1508 [2020-10-25 19:35:36,456 INFO L226 Difference]: Without dead ends: 844 [2020-10-25 19:35:36,458 INFO L677 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 [2020-10-25 19:35:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2020-10-25 19:35:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 814. [2020-10-25 19:35:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-10-25 19:35:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1144 transitions. [2020-10-25 19:35:36,488 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1144 transitions. Word has length 173 [2020-10-25 19:35:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:36,488 INFO L481 AbstractCegarLoop]: Abstraction has 814 states and 1144 transitions. [2020-10-25 19:35:36,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1144 transitions. [2020-10-25 19:35:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-25 19:35:36,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:36,493 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:36,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:35:36,493 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:36,494 INFO L82 PathProgramCache]: Analyzing trace with hash -598161639, now seen corresponding path program 2 times [2020-10-25 19:35:36,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:36,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982325938] [2020-10-25 19:35:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2020-10-25 19:35:36,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982325938] [2020-10-25 19:35:36,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:36,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:36,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523902113] [2020-10-25 19:35:36,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:36,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:36,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:36,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:36,596 INFO L87 Difference]: Start difference. First operand 814 states and 1144 transitions. Second operand 3 states. [2020-10-25 19:35:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:36,932 INFO L93 Difference]: Finished difference Result 1870 states and 2708 transitions. [2020-10-25 19:35:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:36,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-10-25 19:35:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:36,942 INFO L225 Difference]: With dead ends: 1870 [2020-10-25 19:35:36,943 INFO L226 Difference]: Without dead ends: 1041 [2020-10-25 19:35:36,945 INFO L677 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 [2020-10-25 19:35:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2020-10-25 19:35:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1003. [2020-10-25 19:35:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2020-10-25 19:35:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1396 transitions. [2020-10-25 19:35:36,985 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1396 transitions. Word has length 185 [2020-10-25 19:35:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:36,986 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 1396 transitions. [2020-10-25 19:35:36,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1396 transitions. [2020-10-25 19:35:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-25 19:35:36,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:36,993 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2020-10-25 19:35:36,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:35:36,994 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:36,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2020-10-25 19:35:36,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:36,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094669499] [2020-10-25 19:35:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-10-25 19:35:37,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094669499] [2020-10-25 19:35:37,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:37,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:37,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773385838] [2020-10-25 19:35:37,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:37,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:37,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:37,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:37,272 INFO L87 Difference]: Start difference. First operand 1003 states and 1396 transitions. Second operand 3 states. [2020-10-25 19:35:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:37,342 INFO L93 Difference]: Finished difference Result 2282 states and 3180 transitions. [2020-10-25 19:35:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:37,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-10-25 19:35:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:37,352 INFO L225 Difference]: With dead ends: 2282 [2020-10-25 19:35:37,352 INFO L226 Difference]: Without dead ends: 1315 [2020-10-25 19:35:37,355 INFO L677 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 [2020-10-25 19:35:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2020-10-25 19:35:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2020-10-25 19:35:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-10-25 19:35:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1828 transitions. [2020-10-25 19:35:37,411 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1828 transitions. Word has length 194 [2020-10-25 19:35:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:37,412 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1828 transitions. [2020-10-25 19:35:37,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1828 transitions. [2020-10-25 19:35:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-10-25 19:35:37,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:37,419 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:37,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:35:37,419 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -915330113, now seen corresponding path program 1 times [2020-10-25 19:35:37,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:37,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620290383] [2020-10-25 19:35:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-10-25 19:35:37,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620290383] [2020-10-25 19:35:37,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:37,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:37,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204838704] [2020-10-25 19:35:37,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:37,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:37,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:37,576 INFO L87 Difference]: Start difference. First operand 1315 states and 1828 transitions. Second operand 3 states. [2020-10-25 19:35:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:37,658 INFO L93 Difference]: Finished difference Result 3583 states and 5032 transitions. [2020-10-25 19:35:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:37,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2020-10-25 19:35:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:37,671 INFO L225 Difference]: With dead ends: 3583 [2020-10-25 19:35:37,671 INFO L226 Difference]: Without dead ends: 2325 [2020-10-25 19:35:37,677 INFO L677 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 [2020-10-25 19:35:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2020-10-25 19:35:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2020-10-25 19:35:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2020-10-25 19:35:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3265 transitions. [2020-10-25 19:35:37,756 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3265 transitions. Word has length 196 [2020-10-25 19:35:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:37,757 INFO L481 AbstractCegarLoop]: Abstraction has 2323 states and 3265 transitions. [2020-10-25 19:35:37,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3265 transitions. [2020-10-25 19:35:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-10-25 19:35:37,762 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:37,762 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1] [2020-10-25 19:35:37,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:35:37,763 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2020-10-25 19:35:37,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:37,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9612536] [2020-10-25 19:35:37,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:35:37,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:35:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:35:37,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:35:38,094 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 19:35:38,095 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:35:38,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:35:38,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:35:38 BoogieIcfgContainer [2020-10-25 19:35:38,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:35:38,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:35:38,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:35:38,276 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:35:38,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:32" (3/4) ... [2020-10-25 19:35:38,281 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 19:35:38,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:35:38,284 INFO L168 Benchmark]: Toolchain (without parser) took 7355.66 ms. Allocated memory was 41.9 MB in the beginning and 138.4 MB in the end (delta: 96.5 MB). Free memory was 27.6 MB in the beginning and 72.4 MB in the end (delta: -44.8 MB). Peak memory consumption was 50.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:38,285 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.5 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:38,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.04 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 26.9 MB in the beginning and 33.6 MB in the end (delta: -6.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:38,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.21 ms. Allocated memory is still 50.3 MB. Free memory was 33.6 MB in the beginning and 30.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:38,287 INFO L168 Benchmark]: Boogie Preprocessor took 52.90 ms. Allocated memory is still 50.3 MB. Free memory was 30.9 MB in the beginning and 29.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:38,288 INFO L168 Benchmark]: RCFGBuilder took 1076.70 ms. Allocated memory is still 50.3 MB. Free memory was 28.9 MB in the beginning and 22.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:38,289 INFO L168 Benchmark]: TraceAbstraction took 5490.63 ms. Allocated memory was 50.3 MB in the beginning and 138.4 MB in the end (delta: 88.1 MB). Free memory was 22.4 MB in the beginning and 72.4 MB in the end (delta: -49.9 MB). Peak memory consumption was 75.9 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:38,289 INFO L168 Benchmark]: Witness Printer took 6.13 ms. Allocated memory is still 138.4 MB. Free memory is still 72.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:38,293 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.5 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 641.04 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 26.9 MB in the beginning and 33.6 MB in the end (delta: -6.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.21 ms. Allocated memory is still 50.3 MB. Free memory was 33.6 MB in the beginning and 30.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.90 ms. Allocated memory is still 50.3 MB. Free memory was 30.9 MB in the beginning and 29.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1076.70 ms. Allocated memory is still 50.3 MB. Free memory was 28.9 MB in the beginning and 22.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5490.63 ms. Allocated memory was 50.3 MB in the beginning and 138.4 MB in the end (delta: 88.1 MB). Free memory was 22.4 MB in the beginning and 72.4 MB in the end (delta: -49.9 MB). Peak memory consumption was 75.9 MB. Max. memory is 16.1 GB. * Witness Printer took 6.13 ms. Allocated memory is still 138.4 MB. Free memory is still 72.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 357. Possible FailurePath: [L618] int __retres1 ; [L11] int s__info_callback = __VERIFIER_nondet_int(); [L12] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] unsigned int s__version = __VERIFIER_nondet_uint(); [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int(); [L20] int s__wbio = __VERIFIER_nondet_int(); [L21] int s__hit = __VERIFIER_nondet_int(); [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int(); [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L27] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L28] unsigned int s__ctx__stats__sess_connect ; [L29] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L30] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L54] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L55] int tmp___3 = __VERIFIER_nondet_int(); [L56] int tmp___4 = __VERIFIER_nondet_int(); [L57] int tmp___5 = __VERIFIER_nondet_int(); [L58] int tmp___6 = __VERIFIER_nondet_int(); [L59] int tmp___7 = __VERIFIER_nondet_int(); [L60] int tmp___8 = __VERIFIER_nondet_int(); [L61] int tmp___9 = __VERIFIER_nondet_int(); [L62] int blastFlag ; [L63] int ag_X ; [L64] int ag_Y = __VERIFIER_nondet_int(); [L65] int __retres59 ; [L68] s__state = 12292 [L69] blastFlag = 0 [L70] tmp = __VERIFIER_nondet_int() [L71] cb = 0 [L72] ret = -1 [L73] skip = 0 [L74] tmp___0 = 0 [L75] COND TRUE s__info_callback != 0 [L76] cb = s__info_callback [L84] s__in_handshake = s__in_handshake + 1 [L85] COND FALSE !(tmp___1 - 12288) [L95] COND TRUE 1 [L97] state = s__state [L98] COND TRUE s__state == 12292 [L201] s__new_session = 1 [L202] s__state = 4096 [L203] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L208] s__server = 0 [L209] COND TRUE cb != 0 [L214] COND FALSE !(s__version - 65280 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L239] COND FALSE !(! tmp___4) [L245] COND FALSE !(! tmp___5) [L251] s__state = 4368 [L252] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L253] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND TRUE blastFlag == 0 [L260] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND TRUE blastFlag == 2 [L308] blastFlag = 3 [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND TRUE blastFlag == 3 [L325] blastFlag = 4 [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND FALSE !(blastFlag == 5) [L352] COND FALSE !(ret <= 0) [L357] s__state = ag_X ^ ag_Y [L358] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND FALSE !(blastFlag == 0) [L262] COND TRUE blastFlag == 4 [L263] blastFlag = 5 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND FALSE !(blastFlag == 1) [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND FALSE !(blastFlag == 2) [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND FALSE !(blastFlag == 3) [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND TRUE blastFlag == 5 [L3] __assert_fail("0", "s3_clnt_2.BV.c.cil-2a.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.2s, OverallIterations: 15, TraceHistogramMax: 11, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2634 SDtfs, 812 SDslu, 1502 SDs, 0 SdLazy, 896 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2323occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1686 NumberOfCodeBlocks, 1686 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 447550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2791/2791 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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.2.0-5485861 [2020-10-25 19:35:41,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:35:41,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:35:41,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:35:41,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:35:41,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:35:41,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:35:41,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:35:41,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:35:41,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:35:41,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:35:41,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:35:41,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:35:41,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:35:41,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:35:41,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:35:41,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:35:41,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:35:41,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:35:41,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:35:41,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:35:41,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:35:41,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:35:41,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:35:41,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:35:41,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:35:41,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:35:41,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:35:41,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:35:41,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:35:41,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:35:41,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:35:41,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:35:41,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:35:41,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:35:41,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:35:41,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:35:41,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:35:41,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:35:41,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:35:41,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:35:41,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-25 19:35:41,328 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:35:41,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:35:41,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:35:41,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:35:41,331 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:35:41,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:35:41,332 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:35:41,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:35:41,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:35:41,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:35:41,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:35:41,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:35:41,333 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 19:35:41,334 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 19:35:41,334 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:35:41,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:35:41,335 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:35:41,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:35:41,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:35:41,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:35:41,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:35:41,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:35:41,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:35:41,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:35:41,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:35:41,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:35:41,338 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 19:35:41,338 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 19:35:41,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:35:41,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:35:41,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 19:35:41,339 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 [2020-10-25 19:35:41,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:35:41,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:35:41,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:35:41,812 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:35:41,813 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:35:41,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2020-10-25 19:35:41,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39494f47f/dd193d8c487648c2847dedf06c79e048/FLAG91776ca05 [2020-10-25 19:35:42,551 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:35:42,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2020-10-25 19:35:42,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39494f47f/dd193d8c487648c2847dedf06c79e048/FLAG91776ca05 [2020-10-25 19:35:42,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39494f47f/dd193d8c487648c2847dedf06c79e048 [2020-10-25 19:35:42,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:35:42,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:35:42,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:42,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:35:42,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:35:42,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:42" (1/1) ... [2020-10-25 19:35:42,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e240364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:42, skipping insertion in model container [2020-10-25 19:35:42,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:42" (1/1) ... [2020-10-25 19:35:42,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:35:43,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:35:43,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:43,319 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:35:43,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:43,504 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:35:43,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43 WrapperNode [2020-10-25 19:35:43,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:43,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:43,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:35:43,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:35:43,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:43,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:35:43,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:35:43,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:35:43,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (1/1) ... [2020-10-25 19:35:43,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:35:43,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:35:43,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:35:43,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:35:43,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (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 [2020-10-25 19:35:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 19:35:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:35:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:35:43,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:35:43,912 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:35:44,776 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2020-10-25 19:35:44,777 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2020-10-25 19:35:44,787 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:35:44,787 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:35:44,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:44 BoogieIcfgContainer [2020-10-25 19:35:44,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:35:44,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:35:44,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:35:44,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:35:44,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:35:42" (1/3) ... [2020-10-25 19:35:44,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:44, skipping insertion in model container [2020-10-25 19:35:44,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:43" (2/3) ... [2020-10-25 19:35:44,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:44, skipping insertion in model container [2020-10-25 19:35:44,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:44" (3/3) ... [2020-10-25 19:35:44,801 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2020-10-25 19:35:44,814 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:35:44,820 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:35:44,842 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:35:44,874 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:35:44,874 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:35:44,875 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:35:44,875 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:35:44,875 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:35:44,875 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:35:44,875 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:35:44,876 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:35:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-10-25 19:35:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:35:44,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:44,905 INFO L422 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] [2020-10-25 19:35:44,906 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2020-10-25 19:35:44,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:44,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826801486] [2020-10-25 19:35:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:45,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:45,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:45,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:45,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826801486] [2020-10-25 19:35:45,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:45,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:45,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571736515] [2020-10-25 19:35:45,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:45,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:45,174 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2020-10-25 19:35:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:45,487 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2020-10-25 19:35:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:45,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:35:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:45,533 INFO L225 Difference]: With dead ends: 247 [2020-10-25 19:35:45,534 INFO L226 Difference]: Without dead ends: 112 [2020-10-25 19:35:45,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-25 19:35:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-25 19:35:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-25 19:35:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2020-10-25 19:35:45,613 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2020-10-25 19:35:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:45,614 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2020-10-25 19:35:45,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2020-10-25 19:35:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 19:35:45,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:45,617 INFO L422 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] [2020-10-25 19:35:45,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 19:35:45,832 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:45,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2020-10-25 19:35:45,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:45,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958911237] [2020-10-25 19:35:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:45,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:45,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:45,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:45,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958911237] [2020-10-25 19:35:45,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:45,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:45,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556420517] [2020-10-25 19:35:45,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:45,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:45,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:45,966 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2020-10-25 19:35:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:46,242 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2020-10-25 19:35:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:46,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 19:35:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:46,246 INFO L225 Difference]: With dead ends: 233 [2020-10-25 19:35:46,246 INFO L226 Difference]: Without dead ends: 131 [2020-10-25 19:35:46,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-25 19:35:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2020-10-25 19:35:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-25 19:35:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2020-10-25 19:35:46,265 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2020-10-25 19:35:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:46,266 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2020-10-25 19:35:46,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2020-10-25 19:35:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 19:35:46,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:46,269 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 19:35:46,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 19:35:46,489 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2020-10-25 19:35:46,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:46,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282494607] [2020-10-25 19:35:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:46,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:46,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-25 19:35:46,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-25 19:35:46,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282494607] [2020-10-25 19:35:46,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:46,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:46,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477816996] [2020-10-25 19:35:46,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:46,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:46,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:46,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:46,615 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2020-10-25 19:35:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:46,862 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2020-10-25 19:35:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:46,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-25 19:35:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:46,869 INFO L225 Difference]: With dead ends: 265 [2020-10-25 19:35:46,869 INFO L226 Difference]: Without dead ends: 148 [2020-10-25 19:35:46,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:46,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-25 19:35:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2020-10-25 19:35:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-25 19:35:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2020-10-25 19:35:46,897 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2020-10-25 19:35:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:46,897 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2020-10-25 19:35:46,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2020-10-25 19:35:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-25 19:35:46,900 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:46,900 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-10-25 19:35:47,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 19:35:47,115 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2020-10-25 19:35:47,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:47,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261111515] [2020-10-25 19:35:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:47,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:47,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 19:35:47,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 19:35:47,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261111515] [2020-10-25 19:35:47,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:47,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:35:47,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523881535] [2020-10-25 19:35:47,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:35:47,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:47,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:35:47,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:47,281 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 4 states. [2020-10-25 19:35:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:47,730 INFO L93 Difference]: Finished difference Result 349 states and 534 transitions. [2020-10-25 19:35:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:35:47,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-10-25 19:35:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:47,734 INFO L225 Difference]: With dead ends: 349 [2020-10-25 19:35:47,734 INFO L226 Difference]: Without dead ends: 215 [2020-10-25 19:35:47,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-25 19:35:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 207. [2020-10-25 19:35:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-10-25 19:35:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2020-10-25 19:35:47,783 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 67 [2020-10-25 19:35:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:47,786 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2020-10-25 19:35:47,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:35:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2020-10-25 19:35:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-25 19:35:47,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:47,793 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-10-25 19:35:47,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-25 19:35:47,994 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1528022105, now seen corresponding path program 1 times [2020-10-25 19:35:47,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:47,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260285398] [2020-10-25 19:35:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:48,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:48,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 19:35:48,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 19:35:48,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260285398] [2020-10-25 19:35:48,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:48,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:48,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446827494] [2020-10-25 19:35:48,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:48,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:48,133 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand 3 states. [2020-10-25 19:35:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:48,384 INFO L93 Difference]: Finished difference Result 427 states and 620 transitions. [2020-10-25 19:35:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:48,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-10-25 19:35:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:48,387 INFO L225 Difference]: With dead ends: 427 [2020-10-25 19:35:48,387 INFO L226 Difference]: Without dead ends: 230 [2020-10-25 19:35:48,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-25 19:35:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2020-10-25 19:35:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-10-25 19:35:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2020-10-25 19:35:48,405 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 68 [2020-10-25 19:35:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:48,406 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2020-10-25 19:35:48,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2020-10-25 19:35:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:35:48,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:48,410 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2020-10-25 19:35:48,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-25 19:35:48,625 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1678422895, now seen corresponding path program 1 times [2020-10-25 19:35:48,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:48,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288498643] [2020-10-25 19:35:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:48,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:48,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-10-25 19:35:48,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-10-25 19:35:48,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288498643] [2020-10-25 19:35:48,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:48,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:48,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023897952] [2020-10-25 19:35:48,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:48,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:48,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:48,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:48,834 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand 3 states. [2020-10-25 19:35:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:49,067 INFO L93 Difference]: Finished difference Result 466 states and 670 transitions. [2020-10-25 19:35:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:49,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-10-25 19:35:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:49,073 INFO L225 Difference]: With dead ends: 466 [2020-10-25 19:35:49,074 INFO L226 Difference]: Without dead ends: 250 [2020-10-25 19:35:49,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-25 19:35:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2020-10-25 19:35:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-25 19:35:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2020-10-25 19:35:49,099 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 84 [2020-10-25 19:35:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:49,099 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2020-10-25 19:35:49,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2020-10-25 19:35:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-25 19:35:49,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:49,109 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:49,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-25 19:35:49,323 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2020-10-25 19:35:49,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:49,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565575661] [2020-10-25 19:35:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:49,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:49,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 19:35:49,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 19:35:49,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565575661] [2020-10-25 19:35:49,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:49,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:35:49,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515229208] [2020-10-25 19:35:49,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:35:49,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:49,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:35:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:49,492 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand 4 states. [2020-10-25 19:35:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:49,583 INFO L93 Difference]: Finished difference Result 743 states and 1042 transitions. [2020-10-25 19:35:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:35:49,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-10-25 19:35:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:49,587 INFO L225 Difference]: With dead ends: 743 [2020-10-25 19:35:49,588 INFO L226 Difference]: Without dead ends: 506 [2020-10-25 19:35:49,589 INFO L677 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 [2020-10-25 19:35:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-10-25 19:35:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2020-10-25 19:35:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-10-25 19:35:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 702 transitions. [2020-10-25 19:35:49,627 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 702 transitions. Word has length 103 [2020-10-25 19:35:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:49,628 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 702 transitions. [2020-10-25 19:35:49,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:35:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 702 transitions. [2020-10-25 19:35:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-25 19:35:49,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:49,637 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:49,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-25 19:35:49,852 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -847602632, now seen corresponding path program 1 times [2020-10-25 19:35:49,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:49,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432692916] [2020-10-25 19:35:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:49,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:49,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-10-25 19:35:49,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-10-25 19:35:49,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432692916] [2020-10-25 19:35:49,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:49,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:50,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071277399] [2020-10-25 19:35:50,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:50,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:50,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:50,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:50,002 INFO L87 Difference]: Start difference. First operand 506 states and 702 transitions. Second operand 3 states. [2020-10-25 19:35:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:50,063 INFO L93 Difference]: Finished difference Result 1023 states and 1418 transitions. [2020-10-25 19:35:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:50,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-10-25 19:35:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:50,071 INFO L225 Difference]: With dead ends: 1023 [2020-10-25 19:35:50,071 INFO L226 Difference]: Without dead ends: 527 [2020-10-25 19:35:50,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-10-25 19:35:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2020-10-25 19:35:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2020-10-25 19:35:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 729 transitions. [2020-10-25 19:35:50,111 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 729 transitions. Word has length 103 [2020-10-25 19:35:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:50,113 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 729 transitions. [2020-10-25 19:35:50,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 729 transitions. [2020-10-25 19:35:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-10-25 19:35:50,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:50,115 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:50,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-25 19:35:50,333 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1168582955, now seen corresponding path program 1 times [2020-10-25 19:35:50,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:50,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236947141] [2020-10-25 19:35:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:50,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:50,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-10-25 19:35:50,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-10-25 19:35:50,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236947141] [2020-10-25 19:35:50,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:50,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:50,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907519350] [2020-10-25 19:35:50,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:50,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:50,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:50,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:50,495 INFO L87 Difference]: Start difference. First operand 527 states and 729 transitions. Second operand 3 states. [2020-10-25 19:35:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:50,541 INFO L93 Difference]: Finished difference Result 1070 states and 1478 transitions. [2020-10-25 19:35:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:50,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-10-25 19:35:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:50,545 INFO L225 Difference]: With dead ends: 1070 [2020-10-25 19:35:50,545 INFO L226 Difference]: Without dead ends: 553 [2020-10-25 19:35:50,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-25 19:35:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2020-10-25 19:35:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-10-25 19:35:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2020-10-25 19:35:50,578 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 104 [2020-10-25 19:35:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:50,578 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2020-10-25 19:35:50,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2020-10-25 19:35:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-25 19:35:50,580 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:50,581 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:35:50,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-25 19:35:50,795 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2020-10-25 19:35:50,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:50,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306257904] [2020-10-25 19:35:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:50,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:50,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-10-25 19:35:50,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-10-25 19:35:50,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306257904] [2020-10-25 19:35:50,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:50,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:35:50,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315364250] [2020-10-25 19:35:50,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:35:50,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:35:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:50,956 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand 4 states. [2020-10-25 19:35:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:51,062 INFO L93 Difference]: Finished difference Result 1520 states and 2113 transitions. [2020-10-25 19:35:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:35:51,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-10-25 19:35:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:51,069 INFO L225 Difference]: With dead ends: 1520 [2020-10-25 19:35:51,070 INFO L226 Difference]: Without dead ends: 1003 [2020-10-25 19:35:51,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2020-10-25 19:35:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2020-10-25 19:35:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2020-10-25 19:35:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1392 transitions. [2020-10-25 19:35:51,125 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1392 transitions. Word has length 105 [2020-10-25 19:35:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:51,125 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 1392 transitions. [2020-10-25 19:35:51,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:35:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1392 transitions. [2020-10-25 19:35:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-10-25 19:35:51,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:51,131 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1] [2020-10-25 19:35:51,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-25 19:35:51,345 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2020-10-25 19:35:51,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:51,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507246256] [2020-10-25 19:35:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:51,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:51,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-10-25 19:35:51,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-10-25 19:35:51,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507246256] [2020-10-25 19:35:51,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:51,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:35:51,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085122238] [2020-10-25 19:35:51,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:35:51,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:35:51,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:51,563 INFO L87 Difference]: Start difference. First operand 1003 states and 1392 transitions. Second operand 4 states. [2020-10-25 19:35:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:51,915 INFO L93 Difference]: Finished difference Result 2091 states and 2938 transitions. [2020-10-25 19:35:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:35:51,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2020-10-25 19:35:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:51,923 INFO L225 Difference]: With dead ends: 2091 [2020-10-25 19:35:51,924 INFO L226 Difference]: Without dead ends: 1124 [2020-10-25 19:35:51,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2020-10-25 19:35:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1095. [2020-10-25 19:35:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2020-10-25 19:35:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1500 transitions. [2020-10-25 19:35:51,973 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1500 transitions. Word has length 173 [2020-10-25 19:35:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:51,973 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1500 transitions. [2020-10-25 19:35:51,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:35:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1500 transitions. [2020-10-25 19:35:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-25 19:35:51,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:51,979 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2020-10-25 19:35:52,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-25 19:35:52,193 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:52,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2020-10-25 19:35:52,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:52,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233799298] [2020-10-25 19:35:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:52,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:52,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-10-25 19:35:52,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-10-25 19:35:52,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233799298] [2020-10-25 19:35:52,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:52,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 19:35:52,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838159295] [2020-10-25 19:35:52,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:52,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:52,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:52,479 INFO L87 Difference]: Start difference. First operand 1095 states and 1500 transitions. Second operand 3 states. [2020-10-25 19:35:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:52,545 INFO L93 Difference]: Finished difference Result 2409 states and 3304 transitions. [2020-10-25 19:35:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:52,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-10-25 19:35:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:52,553 INFO L225 Difference]: With dead ends: 2409 [2020-10-25 19:35:52,553 INFO L226 Difference]: Without dead ends: 1350 [2020-10-25 19:35:52,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-10-25 19:35:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2020-10-25 19:35:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2020-10-25 19:35:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1847 transitions. [2020-10-25 19:35:52,614 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1847 transitions. Word has length 194 [2020-10-25 19:35:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:52,615 INFO L481 AbstractCegarLoop]: Abstraction has 1350 states and 1847 transitions. [2020-10-25 19:35:52,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1847 transitions. [2020-10-25 19:35:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-10-25 19:35:52,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:52,620 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1] [2020-10-25 19:35:52,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-25 19:35:52,835 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2020-10-25 19:35:52,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:52,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422059942] [2020-10-25 19:35:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:35:52,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:35:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:35:53,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:35:53,462 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-10-25 19:35:53,462 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:35:53,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-10-25 19:35:53,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:35:53 BoogieIcfgContainer [2020-10-25 19:35:53,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:35:53,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:35:53,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:35:53,921 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:35:53,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:44" (3/4) ... [2020-10-25 19:35:53,924 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 19:35:54,168 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:35:54,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:35:54,172 INFO L168 Benchmark]: Toolchain (without parser) took 11283.52 ms. Allocated memory was 48.2 MB in the beginning and 151.0 MB in the end (delta: 102.8 MB). Free memory was 24.5 MB in the beginning and 92.8 MB in the end (delta: -68.3 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:54,173 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 48.2 MB. Free memory was 29.9 MB in the beginning and 29.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:54,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.09 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.8 MB in the beginning and 41.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:54,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.96 ms. Allocated memory is still 58.7 MB. Free memory was 41.7 MB in the beginning and 39.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:54,174 INFO L168 Benchmark]: Boogie Preprocessor took 58.11 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 37.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:54,174 INFO L168 Benchmark]: RCFGBuilder took 1155.91 ms. Allocated memory is still 58.7 MB. Free memory was 37.3 MB in the beginning and 25.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:54,175 INFO L168 Benchmark]: TraceAbstraction took 9128.12 ms. Allocated memory was 58.7 MB in the beginning and 151.0 MB in the end (delta: 92.3 MB). Free memory was 25.0 MB in the beginning and 113.8 MB in the end (delta: -88.7 MB). Peak memory consumption was 77.5 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:54,175 INFO L168 Benchmark]: Witness Printer took 247.62 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 92.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:54,177 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 48.2 MB. Free memory was 29.9 MB in the beginning and 29.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 607.09 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.8 MB in the beginning and 41.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.96 ms. Allocated memory is still 58.7 MB. Free memory was 41.7 MB in the beginning and 39.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.11 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 37.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1155.91 ms. Allocated memory is still 58.7 MB. Free memory was 37.3 MB in the beginning and 25.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9128.12 ms. Allocated memory was 58.7 MB in the beginning and 151.0 MB in the end (delta: 92.3 MB). Free memory was 25.0 MB in the beginning and 113.8 MB in the end (delta: -88.7 MB). Peak memory consumption was 77.5 MB. Max. memory is 16.1 GB. * Witness Printer took 247.62 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 92.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L618] int __retres1 ; [L11] int s__info_callback = __VERIFIER_nondet_int(); [L12] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] unsigned int s__version = __VERIFIER_nondet_uint(); [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int(); [L20] int s__wbio = __VERIFIER_nondet_int(); [L21] int s__hit = __VERIFIER_nondet_int(); [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int(); [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L27] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L28] unsigned int s__ctx__stats__sess_connect ; [L29] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L30] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L54] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L55] int tmp___3 = __VERIFIER_nondet_int(); [L56] int tmp___4 = __VERIFIER_nondet_int(); [L57] int tmp___5 = __VERIFIER_nondet_int(); [L58] int tmp___6 = __VERIFIER_nondet_int(); [L59] int tmp___7 = __VERIFIER_nondet_int(); [L60] int tmp___8 = __VERIFIER_nondet_int(); [L61] int tmp___9 = __VERIFIER_nondet_int(); [L62] int blastFlag ; [L63] int ag_X ; [L64] int ag_Y = __VERIFIER_nondet_int(); [L65] int __retres59 ; [L68] s__state = 12292 [L69] blastFlag = 0 [L70] tmp = __VERIFIER_nondet_int() [L71] cb = 0 [L72] ret = -1 [L73] skip = 0 [L74] tmp___0 = 0 [L75] COND TRUE s__info_callback != 0 [L76] cb = s__info_callback [L84] s__in_handshake = s__in_handshake + 1 [L85] COND FALSE !(tmp___1 - 12288) [L95] COND TRUE 1 [L97] state = s__state [L98] COND TRUE s__state == 12292 [L201] s__new_session = 1 [L202] s__state = 4096 [L203] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L208] s__server = 0 [L209] COND TRUE cb != 0 [L214] COND FALSE !(s__version - 65280 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L239] COND FALSE !(! tmp___4) [L245] COND FALSE !(! tmp___5) [L251] s__state = 4368 [L252] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L253] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND TRUE blastFlag == 0 [L260] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND TRUE blastFlag == 2 [L308] blastFlag = 3 [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND TRUE blastFlag == 3 [L325] blastFlag = 4 [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND FALSE !(blastFlag == 5) [L352] COND FALSE !(ret <= 0) [L357] s__state = ag_X ^ ag_Y [L358] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND FALSE !(blastFlag == 0) [L262] COND TRUE blastFlag == 4 [L263] blastFlag = 5 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND FALSE !(blastFlag == 1) [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND FALSE !(blastFlag == 2) [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND FALSE !(blastFlag == 3) [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND TRUE blastFlag == 5 [L3] __assert_fail("0", "s3_clnt_2.BV.c.cil-2a.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.8s, OverallIterations: 13, TraceHistogramMax: 11, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2289 SDtfs, 1139 SDslu, 1557 SDs, 0 SdLazy, 931 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2198 GetRequests, 2182 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1350occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2198 ConstructedInterpolants, 0 QuantifiedInterpolants, 431278 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1930 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 3576/3576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...