./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/openssl/s3_srvr.blast.04.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/openssl/s3_srvr.blast.04.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1-dev-20ed64e [2021-08-25 20:22:17,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:22:17,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:22:17,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:22:17,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:22:17,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:22:17,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:22:17,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:22:17,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:22:17,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:22:17,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:22:17,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:22:17,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:22:17,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:22:17,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:22:17,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:22:17,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:22:17,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:22:17,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:22:17,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:22:17,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:22:17,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:22:17,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:22:17,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:22:17,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:22:17,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:22:17,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:22:17,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:22:17,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:22:17,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:22:17,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:22:17,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:22:17,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:22:17,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:22:17,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:22:17,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:22:17,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:22:17,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:22:17,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:22:17,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:22:17,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:22:17,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:22:17,333 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:22:17,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:22:17,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:22:17,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:22:17,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:22:17,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:22:17,338 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:22:17,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:22:17,338 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:22:17,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:22:17,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:22:17,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:22:17,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:22:17,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:22:17,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:22:17,340 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:22:17,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:22:17,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:22:17,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:22:17,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:22:17,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:22:17,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:22:17,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:22:17,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:22:17,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:22:17,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:22:17,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:22:17,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:22:17,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:22:17,353 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:22:17,353 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 -> 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c [2021-08-25 20:22:17,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:22:17,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:22:17,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:22:17,651 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:22:17,652 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:22:17,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-08-25 20:22:17,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54442e89/ab41221b60cb45faad564edcb609e169/FLAGa79844820 [2021-08-25 20:22:18,303 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:22:18,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-08-25 20:22:18,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54442e89/ab41221b60cb45faad564edcb609e169/FLAGa79844820 [2021-08-25 20:22:18,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54442e89/ab41221b60cb45faad564edcb609e169 [2021-08-25 20:22:18,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:22:18,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:22:18,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:22:18,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:22:18,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:22:18,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:22:18" (1/1) ... [2021-08-25 20:22:18,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb4ca93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:18, skipping insertion in model container [2021-08-25 20:22:18,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:22:18" (1/1) ... [2021-08-25 20:22:18,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:22:18,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:22:19,021 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[71320,71333] [2021-08-25 20:22:19,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:22:19,052 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:22:19,144 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[71320,71333] [2021-08-25 20:22:19,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:22:19,167 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:22:19,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19 WrapperNode [2021-08-25 20:22:19,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:22:19,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:22:19,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:22:19,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:22:19,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:22:19,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:22:19,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:22:19,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:22:19,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:22:19,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:22:19,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:22:19,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:22:19,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (1/1) ... [2021-08-25 20:22:19,312 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:22:19,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:22:19,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:22:19,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:22:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:22:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:22:19,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:22:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:22:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:22:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:22:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:22:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:22:19,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:22:19,614 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:22:20,433 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:22:20,433 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:22:20,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:22:20,439 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:22:20,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:20 BoogieIcfgContainer [2021-08-25 20:22:20,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:22:20,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:22:20,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:22:20,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:22:20,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:22:18" (1/3) ... [2021-08-25 20:22:20,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ea48bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:22:20, skipping insertion in model container [2021-08-25 20:22:20,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:19" (2/3) ... [2021-08-25 20:22:20,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ea48bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:22:20, skipping insertion in model container [2021-08-25 20:22:20,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:20" (3/3) ... [2021-08-25 20:22:20,463 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2021-08-25 20:22:20,466 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:22:20,466 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:22:20,501 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:22:20,505 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:22:20,506 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:22:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:22:20,525 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:20,525 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:20,526 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:20,530 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2021-08-25 20:22:20,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:20,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800478981] [2021-08-25 20:22:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:20,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:20,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:20,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800478981] [2021-08-25 20:22:20,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800478981] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:20,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:20,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:20,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043948489] [2021-08-25 20:22:20,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:20,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:20,873 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:21,330 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2021-08-25 20:22:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:21,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:22:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:21,343 INFO L225 Difference]: With dead ends: 313 [2021-08-25 20:22:21,343 INFO L226 Difference]: Without dead ends: 158 [2021-08-25 20:22:21,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-25 20:22:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2021-08-25 20:22:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.542857142857143) internal successors, (216), 140 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2021-08-25 20:22:21,398 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2021-08-25 20:22:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:21,398 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2021-08-25 20:22:21,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2021-08-25 20:22:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:22:21,405 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:21,405 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:21,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:22:21,406 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2021-08-25 20:22:21,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:21,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794512175] [2021-08-25 20:22:21,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:21,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:21,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:21,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794512175] [2021-08-25 20:22:21,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794512175] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:21,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:21,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:21,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895282751] [2021-08-25 20:22:21,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:21,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:21,528 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:21,823 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2021-08-25 20:22:21,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:22:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:21,829 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:22:21,829 INFO L226 Difference]: Without dead ends: 158 [2021-08-25 20:22:21,832 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:21,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-25 20:22:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2021-08-25 20:22:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5357142857142858) internal successors, (215), 140 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2021-08-25 20:22:21,848 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2021-08-25 20:22:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:21,848 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2021-08-25 20:22:21,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2021-08-25 20:22:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:22:21,849 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:21,849 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:21,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:22:21,850 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:21,850 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2021-08-25 20:22:21,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:21,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331008129] [2021-08-25 20:22:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:21,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:21,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:21,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331008129] [2021-08-25 20:22:21,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331008129] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:21,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:21,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:21,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396254118] [2021-08-25 20:22:21,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:21,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:21,974 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:22,272 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2021-08-25 20:22:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:22,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:22:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:22,274 INFO L225 Difference]: With dead ends: 279 [2021-08-25 20:22:22,274 INFO L226 Difference]: Without dead ends: 157 [2021-08-25 20:22:22,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-25 20:22:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2021-08-25 20:22:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 140 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2021-08-25 20:22:22,281 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2021-08-25 20:22:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:22,281 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2021-08-25 20:22:22,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2021-08-25 20:22:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:22:22,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:22,283 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:22,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:22:22,284 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:22,284 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2021-08-25 20:22:22,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:22,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270812780] [2021-08-25 20:22:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:22,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:22,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:22,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270812780] [2021-08-25 20:22:22,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270812780] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:22,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:22,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:22,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085298109] [2021-08-25 20:22:22,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:22,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:22,358 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:22,623 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2021-08-25 20:22:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:22,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:22:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:22,625 INFO L225 Difference]: With dead ends: 277 [2021-08-25 20:22:22,625 INFO L226 Difference]: Without dead ends: 155 [2021-08-25 20:22:22,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-25 20:22:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2021-08-25 20:22:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5214285714285714) internal successors, (213), 140 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2021-08-25 20:22:22,630 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2021-08-25 20:22:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:22,630 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2021-08-25 20:22:22,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2021-08-25 20:22:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:22:22,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:22,631 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:22,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:22:22,632 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:22,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2021-08-25 20:22:22,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:22,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565866447] [2021-08-25 20:22:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:22,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:22,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:22,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565866447] [2021-08-25 20:22:22,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565866447] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:22,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:22,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:22,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031925643] [2021-08-25 20:22:22,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:22,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:22,749 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:23,000 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2021-08-25 20:22:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:23,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:22:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:23,002 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:22:23,002 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:22:23,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:22:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:22:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2021-08-25 20:22:23,008 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2021-08-25 20:22:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:23,008 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2021-08-25 20:22:23,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2021-08-25 20:22:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:22:23,009 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:23,009 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:23,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:22:23,010 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2021-08-25 20:22:23,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:23,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566234314] [2021-08-25 20:22:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:23,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:23,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:23,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566234314] [2021-08-25 20:22:23,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566234314] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:23,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:23,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:23,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824914581] [2021-08-25 20:22:23,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:23,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:23,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:23,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:23,062 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:23,295 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2021-08-25 20:22:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:23,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:22:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:23,297 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:22:23,297 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:22:23,298 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:22:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:22:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 140 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2021-08-25 20:22:23,302 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2021-08-25 20:22:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:23,302 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2021-08-25 20:22:23,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2021-08-25 20:22:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:22:23,303 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:23,303 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:23,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:22:23,304 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2021-08-25 20:22:23,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:23,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001363088] [2021-08-25 20:22:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:23,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:23,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:23,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001363088] [2021-08-25 20:22:23,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001363088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:23,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:23,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:23,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211188718] [2021-08-25 20:22:23,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:23,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:23,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:23,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:23,353 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:23,606 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2021-08-25 20:22:23,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:23,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-25 20:22:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:23,608 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:22:23,608 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:22:23,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:22:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:22:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5) internal successors, (210), 140 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2021-08-25 20:22:23,613 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2021-08-25 20:22:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:23,613 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2021-08-25 20:22:23,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2021-08-25 20:22:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-25 20:22:23,615 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:23,615 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:23,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:22:23,615 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2021-08-25 20:22:23,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:23,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120721342] [2021-08-25 20:22:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:23,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:23,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:23,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120721342] [2021-08-25 20:22:23,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120721342] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:23,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:23,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:23,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416939772] [2021-08-25 20:22:23,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:23,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:23,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:23,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:23,677 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:23,924 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2021-08-25 20:22:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-25 20:22:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:23,926 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:22:23,926 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:22:23,926 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:22:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:22:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 140 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2021-08-25 20:22:23,930 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2021-08-25 20:22:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:23,930 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2021-08-25 20:22:23,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2021-08-25 20:22:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-25 20:22:23,931 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:23,931 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:23,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:22:23,931 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2021-08-25 20:22:23,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:23,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461522813] [2021-08-25 20:22:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:23,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:23,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:23,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461522813] [2021-08-25 20:22:23,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461522813] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:23,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:23,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:23,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341832887] [2021-08-25 20:22:24,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:24,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:24,002 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:24,212 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2021-08-25 20:22:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:24,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-25 20:22:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:24,214 INFO L225 Difference]: With dead ends: 266 [2021-08-25 20:22:24,214 INFO L226 Difference]: Without dead ends: 144 [2021-08-25 20:22:24,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-25 20:22:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2021-08-25 20:22:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2021-08-25 20:22:24,218 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2021-08-25 20:22:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:24,219 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2021-08-25 20:22:24,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2021-08-25 20:22:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-25 20:22:24,220 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:24,220 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:24,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:22:24,220 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2021-08-25 20:22:24,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:24,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095513812] [2021-08-25 20:22:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:24,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:24,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:24,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095513812] [2021-08-25 20:22:24,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095513812] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:24,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:24,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:24,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763726116] [2021-08-25 20:22:24,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:24,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:24,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:24,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:24,276 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:24,529 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2021-08-25 20:22:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-25 20:22:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:24,531 INFO L225 Difference]: With dead ends: 306 [2021-08-25 20:22:24,531 INFO L226 Difference]: Without dead ends: 184 [2021-08-25 20:22:24,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-08-25 20:22:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2021-08-25 20:22:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5185185185185186) internal successors, (246), 162 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2021-08-25 20:22:24,535 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2021-08-25 20:22:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:24,535 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2021-08-25 20:22:24,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2021-08-25 20:22:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:22:24,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:24,537 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:24,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:22:24,537 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2021-08-25 20:22:24,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:24,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290602446] [2021-08-25 20:22:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:24,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:24,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:24,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290602446] [2021-08-25 20:22:24,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290602446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:24,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:24,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:24,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500540545] [2021-08-25 20:22:24,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:24,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:24,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:24,587 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:24,834 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2021-08-25 20:22:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-25 20:22:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:24,836 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:22:24,836 INFO L226 Difference]: Without dead ends: 184 [2021-08-25 20:22:24,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-08-25 20:22:24,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2021-08-25 20:22:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5123456790123457) internal successors, (245), 162 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2021-08-25 20:22:24,841 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2021-08-25 20:22:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:24,841 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2021-08-25 20:22:24,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2021-08-25 20:22:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:22:24,843 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:24,843 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:24,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:22:24,843 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:24,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:24,844 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2021-08-25 20:22:24,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:24,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110535676] [2021-08-25 20:22:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:24,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:24,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:24,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110535676] [2021-08-25 20:22:24,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110535676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:24,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:24,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:24,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756347243] [2021-08-25 20:22:24,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:24,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:24,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:24,886 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:25,149 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2021-08-25 20:22:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:25,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:22:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:25,151 INFO L225 Difference]: With dead ends: 327 [2021-08-25 20:22:25,151 INFO L226 Difference]: Without dead ends: 183 [2021-08-25 20:22:25,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-08-25 20:22:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2021-08-25 20:22:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5061728395061729) internal successors, (244), 162 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2021-08-25 20:22:25,155 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2021-08-25 20:22:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:25,156 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2021-08-25 20:22:25,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2021-08-25 20:22:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:22:25,156 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:25,156 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:25,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:22:25,157 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2021-08-25 20:22:25,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:25,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190743687] [2021-08-25 20:22:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:25,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:25,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:25,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190743687] [2021-08-25 20:22:25,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190743687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:25,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:25,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:25,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692047538] [2021-08-25 20:22:25,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:25,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:25,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:25,200 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:25,451 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2021-08-25 20:22:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:25,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:22:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:25,453 INFO L225 Difference]: With dead ends: 325 [2021-08-25 20:22:25,453 INFO L226 Difference]: Without dead ends: 181 [2021-08-25 20:22:25,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-25 20:22:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2021-08-25 20:22:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2021-08-25 20:22:25,457 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2021-08-25 20:22:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:25,457 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2021-08-25 20:22:25,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2021-08-25 20:22:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:22:25,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:25,458 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:25,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:22:25,458 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2021-08-25 20:22:25,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:25,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581871415] [2021-08-25 20:22:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:25,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:25,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:25,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581871415] [2021-08-25 20:22:25,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581871415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:25,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:25,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:25,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632459701] [2021-08-25 20:22:25,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:25,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:25,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:25,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:25,513 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:25,756 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2021-08-25 20:22:25,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:25,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:22:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:25,758 INFO L225 Difference]: With dead ends: 324 [2021-08-25 20:22:25,758 INFO L226 Difference]: Without dead ends: 180 [2021-08-25 20:22:25,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-25 20:22:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-08-25 20:22:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4938271604938271) internal successors, (242), 162 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2021-08-25 20:22:25,762 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2021-08-25 20:22:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:25,762 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2021-08-25 20:22:25,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2021-08-25 20:22:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:22:25,763 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:25,763 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:25,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:22:25,763 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:25,764 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2021-08-25 20:22:25,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:25,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837004793] [2021-08-25 20:22:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:25,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:25,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:25,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837004793] [2021-08-25 20:22:25,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837004793] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:25,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:25,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:25,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222686618] [2021-08-25 20:22:25,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:25,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:25,802 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:26,049 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2021-08-25 20:22:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:26,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:22:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:26,051 INFO L225 Difference]: With dead ends: 324 [2021-08-25 20:22:26,051 INFO L226 Difference]: Without dead ends: 180 [2021-08-25 20:22:26,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-25 20:22:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-08-25 20:22:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 162 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2021-08-25 20:22:26,055 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2021-08-25 20:22:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:26,055 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2021-08-25 20:22:26,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2021-08-25 20:22:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 20:22:26,056 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:26,056 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:26,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:22:26,056 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:26,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2021-08-25 20:22:26,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:26,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979837210] [2021-08-25 20:22:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:26,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:26,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:26,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979837210] [2021-08-25 20:22:26,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979837210] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:26,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:26,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:26,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140203195] [2021-08-25 20:22:26,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:26,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:26,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:26,106 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:26,351 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2021-08-25 20:22:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:26,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-25 20:22:26,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:26,352 INFO L225 Difference]: With dead ends: 324 [2021-08-25 20:22:26,353 INFO L226 Difference]: Without dead ends: 180 [2021-08-25 20:22:26,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-25 20:22:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-08-25 20:22:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4814814814814814) internal successors, (240), 162 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2021-08-25 20:22:26,359 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2021-08-25 20:22:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:26,359 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2021-08-25 20:22:26,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2021-08-25 20:22:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-25 20:22:26,360 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:26,360 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:26,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:22:26,361 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2021-08-25 20:22:26,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:26,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984392719] [2021-08-25 20:22:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:26,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:26,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:26,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984392719] [2021-08-25 20:22:26,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984392719] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:26,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:26,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:26,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732053549] [2021-08-25 20:22:26,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:26,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:26,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:26,413 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:26,654 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2021-08-25 20:22:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-25 20:22:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:26,655 INFO L225 Difference]: With dead ends: 324 [2021-08-25 20:22:26,655 INFO L226 Difference]: Without dead ends: 180 [2021-08-25 20:22:26,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-25 20:22:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-08-25 20:22:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-08-25 20:22:26,659 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2021-08-25 20:22:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:26,659 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-08-25 20:22:26,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-08-25 20:22:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-25 20:22:26,660 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:26,660 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:26,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:22:26,660 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2021-08-25 20:22:26,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:26,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178103688] [2021-08-25 20:22:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:26,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:26,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:26,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178103688] [2021-08-25 20:22:26,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178103688] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:26,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:26,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:26,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605343680] [2021-08-25 20:22:26,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:26,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:26,707 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:26,931 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2021-08-25 20:22:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:26,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-08-25 20:22:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:26,934 INFO L225 Difference]: With dead ends: 314 [2021-08-25 20:22:26,934 INFO L226 Difference]: Without dead ends: 170 [2021-08-25 20:22:26,935 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-25 20:22:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2021-08-25 20:22:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4691358024691359) internal successors, (238), 162 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2021-08-25 20:22:26,938 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2021-08-25 20:22:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:26,938 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2021-08-25 20:22:26,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2021-08-25 20:22:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:22:26,939 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:26,939 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:26,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:22:26,939 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2021-08-25 20:22:26,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:26,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024070445] [2021-08-25 20:22:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:26,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:27,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:27,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024070445] [2021-08-25 20:22:27,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024070445] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:27,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:27,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:27,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360893826] [2021-08-25 20:22:27,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:27,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:27,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:27,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:27,012 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:27,367 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2021-08-25 20:22:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:22:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:27,378 INFO L225 Difference]: With dead ends: 402 [2021-08-25 20:22:27,378 INFO L226 Difference]: Without dead ends: 258 [2021-08-25 20:22:27,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-08-25 20:22:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2021-08-25 20:22:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.5414634146341464) internal successors, (316), 205 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2021-08-25 20:22:27,384 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2021-08-25 20:22:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:27,384 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2021-08-25 20:22:27,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2021-08-25 20:22:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:22:27,386 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:27,386 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:27,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:22:27,386 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2021-08-25 20:22:27,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:27,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114365643] [2021-08-25 20:22:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:27,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:27,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:27,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114365643] [2021-08-25 20:22:27,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114365643] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:27,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:27,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:27,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999309871] [2021-08-25 20:22:27,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:27,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:27,435 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:27,739 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2021-08-25 20:22:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:27,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:22:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:27,741 INFO L225 Difference]: With dead ends: 442 [2021-08-25 20:22:27,741 INFO L226 Difference]: Without dead ends: 255 [2021-08-25 20:22:27,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-25 20:22:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2021-08-25 20:22:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5633187772925765) internal successors, (358), 229 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2021-08-25 20:22:27,747 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2021-08-25 20:22:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:27,747 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2021-08-25 20:22:27,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2021-08-25 20:22:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:27,748 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:27,748 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:27,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:22:27,748 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:27,749 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2021-08-25 20:22:27,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:27,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461909611] [2021-08-25 20:22:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:27,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:27,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:27,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461909611] [2021-08-25 20:22:27,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461909611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:27,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:27,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:27,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720328239] [2021-08-25 20:22:27,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:27,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:27,807 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:28,185 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2021-08-25 20:22:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:28,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:28,187 INFO L225 Difference]: With dead ends: 493 [2021-08-25 20:22:28,187 INFO L226 Difference]: Without dead ends: 282 [2021-08-25 20:22:28,188 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-25 20:22:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2021-08-25 20:22:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5589519650655022) internal successors, (357), 229 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2021-08-25 20:22:28,192 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2021-08-25 20:22:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:28,193 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2021-08-25 20:22:28,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2021-08-25 20:22:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:28,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:28,194 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:28,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:22:28,195 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2021-08-25 20:22:28,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:28,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804523398] [2021-08-25 20:22:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:28,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:28,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:28,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804523398] [2021-08-25 20:22:28,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804523398] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:28,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:28,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:28,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667116829] [2021-08-25 20:22:28,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:28,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:28,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:28,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:28,244 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:28,548 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2021-08-25 20:22:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:28,551 INFO L225 Difference]: With dead ends: 466 [2021-08-25 20:22:28,551 INFO L226 Difference]: Without dead ends: 255 [2021-08-25 20:22:28,552 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-25 20:22:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2021-08-25 20:22:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.554585152838428) internal successors, (356), 229 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2021-08-25 20:22:28,557 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2021-08-25 20:22:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:28,558 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2021-08-25 20:22:28,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2021-08-25 20:22:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:28,559 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:28,559 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:28,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:22:28,559 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:28,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2021-08-25 20:22:28,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:28,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130453604] [2021-08-25 20:22:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:28,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:28,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:28,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130453604] [2021-08-25 20:22:28,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130453604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:28,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:28,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:28,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465712733] [2021-08-25 20:22:28,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:28,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:28,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:28,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:28,617 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:28,988 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2021-08-25 20:22:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:28,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:28,990 INFO L225 Difference]: With dead ends: 492 [2021-08-25 20:22:28,990 INFO L226 Difference]: Without dead ends: 281 [2021-08-25 20:22:28,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-08-25 20:22:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2021-08-25 20:22:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5502183406113537) internal successors, (355), 229 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2021-08-25 20:22:28,995 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2021-08-25 20:22:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:28,995 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2021-08-25 20:22:28,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2021-08-25 20:22:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:28,996 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:28,997 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:28,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:22:28,997 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2021-08-25 20:22:28,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:28,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039577153] [2021-08-25 20:22:28,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:28,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:29,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:29,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039577153] [2021-08-25 20:22:29,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039577153] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:29,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:29,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:29,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870050489] [2021-08-25 20:22:29,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:29,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:29,052 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:29,410 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2021-08-25 20:22:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:29,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:29,412 INFO L225 Difference]: With dead ends: 490 [2021-08-25 20:22:29,412 INFO L226 Difference]: Without dead ends: 279 [2021-08-25 20:22:29,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-25 20:22:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2021-08-25 20:22:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 229 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2021-08-25 20:22:29,417 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2021-08-25 20:22:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:29,417 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2021-08-25 20:22:29,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2021-08-25 20:22:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:29,418 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:29,418 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:29,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:22:29,419 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2021-08-25 20:22:29,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:29,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529797891] [2021-08-25 20:22:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:29,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:29,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:29,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529797891] [2021-08-25 20:22:29,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529797891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:29,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:29,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:29,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118614280] [2021-08-25 20:22:29,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:29,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:29,487 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:29,831 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2021-08-25 20:22:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:29,832 INFO L225 Difference]: With dead ends: 489 [2021-08-25 20:22:29,832 INFO L226 Difference]: Without dead ends: 278 [2021-08-25 20:22:29,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-25 20:22:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2021-08-25 20:22:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5414847161572052) internal successors, (353), 229 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2021-08-25 20:22:29,841 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2021-08-25 20:22:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:29,842 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2021-08-25 20:22:29,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2021-08-25 20:22:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:29,843 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:29,843 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:29,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:22:29,844 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2021-08-25 20:22:29,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:29,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861687136] [2021-08-25 20:22:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:29,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-25 20:22:29,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:29,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861687136] [2021-08-25 20:22:29,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861687136] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:29,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:29,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:22:29,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810892453] [2021-08-25 20:22:29,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:22:29,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:22:29,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:29,925 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:30,270 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2021-08-25 20:22:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:22:30,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:30,272 INFO L225 Difference]: With dead ends: 462 [2021-08-25 20:22:30,272 INFO L226 Difference]: Without dead ends: 251 [2021-08-25 20:22:30,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:22:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-25 20:22:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2021-08-25 20:22:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5220883534136547) internal successors, (379), 249 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2021-08-25 20:22:30,278 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2021-08-25 20:22:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:30,278 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2021-08-25 20:22:30,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2021-08-25 20:22:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:30,280 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:30,280 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:30,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:22:30,280 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2021-08-25 20:22:30,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:30,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922588594] [2021-08-25 20:22:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:30,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:30,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:30,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922588594] [2021-08-25 20:22:30,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922588594] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:30,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:30,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:30,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685466032] [2021-08-25 20:22:30,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:30,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:30,333 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:30,585 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2021-08-25 20:22:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:30,587 INFO L225 Difference]: With dead ends: 503 [2021-08-25 20:22:30,587 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:22:30,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:22:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2021-08-25 20:22:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5180722891566265) internal successors, (378), 249 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2021-08-25 20:22:30,593 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2021-08-25 20:22:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:30,594 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2021-08-25 20:22:30,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2021-08-25 20:22:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:30,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:30,595 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:30,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:22:30,595 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2021-08-25 20:22:30,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:30,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104730413] [2021-08-25 20:22:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:30,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:30,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:30,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104730413] [2021-08-25 20:22:30,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104730413] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:30,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:30,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:30,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864982309] [2021-08-25 20:22:30,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:30,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:30,647 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:30,916 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2021-08-25 20:22:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:30,918 INFO L225 Difference]: With dead ends: 502 [2021-08-25 20:22:30,918 INFO L226 Difference]: Without dead ends: 271 [2021-08-25 20:22:30,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-25 20:22:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-08-25 20:22:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5140562248995983) internal successors, (377), 249 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2021-08-25 20:22:30,924 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2021-08-25 20:22:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:30,924 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2021-08-25 20:22:30,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2021-08-25 20:22:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:22:30,925 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:30,925 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:30,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:22:30,925 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2021-08-25 20:22:30,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:30,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140232999] [2021-08-25 20:22:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:30,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:30,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:30,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140232999] [2021-08-25 20:22:30,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140232999] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:30,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:30,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:30,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204103468] [2021-08-25 20:22:30,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:30,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:30,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:30,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:30,984 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:31,310 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2021-08-25 20:22:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:22:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:31,320 INFO L225 Difference]: With dead ends: 529 [2021-08-25 20:22:31,320 INFO L226 Difference]: Without dead ends: 298 [2021-08-25 20:22:31,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-08-25 20:22:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2021-08-25 20:22:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5100401606425702) internal successors, (376), 249 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2021-08-25 20:22:31,327 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2021-08-25 20:22:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:31,327 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2021-08-25 20:22:31,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2021-08-25 20:22:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:22:31,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:31,329 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:31,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:22:31,329 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2021-08-25 20:22:31,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:31,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758740785] [2021-08-25 20:22:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:31,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:31,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:31,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758740785] [2021-08-25 20:22:31,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758740785] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:31,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:31,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:31,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442991590] [2021-08-25 20:22:31,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:31,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:31,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:31,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:31,376 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:31,622 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2021-08-25 20:22:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:31,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:22:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:31,624 INFO L225 Difference]: With dead ends: 502 [2021-08-25 20:22:31,624 INFO L226 Difference]: Without dead ends: 271 [2021-08-25 20:22:31,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-25 20:22:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-08-25 20:22:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5060240963855422) internal successors, (375), 249 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2021-08-25 20:22:31,630 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2021-08-25 20:22:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:31,631 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2021-08-25 20:22:31,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2021-08-25 20:22:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:22:31,632 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:31,632 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:31,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:22:31,632 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2021-08-25 20:22:31,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:31,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809845547] [2021-08-25 20:22:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:31,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:31,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:31,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809845547] [2021-08-25 20:22:31,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809845547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:31,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:31,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:31,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261231856] [2021-08-25 20:22:31,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:31,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:31,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:31,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:31,682 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:32,039 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2021-08-25 20:22:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:32,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:22:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:32,040 INFO L225 Difference]: With dead ends: 529 [2021-08-25 20:22:32,041 INFO L226 Difference]: Without dead ends: 298 [2021-08-25 20:22:32,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-08-25 20:22:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2021-08-25 20:22:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.502008032128514) internal successors, (374), 249 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2021-08-25 20:22:32,046 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2021-08-25 20:22:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:32,047 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2021-08-25 20:22:32,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2021-08-25 20:22:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:22:32,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:32,047 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:32,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:22:32,048 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:32,049 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2021-08-25 20:22:32,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:32,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347449221] [2021-08-25 20:22:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:32,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:32,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:32,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347449221] [2021-08-25 20:22:32,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347449221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:32,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:32,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:32,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745601896] [2021-08-25 20:22:32,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:32,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:32,100 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:32,344 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2021-08-25 20:22:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:22:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:32,349 INFO L225 Difference]: With dead ends: 502 [2021-08-25 20:22:32,349 INFO L226 Difference]: Without dead ends: 271 [2021-08-25 20:22:32,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-25 20:22:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-08-25 20:22:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.497991967871486) internal successors, (373), 249 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2021-08-25 20:22:32,358 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2021-08-25 20:22:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:32,358 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2021-08-25 20:22:32,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2021-08-25 20:22:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:22:32,359 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:32,359 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:32,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:22:32,360 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:32,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:32,360 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2021-08-25 20:22:32,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:32,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916211947] [2021-08-25 20:22:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:32,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:32,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:32,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916211947] [2021-08-25 20:22:32,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916211947] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:32,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:32,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:32,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821821337] [2021-08-25 20:22:32,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:32,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:32,412 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:32,774 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2021-08-25 20:22:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:22:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:32,776 INFO L225 Difference]: With dead ends: 529 [2021-08-25 20:22:32,776 INFO L226 Difference]: Without dead ends: 298 [2021-08-25 20:22:32,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-08-25 20:22:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2021-08-25 20:22:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4939759036144578) internal successors, (372), 249 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2021-08-25 20:22:32,782 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2021-08-25 20:22:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:32,782 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2021-08-25 20:22:32,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2021-08-25 20:22:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:22:32,783 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:32,784 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:32,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:22:32,784 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2021-08-25 20:22:32,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:32,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500043916] [2021-08-25 20:22:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:32,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:32,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:32,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500043916] [2021-08-25 20:22:32,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500043916] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:32,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:32,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:32,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485956848] [2021-08-25 20:22:32,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:32,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:32,834 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:33,098 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2021-08-25 20:22:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:22:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:33,099 INFO L225 Difference]: With dead ends: 502 [2021-08-25 20:22:33,100 INFO L226 Difference]: Without dead ends: 271 [2021-08-25 20:22:33,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-25 20:22:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-08-25 20:22:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4899598393574298) internal successors, (371), 249 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2021-08-25 20:22:33,106 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2021-08-25 20:22:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:33,106 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2021-08-25 20:22:33,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2021-08-25 20:22:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:22:33,107 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:33,108 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:33,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:22:33,108 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2021-08-25 20:22:33,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:33,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790592425] [2021-08-25 20:22:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:33,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:33,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:33,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790592425] [2021-08-25 20:22:33,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790592425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:33,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:33,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:33,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665838543] [2021-08-25 20:22:33,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:33,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:33,162 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:33,495 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2021-08-25 20:22:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-08-25 20:22:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:33,497 INFO L225 Difference]: With dead ends: 519 [2021-08-25 20:22:33,497 INFO L226 Difference]: Without dead ends: 288 [2021-08-25 20:22:33,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-25 20:22:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2021-08-25 20:22:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4859437751004017) internal successors, (370), 249 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2021-08-25 20:22:33,503 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2021-08-25 20:22:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:33,503 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2021-08-25 20:22:33,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2021-08-25 20:22:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:22:33,504 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:33,504 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:33,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:22:33,505 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:33,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2021-08-25 20:22:33,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:33,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864214877] [2021-08-25 20:22:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:33,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:33,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:33,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864214877] [2021-08-25 20:22:33,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864214877] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:33,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:33,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:33,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983738461] [2021-08-25 20:22:33,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:33,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:33,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:33,552 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:33,803 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2021-08-25 20:22:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:33,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-08-25 20:22:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:33,805 INFO L225 Difference]: With dead ends: 492 [2021-08-25 20:22:33,805 INFO L226 Difference]: Without dead ends: 261 [2021-08-25 20:22:33,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-08-25 20:22:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2021-08-25 20:22:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4819277108433735) internal successors, (369), 249 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2021-08-25 20:22:33,813 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2021-08-25 20:22:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:33,813 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2021-08-25 20:22:33,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2021-08-25 20:22:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:22:33,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:33,814 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:33,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:22:33,815 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2021-08-25 20:22:33,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:33,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879682278] [2021-08-25 20:22:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:33,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:33,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:33,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879682278] [2021-08-25 20:22:33,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879682278] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:33,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:33,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:33,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362868875] [2021-08-25 20:22:33,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:33,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:33,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:33,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:33,876 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,177 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2021-08-25 20:22:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:22:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,178 INFO L225 Difference]: With dead ends: 519 [2021-08-25 20:22:34,178 INFO L226 Difference]: Without dead ends: 288 [2021-08-25 20:22:34,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-25 20:22:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2021-08-25 20:22:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4779116465863453) internal successors, (368), 249 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2021-08-25 20:22:34,184 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2021-08-25 20:22:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,184 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2021-08-25 20:22:34,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2021-08-25 20:22:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:22:34,186 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,186 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:22:34,186 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2021-08-25 20:22:34,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354073563] [2021-08-25 20:22:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:22:34,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:34,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354073563] [2021-08-25 20:22:34,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354073563] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:34,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:34,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:22:34,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944108709] [2021-08-25 20:22:34,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:22:34,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:34,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:22:34,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:34,229 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,275 INFO L93 Difference]: Finished difference Result 707 states and 1055 transitions. [2021-08-25 20:22:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:22:34,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:22:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,277 INFO L225 Difference]: With dead ends: 707 [2021-08-25 20:22:34,278 INFO L226 Difference]: Without dead ends: 476 [2021-08-25 20:22:34,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-08-25 20:22:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2021-08-25 20:22:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.4842105263157894) internal successors, (705), 475 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 705 transitions. [2021-08-25 20:22:34,288 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 705 transitions. Word has length 106 [2021-08-25 20:22:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,289 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 705 transitions. [2021-08-25 20:22:34,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 705 transitions. [2021-08-25 20:22:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:22:34,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,290 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:22:34,291 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580761, now seen corresponding path program 1 times [2021-08-25 20:22:34,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85499805] [2021-08-25 20:22:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-25 20:22:34,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:34,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85499805] [2021-08-25 20:22:34,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85499805] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:34,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:34,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:22:34,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615899489] [2021-08-25 20:22:34,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:22:34,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:34,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:22:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:34,324 INFO L87 Difference]: Start difference. First operand 476 states and 705 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,367 INFO L93 Difference]: Finished difference Result 960 states and 1425 transitions. [2021-08-25 20:22:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:22:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:22:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,370 INFO L225 Difference]: With dead ends: 960 [2021-08-25 20:22:34,370 INFO L226 Difference]: Without dead ends: 503 [2021-08-25 20:22:34,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-08-25 20:22:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2021-08-25 20:22:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.4741035856573705) internal successors, (740), 502 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 740 transitions. [2021-08-25 20:22:34,381 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 740 transitions. Word has length 106 [2021-08-25 20:22:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,382 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 740 transitions. [2021-08-25 20:22:34,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 740 transitions. [2021-08-25 20:22:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:22:34,383 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,383 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:22:34,384 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash 555304539, now seen corresponding path program 1 times [2021-08-25 20:22:34,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829337569] [2021-08-25 20:22:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-08-25 20:22:34,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:34,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829337569] [2021-08-25 20:22:34,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829337569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:34,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:34,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:22:34,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119197347] [2021-08-25 20:22:34,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:22:34,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:34,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:22:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:34,414 INFO L87 Difference]: Start difference. First operand 503 states and 740 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,431 INFO L93 Difference]: Finished difference Result 989 states and 1461 transitions. [2021-08-25 20:22:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:22:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:22:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,434 INFO L225 Difference]: With dead ends: 989 [2021-08-25 20:22:34,434 INFO L226 Difference]: Without dead ends: 505 [2021-08-25 20:22:34,435 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-08-25 20:22:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2021-08-25 20:22:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4722222222222223) internal successors, (742), 504 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 742 transitions. [2021-08-25 20:22:34,445 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 742 transitions. Word has length 106 [2021-08-25 20:22:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,446 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 742 transitions. [2021-08-25 20:22:34,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 742 transitions. [2021-08-25 20:22:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-08-25 20:22:34,447 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,447 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:22:34,448 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2021-08-25 20:22:34,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393609009] [2021-08-25 20:22:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:22:34,507 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:22:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:22:34,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:22:34,603 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:22:34,604 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:22:34,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:22:34,609 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:22:34,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:22:34 BoogieIcfgContainer [2021-08-25 20:22:34,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:22:34,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:22:34,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:22:34,685 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:22:34,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:20" (3/4) ... [2021-08-25 20:22:34,688 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:22:34,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:22:34,689 INFO L168 Benchmark]: Toolchain (without parser) took 16114.02 ms. Allocated memory was 56.6 MB in the beginning and 192.9 MB in the end (delta: 136.3 MB). Free memory was 33.3 MB in the beginning and 117.6 MB in the end (delta: -84.3 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:34,690 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 38.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:22:34,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.61 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.1 MB in the beginning and 46.6 MB in the end (delta: -13.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:34,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.78 ms. Allocated memory is still 69.2 MB. Free memory was 46.6 MB in the beginning and 42.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:34,690 INFO L168 Benchmark]: Boogie Preprocessor took 59.31 ms. Allocated memory is still 69.2 MB. Free memory was 42.2 MB in the beginning and 35.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:34,691 INFO L168 Benchmark]: RCFGBuilder took 1137.15 ms. Allocated memory was 69.2 MB in the beginning and 86.0 MB in the end (delta: 16.8 MB). Free memory was 35.2 MB in the beginning and 47.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:34,691 INFO L168 Benchmark]: TraceAbstraction took 14242.21 ms. Allocated memory was 86.0 MB in the beginning and 192.9 MB in the end (delta: 107.0 MB). Free memory was 47.2 MB in the beginning and 118.7 MB in the end (delta: -71.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:34,691 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 192.9 MB. Free memory was 118.7 MB in the beginning and 117.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:34,692 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.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 38.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 590.61 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.1 MB in the beginning and 46.6 MB in the end (delta: -13.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.78 ms. Allocated memory is still 69.2 MB. Free memory was 46.6 MB in the beginning and 42.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.31 ms. Allocated memory is still 69.2 MB. Free memory was 42.2 MB in the beginning and 35.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1137.15 ms. Allocated memory was 69.2 MB in the beginning and 86.0 MB in the end (delta: 16.8 MB). Free memory was 35.2 MB in the beginning and 47.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14242.21 ms. Allocated memory was 86.0 MB in the beginning and 192.9 MB in the end (delta: 107.0 MB). Free memory was 47.2 MB in the beginning and 118.7 MB in the end (delta: -71.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.38 ms. Allocated memory is still 192.9 MB. Free memory was 118.7 MB in the beginning and 117.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1704]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={5:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={5:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={5:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={5:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={5:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={5:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={5:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={5:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1231] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] COND FALSE !(! tmp___9) [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 2 [L1561] blastFlag = 4 VAL [init=1, SSLv3_server_data={5:0}] [L1569] COND FALSE !(ret <= 0) [L1574] s->state = 8672 [L1575] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={5:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1237] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={5:0}] [L1704] reach_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14108.6ms, OverallIterations: 41, TraceHistogramMax: 4, EmptinessCheckTime: 46.7ms, AutomataDifference: 10980.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7516 SDtfs, 2089 SDslu, 10975 SDs, 0 SdLazy, 6884 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8227.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 535.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=40, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 260.4ms AutomataMinimizationTime, 40 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 202.0ms SsaConstructionTime, 561.8ms SatisfiabilityAnalysisTime, 1552.7ms InterpolantComputationTime, 3500 NumberOfCodeBlocks, 3500 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 9298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 1736/1736 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 [2021-08-25 20:22:34,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:22:36,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:22:36,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:22:36,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:22:36,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:22:36,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:22:36,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:22:36,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:22:36,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:22:36,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:22:36,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:22:36,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:22:36,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:22:36,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:22:36,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:22:36,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:22:36,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:22:36,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:22:36,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:22:36,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:22:36,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:22:36,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:22:36,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:22:36,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:22:36,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:22:36,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:22:36,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:22:36,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:22:36,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:22:36,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:22:36,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:22:36,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:22:36,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:22:36,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:22:36,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:22:36,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:22:36,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:22:36,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:22:36,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:22:36,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:22:36,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:22:36,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:22:36,599 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:22:36,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:22:36,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:22:36,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:22:36,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:22:36,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:22:36,601 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:22:36,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:22:36,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:22:36,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:22:36,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:22:36,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:22:36,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:22:36,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:22:36,603 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:22:36,603 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:22:36,603 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:22:36,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:22:36,603 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:22:36,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:22:36,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:22:36,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:22:36,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:22:36,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:22:36,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:22:36,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:22:36,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:22:36,606 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:22:36,606 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:22:36,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:22:36,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:22:36,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:22:36,607 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 -> 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c [2021-08-25 20:22:36,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:22:36,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:22:36,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:22:36,971 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:22:36,971 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:22:36,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-08-25 20:22:37,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dcb97b0/cd34435c598b47629df4a69c64a5e480/FLAG2a7e9e7b0 [2021-08-25 20:22:37,611 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:22:37,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-08-25 20:22:37,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dcb97b0/cd34435c598b47629df4a69c64a5e480/FLAG2a7e9e7b0 [2021-08-25 20:22:38,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dcb97b0/cd34435c598b47629df4a69c64a5e480 [2021-08-25 20:22:38,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:22:38,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:22:38,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:22:38,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:22:38,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:22:38,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cbde25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38, skipping insertion in model container [2021-08-25 20:22:38,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:22:38,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:22:38,411 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[71320,71333] [2021-08-25 20:22:38,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:22:38,441 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:22:38,597 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[71320,71333] [2021-08-25 20:22:38,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:22:38,613 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:22:38,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38 WrapperNode [2021-08-25 20:22:38,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:22:38,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:22:38,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:22:38,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:22:38,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:22:38,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:22:38,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:22:38,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:22:38,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:22:38,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:22:38,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:22:38,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:22:38,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (1/1) ... [2021-08-25 20:22:38,816 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:22:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:22:38,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:22:38,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:22:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:22:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:22:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:22:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:22:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:22:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:22:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:22:38,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:22:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:22:39,052 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:22:40,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:22:40,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:22:40,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:22:40,464 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:22:40,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:40 BoogieIcfgContainer [2021-08-25 20:22:40,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:22:40,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:22:40,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:22:40,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:22:40,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:22:38" (1/3) ... [2021-08-25 20:22:40,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f56ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:22:40, skipping insertion in model container [2021-08-25 20:22:40,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:38" (2/3) ... [2021-08-25 20:22:40,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f56ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:22:40, skipping insertion in model container [2021-08-25 20:22:40,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:40" (3/3) ... [2021-08-25 20:22:40,472 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2021-08-25 20:22:40,477 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:22:40,477 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:22:40,524 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:22:40,528 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:22:40,528 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:22:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:22:40,547 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:40,548 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:40,548 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2021-08-25 20:22:40,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:22:40,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156374712] [2021-08-25 20:22:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:40,566 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:22:40,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:22:40,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:22:40,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:22:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:40,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:22:40,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:22:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:41,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:22:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:41,285 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:22:41,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156374712] [2021-08-25 20:22:41,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156374712] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:41,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:41,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:22:41,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099159850] [2021-08-25 20:22:41,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:41,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:22:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:41,313 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:41,460 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2021-08-25 20:22:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:22:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:41,472 INFO L225 Difference]: With dead ends: 540 [2021-08-25 20:22:41,472 INFO L226 Difference]: Without dead ends: 366 [2021-08-25 20:22:41,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-25 20:22:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-08-25 20:22:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.5232876712328767) internal successors, (556), 365 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2021-08-25 20:22:41,523 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2021-08-25 20:22:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:41,524 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2021-08-25 20:22:41,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2021-08-25 20:22:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:22:41,533 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:41,533 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:41,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-25 20:22:41,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:22:41,741 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2021-08-25 20:22:41,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:22:41,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280446671] [2021-08-25 20:22:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:41,743 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:22:41,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:22:41,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:22:41,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:22:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:41,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:22:41,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:22:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:42,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:22:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:42,706 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:22:42,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280446671] [2021-08-25 20:22:42,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280446671] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:42,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:42,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:22:42,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552328093] [2021-08-25 20:22:42,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:42,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:22:42,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:42,710 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:42,959 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2021-08-25 20:22:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:42,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-25 20:22:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:42,964 INFO L225 Difference]: With dead ends: 839 [2021-08-25 20:22:42,964 INFO L226 Difference]: Without dead ends: 600 [2021-08-25 20:22:42,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-08-25 20:22:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2021-08-25 20:22:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.5191986644407345) internal successors, (910), 599 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2021-08-25 20:22:42,999 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2021-08-25 20:22:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:43,001 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2021-08-25 20:22:43,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2021-08-25 20:22:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-08-25 20:22:43,010 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:43,011 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:43,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:22:43,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:22:43,212 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2021-08-25 20:22:43,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:22:43,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560368914] [2021-08-25 20:22:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:43,213 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:22:43,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:22:43,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:22:43,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:22:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:22:43,687 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:22:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:22:44,220 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:22:44,221 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:22:44,221 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:22:44,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:22:44,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:22:44,428 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:22:44,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:22:44 BoogieIcfgContainer [2021-08-25 20:22:44,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:22:44,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:22:44,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:22:44,583 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:22:44,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:40" (3/4) ... [2021-08-25 20:22:44,585 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:22:44,703 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:22:44,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:22:44,705 INFO L168 Benchmark]: Toolchain (without parser) took 6668.93 ms. Allocated memory was 69.2 MB in the beginning and 142.6 MB in the end (delta: 73.4 MB). Free memory was 47.2 MB in the beginning and 92.8 MB in the end (delta: -45.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:44,705 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 69.2 MB. Free memory was 50.1 MB in the beginning and 50.1 MB in the end (delta: 40.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:22:44,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.76 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 47.0 MB in the beginning and 73.1 MB in the end (delta: -26.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:44,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.82 ms. Allocated memory is still 96.5 MB. Free memory was 73.1 MB in the beginning and 68.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:44,707 INFO L168 Benchmark]: Boogie Preprocessor took 104.01 ms. Allocated memory is still 96.5 MB. Free memory was 68.4 MB in the beginning and 61.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:44,708 INFO L168 Benchmark]: RCFGBuilder took 1657.98 ms. Allocated memory is still 96.5 MB. Free memory was 61.7 MB in the beginning and 61.3 MB in the end (delta: 389.9 kB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:44,708 INFO L168 Benchmark]: TraceAbstraction took 4114.06 ms. Allocated memory was 96.5 MB in the beginning and 142.6 MB in the end (delta: 46.1 MB). Free memory was 61.3 MB in the beginning and 107.5 MB in the end (delta: -46.2 MB). Peak memory consumption was 78.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:44,708 INFO L168 Benchmark]: Witness Printer took 120.90 ms. Allocated memory is still 142.6 MB. Free memory was 107.5 MB in the beginning and 92.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:44,711 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.19 ms. Allocated memory is still 69.2 MB. Free memory was 50.1 MB in the beginning and 50.1 MB in the end (delta: 40.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 578.76 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 47.0 MB in the beginning and 73.1 MB in the end (delta: -26.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.82 ms. Allocated memory is still 96.5 MB. Free memory was 73.1 MB in the beginning and 68.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 104.01 ms. Allocated memory is still 96.5 MB. Free memory was 68.4 MB in the beginning and 61.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1657.98 ms. Allocated memory is still 96.5 MB. Free memory was 61.7 MB in the beginning and 61.3 MB in the end (delta: 389.9 kB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4114.06 ms. Allocated memory was 96.5 MB in the beginning and 142.6 MB in the end (delta: 46.1 MB). Free memory was 61.3 MB in the beginning and 107.5 MB in the end (delta: -46.2 MB). Peak memory consumption was 78.1 MB. Max. memory is 16.1 GB. * Witness Printer took 120.90 ms. Allocated memory is still 142.6 MB. Free memory was 107.5 MB in the beginning and 92.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1704]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1231] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] COND FALSE !(! tmp___9) [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 2 [L1561] blastFlag = 4 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1569] COND FALSE !(ret <= 0) [L1574] s->state = 8672 [L1575] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1237] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1704] reach_error() VAL [init=1, SSLv3_server_data={-2147483617:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3903.9ms, OverallIterations: 3, TraceHistogramMax: 4, EmptinessCheckTime: 28.2ms, AutomataDifference: 436.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 241.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 71.4ms AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 141.0ms SsaConstructionTime, 386.5ms SatisfiabilityAnalysisTime, 1277.2ms InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 417 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-25 20:22:44,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...