./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.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.11.i.cil-1.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 70c3bc063fdec0bf22217db797a4f26edc24e29e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.11.i.cil-1.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 70c3bc063fdec0bf22217db797a4f26edc24e29e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31:31,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:31:31,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:31:31,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:31:31,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:31:31,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:31:31,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:31:31,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:31:31,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:31:31,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:31:31,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:31:31,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:31:31,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:31:31,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:31:31,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:31:31,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:31:31,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:31:31,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:31:31,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:31:31,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:31:31,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:31:31,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:31:31,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:31:31,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:31:31,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:31:31,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:31:31,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:31:31,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:31:31,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:31:31,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:31:31,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:31:31,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:31:31,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:31:31,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:31:31,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:31:31,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:31:31,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:31:31,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:31:31,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:31:31,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:31:31,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:31:31,338 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:31:31,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:31:31,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:31:31,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:31:31,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:31:31,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:31:31,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:31:31,368 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:31:31,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:31:31,369 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:31:31,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:31:31,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:31:31,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:31:31,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:31:31,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:31:31,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:31:31,370 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:31:31,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:31:31,370 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:31:31,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:31:31,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:31:31,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:31:31,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:31:31,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:31,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:31:31,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:31:31,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:31:31,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:31:31,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:31:31,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:31:31,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:31:31,377 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 -> 70c3bc063fdec0bf22217db797a4f26edc24e29e [2021-08-25 20:31:31,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:31:31,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:31:31,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:31:31,663 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:31:31,663 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:31:31,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-08-25 20:31:31,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f84980e9/019cd6fc14074973bcbd01024a4a3723/FLAGb1a97aefa [2021-08-25 20:31:32,177 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:31:32,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-08-25 20:31:32,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f84980e9/019cd6fc14074973bcbd01024a4a3723/FLAGb1a97aefa [2021-08-25 20:31:32,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f84980e9/019cd6fc14074973bcbd01024a4a3723 [2021-08-25 20:31:32,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:31:32,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:31:32,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:32,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:31:32,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:31:32,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2529ed4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32, skipping insertion in model container [2021-08-25 20:31:32,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:31:32,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:31:32,539 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.11.i.cil-1.c[73189,73202] [2021-08-25 20:31:32,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:32,567 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:31:32,655 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.11.i.cil-1.c[73189,73202] [2021-08-25 20:31:32,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:32,687 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:31:32,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32 WrapperNode [2021-08-25 20:31:32,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:32,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:32,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:31:32,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:31:32,695 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:31:32" (1/1) ... [2021-08-25 20:31:32,724 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:31:32" (1/1) ... [2021-08-25 20:31:32,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:32,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:31:32,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:31:32,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:31:32,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:31:32,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:31:32,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:31:32,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:31:32,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (1/1) ... [2021-08-25 20:31:32,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:32,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:31:32,854 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:31:32,874 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:31:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:31:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:31:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:31:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:31:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:31:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:31:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:31:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:31:32,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:31:33,109 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:31:33,816 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:31:33,817 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:31:33,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:31:33,824 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:31:33,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:33 BoogieIcfgContainer [2021-08-25 20:31:33,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:31:33,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:31:33,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:31:33,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:31:33,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:31:32" (1/3) ... [2021-08-25 20:31:33,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545e2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:33, skipping insertion in model container [2021-08-25 20:31:33,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:32" (2/3) ... [2021-08-25 20:31:33,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545e2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:33, skipping insertion in model container [2021-08-25 20:31:33,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:33" (3/3) ... [2021-08-25 20:31:33,831 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-08-25 20:31:33,834 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:31:33,835 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:31:33,866 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:31:33,871 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:31:33,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:31:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7191780821917808) internal successors, (251), 147 states have internal predecessors, (251), 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:31:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:31:33,897 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:33,897 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] [2021-08-25 20:31:33,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2021-08-25 20:31:33,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:33,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024782312] [2021-08-25 20:31:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:33,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:34,161 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:31:34,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:34,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024782312] [2021-08-25 20:31:34,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024782312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:34,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:34,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:34,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333421109] [2021-08-25 20:31:34,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:34,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:34,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:34,180 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7191780821917808) internal successors, (251), 147 states have internal predecessors, (251), 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 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:31:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:34,630 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2021-08-25 20:31:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:34,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2021-08-25 20:31:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:34,641 INFO L225 Difference]: With dead ends: 323 [2021-08-25 20:31:34,641 INFO L226 Difference]: Without dead ends: 163 [2021-08-25 20:31:34,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-25 20:31:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-08-25 20:31:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5586206896551724) internal successors, (226), 145 states have internal predecessors, (226), 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:31:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2021-08-25 20:31:34,683 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2021-08-25 20:31:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:34,684 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2021-08-25 20:31:34,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:31:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2021-08-25 20:31:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-25 20:31:34,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:34,686 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] [2021-08-25 20:31:34,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:31:34,687 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:34,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:34,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2021-08-25 20:31:34,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:34,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562529711] [2021-08-25 20:31:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:34,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:34,775 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:31:34,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:34,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562529711] [2021-08-25 20:31:34,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562529711] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:34,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:34,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:34,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027868550] [2021-08-25 20:31:34,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:34,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:34,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:34,777 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:31:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:35,037 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2021-08-25 20:31:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:35,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2021-08-25 20:31:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:35,039 INFO L225 Difference]: With dead ends: 290 [2021-08-25 20:31:35,039 INFO L226 Difference]: Without dead ends: 163 [2021-08-25 20:31:35,040 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:31:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-25 20:31:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-08-25 20:31:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 145 states have internal predecessors, (225), 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:31:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2021-08-25 20:31:35,050 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2021-08-25 20:31:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:35,050 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2021-08-25 20:31:35,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:31:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2021-08-25 20:31:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-25 20:31:35,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:35,053 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] [2021-08-25 20:31:35,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:31:35,054 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2021-08-25 20:31:35,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:35,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138573533] [2021-08-25 20:31:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:35,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:35,151 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:31:35,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:35,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138573533] [2021-08-25 20:31:35,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138573533] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:35,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:35,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:35,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316788654] [2021-08-25 20:31:35,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:35,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:35,156 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:35,377 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2021-08-25 20:31:35,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:35,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2021-08-25 20:31:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:35,379 INFO L225 Difference]: With dead ends: 289 [2021-08-25 20:31:35,379 INFO L226 Difference]: Without dead ends: 162 [2021-08-25 20:31:35,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:31:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-25 20:31:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-08-25 20:31:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 145 states have internal predecessors, (224), 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:31:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2021-08-25 20:31:35,390 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2021-08-25 20:31:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:35,390 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2021-08-25 20:31:35,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2021-08-25 20:31:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-25 20:31:35,392 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:35,392 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] [2021-08-25 20:31:35,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:31:35,392 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2021-08-25 20:31:35,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:35,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663009312] [2021-08-25 20:31:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:35,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:35,434 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:31:35,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:35,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663009312] [2021-08-25 20:31:35,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663009312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:35,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:35,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:35,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233498705] [2021-08-25 20:31:35,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:35,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:35,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:35,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:35,436 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:35,656 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2021-08-25 20:31:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2021-08-25 20:31:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:35,670 INFO L225 Difference]: With dead ends: 287 [2021-08-25 20:31:35,670 INFO L226 Difference]: Without dead ends: 160 [2021-08-25 20:31:35,670 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:31:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-25 20:31:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-08-25 20:31:35,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 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:31:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2021-08-25 20:31:35,675 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2021-08-25 20:31:35,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:35,675 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2021-08-25 20:31:35,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2021-08-25 20:31:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-25 20:31:35,676 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:35,676 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] [2021-08-25 20:31:35,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:31:35,676 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2021-08-25 20:31:35,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:35,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829680552] [2021-08-25 20:31:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:35,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:35,753 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:31:35,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:35,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829680552] [2021-08-25 20:31:35,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829680552] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:35,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:35,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:35,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18914710] [2021-08-25 20:31:35,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:35,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:35,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:35,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:35,759 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:35,965 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2021-08-25 20:31:35,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:35,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2021-08-25 20:31:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:35,967 INFO L225 Difference]: With dead ends: 286 [2021-08-25 20:31:35,967 INFO L226 Difference]: Without dead ends: 159 [2021-08-25 20:31:35,967 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-25 20:31:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-08-25 20:31:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 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:31:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2021-08-25 20:31:35,979 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2021-08-25 20:31:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:35,979 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2021-08-25 20:31:35,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2021-08-25 20:31:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-25 20:31:35,981 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:35,981 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] [2021-08-25 20:31:35,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:31:35,981 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2021-08-25 20:31:35,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:35,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153413003] [2021-08-25 20:31:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:35,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:36,053 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:31:36,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:36,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153413003] [2021-08-25 20:31:36,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153413003] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:36,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:36,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:36,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395718598] [2021-08-25 20:31:36,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:36,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:36,060 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:36,269 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2021-08-25 20:31:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:36,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2021-08-25 20:31:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:36,270 INFO L225 Difference]: With dead ends: 286 [2021-08-25 20:31:36,270 INFO L226 Difference]: Without dead ends: 159 [2021-08-25 20:31:36,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-25 20:31:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-08-25 20:31:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 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:31:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2021-08-25 20:31:36,274 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2021-08-25 20:31:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:36,274 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2021-08-25 20:31:36,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2021-08-25 20:31:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-25 20:31:36,275 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:36,275 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] [2021-08-25 20:31:36,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:31:36,275 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2021-08-25 20:31:36,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:36,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832663257] [2021-08-25 20:31:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:36,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:36,310 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:31:36,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:36,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832663257] [2021-08-25 20:31:36,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832663257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:36,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:36,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:36,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108660663] [2021-08-25 20:31:36,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:36,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:36,311 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:31:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:36,502 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2021-08-25 20:31:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:36,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2021-08-25 20:31:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:36,503 INFO L225 Difference]: With dead ends: 286 [2021-08-25 20:31:36,503 INFO L226 Difference]: Without dead ends: 159 [2021-08-25 20:31:36,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:31:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-25 20:31:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-08-25 20:31:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 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:31:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2021-08-25 20:31:36,506 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2021-08-25 20:31:36,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:36,507 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2021-08-25 20:31:36,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:31:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2021-08-25 20:31:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 20:31:36,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:36,508 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] [2021-08-25 20:31:36,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:31:36,508 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2021-08-25 20:31:36,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:36,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651446059] [2021-08-25 20:31:36,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:36,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:36,541 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:31:36,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:36,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651446059] [2021-08-25 20:31:36,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651446059] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:36,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:36,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:36,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948155340] [2021-08-25 20:31:36,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:36,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:36,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:36,543 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:31:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:36,751 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2021-08-25 20:31:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:36,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2021-08-25 20:31:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:36,752 INFO L225 Difference]: With dead ends: 286 [2021-08-25 20:31:36,753 INFO L226 Difference]: Without dead ends: 159 [2021-08-25 20:31:36,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-25 20:31:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-08-25 20:31:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 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:31:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2021-08-25 20:31:36,756 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2021-08-25 20:31:36,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:36,756 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2021-08-25 20:31:36,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:31:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2021-08-25 20:31:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-25 20:31:36,756 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:36,756 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] [2021-08-25 20:31:36,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:31:36,757 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2021-08-25 20:31:36,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:36,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744194919] [2021-08-25 20:31:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:36,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:36,801 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:31:36,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:36,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744194919] [2021-08-25 20:31:36,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744194919] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:36,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:36,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:36,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208410460] [2021-08-25 20:31:36,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:36,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:36,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:36,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:36,804 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:31:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:36,965 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2021-08-25 20:31:36,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:36,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2021-08-25 20:31:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:36,966 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:31:36,966 INFO L226 Difference]: Without dead ends: 149 [2021-08-25 20:31:36,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-25 20:31:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-08-25 20:31:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 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:31:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2021-08-25 20:31:36,969 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2021-08-25 20:31:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:36,969 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2021-08-25 20:31:36,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:31:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2021-08-25 20:31:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-25 20:31:36,969 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:36,969 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] [2021-08-25 20:31:36,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:31:36,969 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:36,970 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2021-08-25 20:31:36,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:36,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571806349] [2021-08-25 20:31:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:36,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,002 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:31:37,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571806349] [2021-08-25 20:31:37,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571806349] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416396033] [2021-08-25 20:31:37,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,004 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:31:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:37,198 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2021-08-25 20:31:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2021-08-25 20:31:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:37,199 INFO L225 Difference]: With dead ends: 316 [2021-08-25 20:31:37,199 INFO L226 Difference]: Without dead ends: 189 [2021-08-25 20:31:37,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-08-25 20:31:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-08-25 20:31:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.532934131736527) internal successors, (256), 167 states have internal predecessors, (256), 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:31:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2021-08-25 20:31:37,202 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2021-08-25 20:31:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:37,202 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2021-08-25 20:31:37,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:31:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2021-08-25 20:31:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-25 20:31:37,203 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:37,203 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] [2021-08-25 20:31:37,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:31:37,203 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2021-08-25 20:31:37,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:37,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788874643] [2021-08-25 20:31:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:37,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,245 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:31:37,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788874643] [2021-08-25 20:31:37,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788874643] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009553919] [2021-08-25 20:31:37,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,246 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:31:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:37,459 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2021-08-25 20:31:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2021-08-25 20:31:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:37,460 INFO L225 Difference]: With dead ends: 338 [2021-08-25 20:31:37,460 INFO L226 Difference]: Without dead ends: 189 [2021-08-25 20:31:37,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-08-25 20:31:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-08-25 20:31:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.526946107784431) internal successors, (255), 167 states have internal predecessors, (255), 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:31:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2021-08-25 20:31:37,464 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2021-08-25 20:31:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:37,464 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2021-08-25 20:31:37,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:31:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2021-08-25 20:31:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-25 20:31:37,465 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:37,465 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] [2021-08-25 20:31:37,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:31:37,465 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:37,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2021-08-25 20:31:37,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:37,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070519216] [2021-08-25 20:31:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:37,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,497 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:31:37,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070519216] [2021-08-25 20:31:37,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070519216] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544446941] [2021-08-25 20:31:37,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,499 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:37,705 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2021-08-25 20:31:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2021-08-25 20:31:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:37,709 INFO L225 Difference]: With dead ends: 337 [2021-08-25 20:31:37,709 INFO L226 Difference]: Without dead ends: 188 [2021-08-25 20:31:37,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-25 20:31:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2021-08-25 20:31:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 167 states have internal predecessors, (254), 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:31:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2021-08-25 20:31:37,712 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2021-08-25 20:31:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:37,712 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2021-08-25 20:31:37,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2021-08-25 20:31:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-25 20:31:37,713 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:37,713 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] [2021-08-25 20:31:37,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:31:37,713 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2021-08-25 20:31:37,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:37,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765103075] [2021-08-25 20:31:37,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:37,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,746 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:31:37,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765103075] [2021-08-25 20:31:37,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765103075] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333075103] [2021-08-25 20:31:37,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,748 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:37,943 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2021-08-25 20:31:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2021-08-25 20:31:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:37,945 INFO L225 Difference]: With dead ends: 335 [2021-08-25 20:31:37,945 INFO L226 Difference]: Without dead ends: 186 [2021-08-25 20:31:37,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-25 20:31:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2021-08-25 20:31:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5149700598802396) internal successors, (253), 167 states have internal predecessors, (253), 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:31:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2021-08-25 20:31:37,949 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2021-08-25 20:31:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:37,949 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2021-08-25 20:31:37,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2021-08-25 20:31:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-25 20:31:37,950 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:37,950 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] [2021-08-25 20:31:37,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:31:37,950 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2021-08-25 20:31:37,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:37,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944887287] [2021-08-25 20:31:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:37,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,988 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:31:37,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944887287] [2021-08-25 20:31:37,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944887287] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193184024] [2021-08-25 20:31:37,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,990 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:38,182 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2021-08-25 20:31:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2021-08-25 20:31:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:38,183 INFO L225 Difference]: With dead ends: 334 [2021-08-25 20:31:38,183 INFO L226 Difference]: Without dead ends: 185 [2021-08-25 20:31:38,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-25 20:31:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-08-25 20:31:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5089820359281436) internal successors, (252), 167 states have internal predecessors, (252), 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:31:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2021-08-25 20:31:38,186 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2021-08-25 20:31:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:38,187 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2021-08-25 20:31:38,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2021-08-25 20:31:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-25 20:31:38,187 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:38,187 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] [2021-08-25 20:31:38,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:31:38,187 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2021-08-25 20:31:38,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:38,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973955823] [2021-08-25 20:31:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:38,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:38,216 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:31:38,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:38,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973955823] [2021-08-25 20:31:38,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973955823] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:38,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:38,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:38,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373543504] [2021-08-25 20:31:38,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:38,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:38,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:38,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:38,218 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:38,422 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-08-25 20:31:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:38,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2021-08-25 20:31:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:38,423 INFO L225 Difference]: With dead ends: 334 [2021-08-25 20:31:38,423 INFO L226 Difference]: Without dead ends: 185 [2021-08-25 20:31:38,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-25 20:31:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-08-25 20:31:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5029940119760479) internal successors, (251), 167 states have internal predecessors, (251), 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:31:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2021-08-25 20:31:38,426 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2021-08-25 20:31:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:38,427 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-08-25 20:31:38,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:31:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2021-08-25 20:31:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 20:31:38,427 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:38,427 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] [2021-08-25 20:31:38,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:31:38,427 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2021-08-25 20:31:38,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:38,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951837810] [2021-08-25 20:31:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:38,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:38,456 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:31:38,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:38,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951837810] [2021-08-25 20:31:38,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951837810] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:38,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:38,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:38,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543656372] [2021-08-25 20:31:38,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:38,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:38,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:38,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:38,458 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:31:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:38,651 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2021-08-25 20:31:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2021-08-25 20:31:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:38,652 INFO L225 Difference]: With dead ends: 334 [2021-08-25 20:31:38,652 INFO L226 Difference]: Without dead ends: 185 [2021-08-25 20:31:38,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-25 20:31:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-08-25 20:31:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.4970059880239521) internal successors, (250), 167 states have internal predecessors, (250), 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:31:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2021-08-25 20:31:38,655 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2021-08-25 20:31:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:38,655 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-08-25 20:31:38,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:31:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2021-08-25 20:31:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-25 20:31:38,656 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:38,656 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] [2021-08-25 20:31:38,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:31:38,656 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2021-08-25 20:31:38,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:38,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077308093] [2021-08-25 20:31:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:38,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:38,685 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:31:38,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:38,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077308093] [2021-08-25 20:31:38,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077308093] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:38,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:38,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:38,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180540775] [2021-08-25 20:31:38,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:38,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:38,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:38,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:38,687 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:31:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:38,887 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2021-08-25 20:31:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:38,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2021-08-25 20:31:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:38,888 INFO L225 Difference]: With dead ends: 334 [2021-08-25 20:31:38,888 INFO L226 Difference]: Without dead ends: 185 [2021-08-25 20:31:38,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-25 20:31:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-08-25 20:31:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 167 states have internal predecessors, (249), 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:31:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2021-08-25 20:31:38,891 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2021-08-25 20:31:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:38,891 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2021-08-25 20:31:38,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:31:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2021-08-25 20:31:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-25 20:31:38,892 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:38,892 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] [2021-08-25 20:31:38,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:31:38,892 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2021-08-25 20:31:38,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:38,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399989956] [2021-08-25 20:31:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:38,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:38,923 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:31:38,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:38,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399989956] [2021-08-25 20:31:38,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399989956] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:38,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:38,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:38,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473632839] [2021-08-25 20:31:38,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:38,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:38,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:38,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:38,925 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:31:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:39,104 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2021-08-25 20:31:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:39,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2021-08-25 20:31:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:39,105 INFO L225 Difference]: With dead ends: 324 [2021-08-25 20:31:39,105 INFO L226 Difference]: Without dead ends: 175 [2021-08-25 20:31:39,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-25 20:31:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2021-08-25 20:31:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 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:31:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2021-08-25 20:31:39,108 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2021-08-25 20:31:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:39,108 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2021-08-25 20:31:39,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:31:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2021-08-25 20:31:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:31:39,109 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:39,109 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] [2021-08-25 20:31:39,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:31:39,109 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2021-08-25 20:31:39,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:39,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565336553] [2021-08-25 20:31:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:39,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:39,158 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:31:39,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:39,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565336553] [2021-08-25 20:31:39,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565336553] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:39,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:39,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:39,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130456733] [2021-08-25 20:31:39,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:39,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:39,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:39,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:39,160 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:31:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:39,466 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2021-08-25 20:31:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:39,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 74 [2021-08-25 20:31:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:39,468 INFO L225 Difference]: With dead ends: 424 [2021-08-25 20:31:39,468 INFO L226 Difference]: Without dead ends: 275 [2021-08-25 20:31:39,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-25 20:31:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2021-08-25 20:31:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.5228426395939085) internal successors, (300), 197 states have internal predecessors, (300), 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:31:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2021-08-25 20:31:39,472 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2021-08-25 20:31:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:39,472 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2021-08-25 20:31:39,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:31:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2021-08-25 20:31:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:31:39,473 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:39,473 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] [2021-08-25 20:31:39,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:31:39,473 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2021-08-25 20:31:39,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:39,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303070958] [2021-08-25 20:31:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:39,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:39,516 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:31:39,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:39,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303070958] [2021-08-25 20:31:39,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303070958] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:39,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:39,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:39,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034169888] [2021-08-25 20:31:39,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:39,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:39,519 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:31:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:39,746 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2021-08-25 20:31:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:39,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 74 [2021-08-25 20:31:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:39,748 INFO L225 Difference]: With dead ends: 427 [2021-08-25 20:31:39,748 INFO L226 Difference]: Without dead ends: 248 [2021-08-25 20:31:39,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-08-25 20:31:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2021-08-25 20:31:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.5475113122171946) internal successors, (342), 221 states have internal predecessors, (342), 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:31:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2021-08-25 20:31:39,752 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2021-08-25 20:31:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:39,752 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-08-25 20:31:39,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:31:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2021-08-25 20:31:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:31:39,753 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:39,753 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] [2021-08-25 20:31:39,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:31:39,753 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2021-08-25 20:31:39,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:39,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878414086] [2021-08-25 20:31:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:39,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:39,808 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:31:39,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:39,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878414086] [2021-08-25 20:31:39,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878414086] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:39,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:39,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:39,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154702780] [2021-08-25 20:31:39,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:39,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:39,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:39,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:39,811 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:31:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:40,101 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2021-08-25 20:31:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:40,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:31:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:40,103 INFO L225 Difference]: With dead ends: 494 [2021-08-25 20:31:40,103 INFO L226 Difference]: Without dead ends: 291 [2021-08-25 20:31:40,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-08-25 20:31:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2021-08-25 20:31:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.545045045045045) internal successors, (343), 222 states have internal predecessors, (343), 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:31:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2021-08-25 20:31:40,107 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2021-08-25 20:31:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:40,108 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2021-08-25 20:31:40,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:31:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2021-08-25 20:31:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-25 20:31:40,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:40,109 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] [2021-08-25 20:31:40,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:31:40,109 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 301633263, now seen corresponding path program 1 times [2021-08-25 20:31:40,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:40,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960292771] [2021-08-25 20:31:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:40,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:40,146 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:31:40,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:40,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960292771] [2021-08-25 20:31:40,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960292771] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:40,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:40,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:40,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784262568] [2021-08-25 20:31:40,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:40,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:40,148 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:31:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:40,429 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2021-08-25 20:31:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 81 [2021-08-25 20:31:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:40,431 INFO L225 Difference]: With dead ends: 495 [2021-08-25 20:31:40,431 INFO L226 Difference]: Without dead ends: 291 [2021-08-25 20:31:40,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:31:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-08-25 20:31:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2021-08-25 20:31:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 232 states have internal predecessors, (362), 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:31:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2021-08-25 20:31:40,435 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 81 [2021-08-25 20:31:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:40,435 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2021-08-25 20:31:40,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:31:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2021-08-25 20:31:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-25 20:31:40,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:40,436 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] [2021-08-25 20:31:40,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:31:40,436 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash 542590269, now seen corresponding path program 1 times [2021-08-25 20:31:40,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:40,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966121672] [2021-08-25 20:31:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:40,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:40,474 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:31:40,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:40,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966121672] [2021-08-25 20:31:40,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966121672] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:40,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:40,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:40,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157169020] [2021-08-25 20:31:40,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:40,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:40,476 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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:31:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:40,743 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2021-08-25 20:31:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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 82 [2021-08-25 20:31:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:40,744 INFO L225 Difference]: With dead ends: 497 [2021-08-25 20:31:40,744 INFO L226 Difference]: Without dead ends: 283 [2021-08-25 20:31:40,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-25 20:31:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2021-08-25 20:31:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.55793991416309) internal successors, (363), 233 states have internal predecessors, (363), 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:31:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2021-08-25 20:31:40,748 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 82 [2021-08-25 20:31:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:40,748 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2021-08-25 20:31:40,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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:31:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2021-08-25 20:31:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:31:40,749 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:40,749 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] [2021-08-25 20:31:40,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:31:40,749 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2021-08-25 20:31:40,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:40,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199077779] [2021-08-25 20:31:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:40,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:40,788 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:31:40,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:40,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199077779] [2021-08-25 20:31:40,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199077779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:40,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:40,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:40,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410310911] [2021-08-25 20:31:40,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:40,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:40,790 INFO L87 Difference]: Start difference. First operand 234 states and 363 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:31:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:41,065 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2021-08-25 20:31:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:41,065 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 87 [2021-08-25 20:31:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:41,066 INFO L225 Difference]: With dead ends: 498 [2021-08-25 20:31:41,066 INFO L226 Difference]: Without dead ends: 283 [2021-08-25 20:31:41,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-25 20:31:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2021-08-25 20:31:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.553648068669528) internal successors, (362), 233 states have internal predecessors, (362), 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:31:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2021-08-25 20:31:41,070 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2021-08-25 20:31:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:41,070 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2021-08-25 20:31:41,070 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:31:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2021-08-25 20:31:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:31:41,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:41,071 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] [2021-08-25 20:31:41,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:31:41,071 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:41,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2021-08-25 20:31:41,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:41,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728746351] [2021-08-25 20:31:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:41,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,106 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:31:41,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728746351] [2021-08-25 20:31:41,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728746351] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061342431] [2021-08-25 20:31:41,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,108 INFO L87 Difference]: Start difference. First operand 234 states and 362 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:31:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:41,347 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2021-08-25 20:31:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:41,347 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 87 [2021-08-25 20:31:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:41,348 INFO L225 Difference]: With dead ends: 475 [2021-08-25 20:31:41,348 INFO L226 Difference]: Without dead ends: 260 [2021-08-25 20:31:41,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-08-25 20:31:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2021-08-25 20:31:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.5493562231759657) internal successors, (361), 233 states have internal predecessors, (361), 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:31:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2021-08-25 20:31:41,352 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2021-08-25 20:31:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:41,352 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2021-08-25 20:31:41,352 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:31:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2021-08-25 20:31:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:31:41,353 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:41,353 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] [2021-08-25 20:31:41,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:31:41,353 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2021-08-25 20:31:41,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:41,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185957447] [2021-08-25 20:31:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:41,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,387 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:31:41,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185957447] [2021-08-25 20:31:41,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185957447] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606585295] [2021-08-25 20:31:41,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,389 INFO L87 Difference]: Start difference. First operand 234 states and 361 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:31:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:41,653 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2021-08-25 20:31:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:41,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 88 [2021-08-25 20:31:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:41,655 INFO L225 Difference]: With dead ends: 497 [2021-08-25 20:31:41,655 INFO L226 Difference]: Without dead ends: 282 [2021-08-25 20:31:41,655 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-25 20:31:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2021-08-25 20:31:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.5450643776824033) internal successors, (360), 233 states have internal predecessors, (360), 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:31:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2021-08-25 20:31:41,659 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2021-08-25 20:31:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:41,659 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2021-08-25 20:31:41,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:31:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2021-08-25 20:31:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:31:41,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:41,659 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] [2021-08-25 20:31:41,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:31:41,660 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2021-08-25 20:31:41,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:41,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503535084] [2021-08-25 20:31:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:41,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,698 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:31:41,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503535084] [2021-08-25 20:31:41,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503535084] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113490981] [2021-08-25 20:31:41,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,700 INFO L87 Difference]: Start difference. First operand 234 states and 360 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:31:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:41,948 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2021-08-25 20:31:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:41,949 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 88 [2021-08-25 20:31:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:41,950 INFO L225 Difference]: With dead ends: 495 [2021-08-25 20:31:41,950 INFO L226 Difference]: Without dead ends: 280 [2021-08-25 20:31:41,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:31:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-08-25 20:31:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2021-08-25 20:31:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.5407725321888412) internal successors, (359), 233 states have internal predecessors, (359), 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:31:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2021-08-25 20:31:41,953 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2021-08-25 20:31:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:41,954 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2021-08-25 20:31:41,954 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:31:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2021-08-25 20:31:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:31:41,954 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:41,954 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] [2021-08-25 20:31:41,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:31:41,954 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:41,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2021-08-25 20:31:41,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:41,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024156495] [2021-08-25 20:31:41,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:41,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,987 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:31:41,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024156495] [2021-08-25 20:31:41,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024156495] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983075755] [2021-08-25 20:31:41,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,989 INFO L87 Difference]: Start difference. First operand 234 states and 359 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:31:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:42,254 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2021-08-25 20:31:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:42,254 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 88 [2021-08-25 20:31:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:42,255 INFO L225 Difference]: With dead ends: 494 [2021-08-25 20:31:42,255 INFO L226 Difference]: Without dead ends: 279 [2021-08-25 20:31:42,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:31:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-25 20:31:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2021-08-25 20:31:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.536480686695279) internal successors, (358), 233 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:31:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2021-08-25 20:31:42,260 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2021-08-25 20:31:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:42,260 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2021-08-25 20:31:42,260 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:31:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2021-08-25 20:31:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:31:42,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:42,260 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] [2021-08-25 20:31:42,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:31:42,261 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2021-08-25 20:31:42,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:42,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160259673] [2021-08-25 20:31:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:42,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:42,309 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:31:42,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:42,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160259673] [2021-08-25 20:31:42,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160259673] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:42,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:42,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:31:42,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553220989] [2021-08-25 20:31:42,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:31:42,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:31:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:42,311 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:31:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:42,598 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2021-08-25 20:31:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:31:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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 88 [2021-08-25 20:31:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:42,599 INFO L225 Difference]: With dead ends: 470 [2021-08-25 20:31:42,599 INFO L226 Difference]: Without dead ends: 255 [2021-08-25 20:31:42,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:31:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-25 20:31:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2021-08-25 20:31:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.517786561264822) internal successors, (384), 253 states have internal predecessors, (384), 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:31:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2021-08-25 20:31:42,603 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2021-08-25 20:31:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:42,603 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2021-08-25 20:31:42,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:31:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2021-08-25 20:31:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:31:42,604 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:42,604 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] [2021-08-25 20:31:42,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:31:42,604 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2021-08-25 20:31:42,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:42,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161626701] [2021-08-25 20:31:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:42,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:42,640 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:31:42,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:42,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161626701] [2021-08-25 20:31:42,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161626701] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:42,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:42,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:42,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523413055] [2021-08-25 20:31:42,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:42,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:42,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:42,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:42,642 INFO L87 Difference]: Start difference. First operand 254 states and 384 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:31:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:42,859 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2021-08-25 20:31:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:42,859 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 88 [2021-08-25 20:31:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:42,860 INFO L225 Difference]: With dead ends: 512 [2021-08-25 20:31:42,860 INFO L226 Difference]: Without dead ends: 277 [2021-08-25 20:31:42,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:31:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-08-25 20:31:42,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2021-08-25 20:31:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.5138339920948616) internal successors, (383), 253 states have internal predecessors, (383), 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:31:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2021-08-25 20:31:42,866 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2021-08-25 20:31:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:42,866 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2021-08-25 20:31:42,866 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:31:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2021-08-25 20:31:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:31:42,867 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:42,867 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] [2021-08-25 20:31:42,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:31:42,867 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:42,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2021-08-25 20:31:42,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:42,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669840788] [2021-08-25 20:31:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:42,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:42,918 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:31:42,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:42,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669840788] [2021-08-25 20:31:42,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669840788] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:42,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:42,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:42,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604373336] [2021-08-25 20:31:42,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:42,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:42,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:42,920 INFO L87 Difference]: Start difference. First operand 254 states and 383 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:31:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,148 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2021-08-25 20:31:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:43,149 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 88 [2021-08-25 20:31:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,150 INFO L225 Difference]: With dead ends: 511 [2021-08-25 20:31:43,151 INFO L226 Difference]: Without dead ends: 276 [2021-08-25 20:31:43,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-25 20:31:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-08-25 20:31:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.5098814229249011) internal successors, (382), 253 states have internal predecessors, (382), 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:31:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2021-08-25 20:31:43,156 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2021-08-25 20:31:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,156 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2021-08-25 20:31:43,156 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:31:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2021-08-25 20:31:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:31:43,157 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,157 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] [2021-08-25 20:31:43,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:31:43,157 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2021-08-25 20:31:43,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673866491] [2021-08-25 20:31:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,191 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:31:43,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673866491] [2021-08-25 20:31:43,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673866491] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:43,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533773082] [2021-08-25 20:31:43,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:43,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:43,193 INFO L87 Difference]: Start difference. First operand 254 states and 382 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:31:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,455 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2021-08-25 20:31:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:43,455 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 89 [2021-08-25 20:31:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,456 INFO L225 Difference]: With dead ends: 534 [2021-08-25 20:31:43,456 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:31:43,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:31:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-08-25 20:31:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.5059288537549407) internal successors, (381), 253 states have internal predecessors, (381), 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:31:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-08-25 20:31:43,461 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2021-08-25 20:31:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,461 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-08-25 20:31:43,461 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:31:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-08-25 20:31:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:31:43,461 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,461 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] [2021-08-25 20:31:43,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:31:43,462 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2021-08-25 20:31:43,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273054376] [2021-08-25 20:31:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,498 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:31:43,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273054376] [2021-08-25 20:31:43,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273054376] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:43,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251324652] [2021-08-25 20:31:43,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:43,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:43,500 INFO L87 Difference]: Start difference. First operand 254 states and 381 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:31:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,717 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2021-08-25 20:31:43,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:43,717 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 89 [2021-08-25 20:31:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,718 INFO L225 Difference]: With dead ends: 511 [2021-08-25 20:31:43,718 INFO L226 Difference]: Without dead ends: 276 [2021-08-25 20:31:43,718 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-25 20:31:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-08-25 20:31:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.5019762845849802) internal successors, (380), 253 states have internal predecessors, (380), 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:31:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2021-08-25 20:31:43,722 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2021-08-25 20:31:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,722 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2021-08-25 20:31:43,723 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:31:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2021-08-25 20:31:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-25 20:31:43,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,723 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] [2021-08-25 20:31:43,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:31:43,723 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2021-08-25 20:31:43,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592798702] [2021-08-25 20:31:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,761 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:31:43,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592798702] [2021-08-25 20:31:43,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592798702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:43,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277416133] [2021-08-25 20:31:43,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:43,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:43,763 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:31:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:44,014 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2021-08-25 20:31:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 90 [2021-08-25 20:31:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:44,015 INFO L225 Difference]: With dead ends: 534 [2021-08-25 20:31:44,015 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:31:44,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:31:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-08-25 20:31:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4980237154150198) internal successors, (379), 253 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:31:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2021-08-25 20:31:44,019 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2021-08-25 20:31:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:44,020 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2021-08-25 20:31:44,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:31:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2021-08-25 20:31:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-25 20:31:44,020 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:44,021 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] [2021-08-25 20:31:44,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:31:44,021 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2021-08-25 20:31:44,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:44,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379821914] [2021-08-25 20:31:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:44,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:44,053 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:31:44,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:44,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379821914] [2021-08-25 20:31:44,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379821914] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:44,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:44,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:44,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851763722] [2021-08-25 20:31:44,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:44,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:44,054 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:31:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:44,249 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2021-08-25 20:31:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 90 [2021-08-25 20:31:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:44,251 INFO L225 Difference]: With dead ends: 511 [2021-08-25 20:31:44,251 INFO L226 Difference]: Without dead ends: 276 [2021-08-25 20:31:44,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-25 20:31:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-08-25 20:31:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4940711462450593) internal successors, (378), 253 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:31:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2021-08-25 20:31:44,255 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2021-08-25 20:31:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:44,255 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2021-08-25 20:31:44,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:31:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2021-08-25 20:31:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-25 20:31:44,255 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:44,256 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] [2021-08-25 20:31:44,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:31:44,256 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2021-08-25 20:31:44,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:44,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062453591] [2021-08-25 20:31:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:44,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:44,301 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:31:44,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:44,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062453591] [2021-08-25 20:31:44,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062453591] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:44,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:44,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:44,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357869698] [2021-08-25 20:31:44,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:44,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:44,302 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:31:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:44,540 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2021-08-25 20:31:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 91 [2021-08-25 20:31:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:44,542 INFO L225 Difference]: With dead ends: 534 [2021-08-25 20:31:44,542 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:31:44,542 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:31:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:31:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-08-25 20:31:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4901185770750989) internal successors, (377), 253 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:31:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2021-08-25 20:31:44,546 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2021-08-25 20:31:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:44,547 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2021-08-25 20:31:44,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:31:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2021-08-25 20:31:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-25 20:31:44,547 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:44,547 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] [2021-08-25 20:31:44,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:31:44,548 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:44,548 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2021-08-25 20:31:44,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:44,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867334927] [2021-08-25 20:31:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:44,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:44,580 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:31:44,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:44,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867334927] [2021-08-25 20:31:44,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867334927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:44,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:44,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:44,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50282638] [2021-08-25 20:31:44,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:44,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:44,581 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:31:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:44,795 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2021-08-25 20:31:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 91 [2021-08-25 20:31:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:44,796 INFO L225 Difference]: With dead ends: 511 [2021-08-25 20:31:44,796 INFO L226 Difference]: Without dead ends: 276 [2021-08-25 20:31:44,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-25 20:31:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-08-25 20:31:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4861660079051384) internal successors, (376), 253 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:31:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2021-08-25 20:31:44,801 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2021-08-25 20:31:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:44,801 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2021-08-25 20:31:44,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:31:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2021-08-25 20:31:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-25 20:31:44,801 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:44,801 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] [2021-08-25 20:31:44,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:31:44,801 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2021-08-25 20:31:44,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:44,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554884525] [2021-08-25 20:31:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:44,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:44,845 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:31:44,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:44,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554884525] [2021-08-25 20:31:44,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554884525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:44,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:44,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:44,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784761478] [2021-08-25 20:31:44,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:44,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:44,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:44,847 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:31:45,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,096 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2021-08-25 20:31:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 92 [2021-08-25 20:31:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,097 INFO L225 Difference]: With dead ends: 524 [2021-08-25 20:31:45,097 INFO L226 Difference]: Without dead ends: 289 [2021-08-25 20:31:45,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-25 20:31:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2021-08-25 20:31:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.482213438735178) internal successors, (375), 253 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:31:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2021-08-25 20:31:45,102 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2021-08-25 20:31:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,102 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2021-08-25 20:31:45,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:31:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2021-08-25 20:31:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-25 20:31:45,103 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,103 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] [2021-08-25 20:31:45,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:31:45,103 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2021-08-25 20:31:45,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621724496] [2021-08-25 20:31:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,140 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:31:45,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621724496] [2021-08-25 20:31:45,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621724496] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:45,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296785107] [2021-08-25 20:31:45,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:45,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:45,142 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:31:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,368 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2021-08-25 20:31:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 92 [2021-08-25 20:31:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,370 INFO L225 Difference]: With dead ends: 501 [2021-08-25 20:31:45,370 INFO L226 Difference]: Without dead ends: 266 [2021-08-25 20:31:45,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-08-25 20:31:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2021-08-25 20:31:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4782608695652173) internal successors, (374), 253 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:31:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2021-08-25 20:31:45,375 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2021-08-25 20:31:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,375 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2021-08-25 20:31:45,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:31:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2021-08-25 20:31:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:31:45,376 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,376 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] [2021-08-25 20:31:45,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:31:45,376 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2021-08-25 20:31:45,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098029620] [2021-08-25 20:31:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,425 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:31:45,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098029620] [2021-08-25 20:31:45,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098029620] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:45,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631696414] [2021-08-25 20:31:45,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:45,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:45,428 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:31:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,701 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2021-08-25 20:31:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 96 [2021-08-25 20:31:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,702 INFO L225 Difference]: With dead ends: 524 [2021-08-25 20:31:45,702 INFO L226 Difference]: Without dead ends: 289 [2021-08-25 20:31:45,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-25 20:31:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2021-08-25 20:31:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4743083003952568) internal successors, (373), 253 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:31:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2021-08-25 20:31:45,707 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2021-08-25 20:31:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,707 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2021-08-25 20:31:45,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:31:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2021-08-25 20:31:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:31:45,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,708 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] [2021-08-25 20:31:45,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:31:45,708 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2021-08-25 20:31:45,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033949000] [2021-08-25 20:31:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,739 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:31:45,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033949000] [2021-08-25 20:31:45,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033949000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:45,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074855885] [2021-08-25 20:31:45,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:45,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:45,740 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:31:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,789 INFO L93 Difference]: Finished difference Result 719 states and 1071 transitions. [2021-08-25 20:31:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:45,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 96 [2021-08-25 20:31:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,791 INFO L225 Difference]: With dead ends: 719 [2021-08-25 20:31:45,791 INFO L226 Difference]: Without dead ends: 484 [2021-08-25 20:31:45,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-25 20:31:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2021-08-25 20:31:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4699792960662525) internal successors, (710), 483 states have internal predecessors, (710), 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:31:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 710 transitions. [2021-08-25 20:31:45,799 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 710 transitions. Word has length 96 [2021-08-25 20:31:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,799 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 710 transitions. [2021-08-25 20:31:45,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:31:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 710 transitions. [2021-08-25 20:31:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:31:45,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,800 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] [2021-08-25 20:31:45,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:31:45,800 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1537102738, now seen corresponding path program 1 times [2021-08-25 20:31:45,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057359661] [2021-08-25 20:31:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,824 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:31:45,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057359661] [2021-08-25 20:31:45,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057359661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:45,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188247269] [2021-08-25 20:31:45,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:45,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:45,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:45,825 INFO L87 Difference]: Start difference. First operand 484 states and 710 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:31:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,864 INFO L93 Difference]: Finished difference Result 976 states and 1435 transitions. [2021-08-25 20:31:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:45,864 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 96 [2021-08-25 20:31:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,865 INFO L225 Difference]: With dead ends: 976 [2021-08-25 20:31:45,866 INFO L226 Difference]: Without dead ends: 511 [2021-08-25 20:31:45,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-08-25 20:31:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-08-25 20:31:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.4607843137254901) internal successors, (745), 510 states have internal predecessors, (745), 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:31:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2021-08-25 20:31:45,884 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2021-08-25 20:31:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,885 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2021-08-25 20:31:45,885 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:31:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2021-08-25 20:31:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:31:45,886 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,886 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] [2021-08-25 20:31:45,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-25 20:31:45,886 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1564168340, now seen corresponding path program 1 times [2021-08-25 20:31:45,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915118432] [2021-08-25 20:31:45,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,914 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:31:45,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915118432] [2021-08-25 20:31:45,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915118432] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:45,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116581177] [2021-08-25 20:31:45,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:45,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:45,917 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:31:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,939 INFO L93 Difference]: Finished difference Result 1005 states and 1471 transitions. [2021-08-25 20:31:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 96 [2021-08-25 20:31:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,941 INFO L225 Difference]: With dead ends: 1005 [2021-08-25 20:31:45,941 INFO L226 Difference]: Without dead ends: 513 [2021-08-25 20:31:45,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-08-25 20:31:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-08-25 20:31:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.458984375) internal successors, (747), 512 states have internal predecessors, (747), 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:31:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 747 transitions. [2021-08-25 20:31:45,952 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 747 transitions. Word has length 96 [2021-08-25 20:31:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,953 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 747 transitions. [2021-08-25 20:31:45,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:31:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 747 transitions. [2021-08-25 20:31:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:31:45,954 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,954 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] [2021-08-25 20:31:45,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-25 20:31:45,955 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2021-08-25 20:31:45,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719145357] [2021-08-25 20:31:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:45,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719145357] [2021-08-25 20:31:45,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719145357] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:45,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123452622] [2021-08-25 20:31:45,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:45,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:45,993 INFO L87 Difference]: Start difference. First operand 513 states and 747 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:31:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:46,030 INFO L93 Difference]: Finished difference Result 1240 states and 1821 transitions. [2021-08-25 20:31:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:46,030 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 98 [2021-08-25 20:31:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:46,032 INFO L225 Difference]: With dead ends: 1240 [2021-08-25 20:31:46,032 INFO L226 Difference]: Without dead ends: 748 [2021-08-25 20:31:46,033 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-08-25 20:31:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2021-08-25 20:31:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.4697986577181208) internal successors, (1095), 745 states have internal predecessors, (1095), 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:31:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1095 transitions. [2021-08-25 20:31:46,044 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1095 transitions. Word has length 98 [2021-08-25 20:31:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:46,045 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1095 transitions. [2021-08-25 20:31:46,045 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:31:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1095 transitions. [2021-08-25 20:31:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:31:46,046 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:46,046 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] [2021-08-25 20:31:46,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-25 20:31:46,046 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1825940577, now seen corresponding path program 1 times [2021-08-25 20:31:46,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:46,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634527282] [2021-08-25 20:31:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:46,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:46,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:46,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634527282] [2021-08-25 20:31:46,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634527282] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:46,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:46,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:46,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315210947] [2021-08-25 20:31:46,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:46,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,081 INFO L87 Difference]: Start difference. First operand 746 states and 1095 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:31:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:46,132 INFO L93 Difference]: Finished difference Result 1706 states and 2515 transitions. [2021-08-25 20:31:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:46,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 105 [2021-08-25 20:31:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:46,135 INFO L225 Difference]: With dead ends: 1706 [2021-08-25 20:31:46,135 INFO L226 Difference]: Without dead ends: 981 [2021-08-25 20:31:46,136 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-08-25 20:31:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 979. [2021-08-25 20:31:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 1.4611451942740286) internal successors, (1429), 978 states have internal predecessors, (1429), 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:31:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1429 transitions. [2021-08-25 20:31:46,152 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1429 transitions. Word has length 105 [2021-08-25 20:31:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:46,152 INFO L470 AbstractCegarLoop]: Abstraction has 979 states and 1429 transitions. [2021-08-25 20:31:46,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:31:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1429 transitions. [2021-08-25 20:31:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:31:46,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:46,154 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, 1, 1, 1, 1, 1, 1, 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:31:46,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-25 20:31:46,154 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:46,155 INFO L82 PathProgramCache]: Analyzing trace with hash 315775349, now seen corresponding path program 1 times [2021-08-25 20:31:46,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:46,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002255877] [2021-08-25 20:31:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:46,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:46,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:46,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002255877] [2021-08-25 20:31:46,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002255877] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:46,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:46,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:46,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515239785] [2021-08-25 20:31:46,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:46,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:46,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,186 INFO L87 Difference]: Start difference. First operand 979 states and 1429 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:31:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:46,231 INFO L93 Difference]: Finished difference Result 2170 states and 3182 transitions. [2021-08-25 20:31:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 122 [2021-08-25 20:31:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:46,234 INFO L225 Difference]: With dead ends: 2170 [2021-08-25 20:31:46,234 INFO L226 Difference]: Without dead ends: 1212 [2021-08-25 20:31:46,235 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2021-08-25 20:31:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2021-08-25 20:31:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.4649050371593724) internal successors, (1774), 1211 states have internal predecessors, (1774), 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:31:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1774 transitions. [2021-08-25 20:31:46,255 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1774 transitions. Word has length 122 [2021-08-25 20:31:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:46,255 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 1774 transitions. [2021-08-25 20:31:46,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:31:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1774 transitions. [2021-08-25 20:31:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-25 20:31:46,256 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:46,257 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:46,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-25 20:31:46,257 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2021-08-25 20:31:46,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:46,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043401378] [2021-08-25 20:31:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:46,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:31:46,321 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:31:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:31:46,449 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:31:46,450 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:31:46,450 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:31:46,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-25 20:31:46,455 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:31:46,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:31:46 BoogieIcfgContainer [2021-08-25 20:31:46,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:31:46,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:31:46,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:31:46,542 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:31:46,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:33" (3/4) ... [2021-08-25 20:31:46,544 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:31:46,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:31:46,545 INFO L168 Benchmark]: Toolchain (without parser) took 14333.05 ms. Allocated memory was 54.5 MB in the beginning and 226.5 MB in the end (delta: 172.0 MB). Free memory was 31.0 MB in the beginning and 103.2 MB in the end (delta: -72.2 MB). Peak memory consumption was 98.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:46,545 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory is still 36.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:31:46,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.61 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.8 MB in the beginning and 45.4 MB in the end (delta: -14.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:46,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.79 ms. Allocated memory is still 67.1 MB. Free memory was 45.4 MB in the beginning and 40.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:46,546 INFO L168 Benchmark]: Boogie Preprocessor took 55.27 ms. Allocated memory is still 67.1 MB. Free memory was 40.8 MB in the beginning and 34.0 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:31:46,546 INFO L168 Benchmark]: RCFGBuilder took 1007.68 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 33.8 MB in the beginning and 51.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:46,547 INFO L168 Benchmark]: TraceAbstraction took 12714.51 ms. Allocated memory was 88.1 MB in the beginning and 226.5 MB in the end (delta: 138.4 MB). Free memory was 51.4 MB in the beginning and 104.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 86.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:46,547 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 226.5 MB. Free memory was 104.2 MB in the beginning and 103.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:31:46,548 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.14 ms. Allocated memory is still 54.5 MB. Free memory is still 36.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 472.61 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.8 MB in the beginning and 45.4 MB in the end (delta: -14.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.79 ms. Allocated memory is still 67.1 MB. Free memory was 45.4 MB in the beginning and 40.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.27 ms. Allocated memory is still 67.1 MB. Free memory was 40.8 MB in the beginning and 34.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1007.68 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 33.8 MB in the beginning and 51.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12714.51 ms. Allocated memory was 88.1 MB in the beginning and 226.5 MB in the end (delta: 138.4 MB). Free memory was 51.4 MB in the beginning and 104.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 86.6 MB. Max. memory is 16.1 GB. * Witness Printer took 2.63 ms. Allocated memory is still 226.5 MB. Free memory was 104.2 MB in the beginning and 103.2 MB in the end (delta: 1.0 MB). There was no memory consumed. 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: 1728]: 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 1446. 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)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [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}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 FALSE !(s->hit) [L1357] s->state = 8512 VAL [init=1, SSLv3_server_data={5:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8512 [L1363] EXPR s->s3 [L1363] EXPR (s->s3)->tmp.new_cipher [L1363] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={5:0}] [L1363] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1366] ret = __VERIFIER_nondet_int() [L1367] COND TRUE blastFlag == 2 [L1368] blastFlag = 6 VAL [init=1, SSLv3_server_data={5:0}] [L1372] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={5:0}] [L1378] s->state = 8528 [L1379] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8528 [L1383] EXPR s->s3 [L1383] EXPR (s->s3)->tmp.new_cipher [L1383] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1383] l = ((s->s3)->tmp.new_cipher)->algorithms [L1384] EXPR s->options VAL [init=1, SSLv3_server_data={5:0}] [L1384] COND TRUE s->options & 2097152UL [L1385] EXPR s->s3 [L1385] (s->s3)->tmp.use_rsa_tmp = 1 [L1389] EXPR s->s3 [L1389] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={5:0}] [L1389] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1407] ret = __VERIFIER_nondet_int() [L1408] COND TRUE blastFlag == 6 [L1409] blastFlag = 7 VAL [init=1, SSLv3_server_data={5:0}] [L1413] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={5:0}] [L1430] s->state = 8544 [L1431] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8544 [L1435] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={5:0}] [L1435] COND TRUE s->verify_mode & 1 [L1436] EXPR s->session [L1436] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={5:0}] [L1436] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1446] EXPR s->s3 [L1446] EXPR (s->s3)->tmp.new_cipher [L1446] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={5:0}] [L1446] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1456] EXPR s->s3 [L1456] (s->s3)->tmp.cert_request = 1 [L1457] ret = __VERIFIER_nondet_int() [L1458] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={5:0}] [L1728] reach_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12589.3ms, OverallIterations: 47, TraceHistogramMax: 5, EmptinessCheckTime: 44.3ms, AutomataDifference: 9818.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 9301 SDtfs, 2847 SDslu, 13200 SDs, 0 SdLazy, 7617 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7232.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 92 SyntacticMatches, 32 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 464.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1212occurred in iteration=46, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 269.3ms AutomataMinimizationTime, 46 MinimizatonAttempts, 1099 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 153.2ms SsaConstructionTime, 528.6ms SatisfiabilityAnalysisTime, 1298.4ms InterpolantComputationTime, 3665 NumberOfCodeBlocks, 3665 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3492 ConstructedInterpolants, 0 QuantifiedInterpolants, 10701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 2126/2126 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:31:46,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:31:48,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:31:48,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:31:48,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:31:48,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:31:48,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:31:48,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:31:48,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:31:48,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:31:48,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:31:48,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:31:48,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:31:48,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:31:48,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:31:48,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:31:48,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:31:48,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:31:48,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:31:48,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:31:48,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:31:48,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:31:48,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:31:48,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:31:48,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:31:48,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:31:48,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:31:48,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:31:48,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:31:48,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:31:48,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:31:48,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:31:48,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:31:48,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:31:48,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:31:48,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:31:48,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:31:48,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:31:48,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:31:48,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:31:48,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:31:48,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:31:48,119 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:31:48,151 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:31:48,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:31:48,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:31:48,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:31:48,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:31:48,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:31:48,154 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:31:48,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:31:48,155 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:31:48,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:31:48,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:31:48,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:31:48,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:31:48,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:31:48,156 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:31:48,156 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:31:48,156 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:31:48,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:31:48,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:31:48,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:31:48,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:31:48,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:31:48,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:31:48,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:48,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:31:48,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:31:48,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:31:48,158 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:31:48,158 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:31:48,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:31:48,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:31:48,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:31:48,159 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 -> 70c3bc063fdec0bf22217db797a4f26edc24e29e [2021-08-25 20:31:48,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:31:48,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:31:48,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:31:48,454 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:31:48,455 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:31:48,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-08-25 20:31:48,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8088563e/3cc377e1e6d24ec5964587252c455714/FLAGc01a04407 [2021-08-25 20:31:48,870 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:31:48,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-08-25 20:31:48,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8088563e/3cc377e1e6d24ec5964587252c455714/FLAGc01a04407 [2021-08-25 20:31:49,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8088563e/3cc377e1e6d24ec5964587252c455714 [2021-08-25 20:31:49,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:31:49,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:31:49,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:49,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:31:49,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:31:49,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d0f46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49, skipping insertion in model container [2021-08-25 20:31:49,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:31:49,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:31:49,602 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.11.i.cil-1.c[73189,73202] [2021-08-25 20:31:49,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:49,628 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:31:49,705 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.11.i.cil-1.c[73189,73202] [2021-08-25 20:31:49,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:49,723 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:31:49,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49 WrapperNode [2021-08-25 20:31:49,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:49,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:49,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:31:49,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:31:49,729 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:31:49" (1/1) ... [2021-08-25 20:31:49,744 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:31:49" (1/1) ... [2021-08-25 20:31:49,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:49,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:31:49,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:31:49,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:31:49,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:31:49,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:31:49,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:31:49,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:31:49,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (1/1) ... [2021-08-25 20:31:49,879 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:49,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:31:49,898 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:31:49,917 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:31:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:31:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:31:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:31:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:31:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:31:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:31:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:31:49,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:31:49,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:31:50,127 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:31:51,317 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:31:51,317 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:31:51,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:31:51,323 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:31:51,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:51 BoogieIcfgContainer [2021-08-25 20:31:51,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:31:51,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:31:51,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:31:51,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:31:51,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:31:49" (1/3) ... [2021-08-25 20:31:51,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7478a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:51, skipping insertion in model container [2021-08-25 20:31:51,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:49" (2/3) ... [2021-08-25 20:31:51,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7478a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:51, skipping insertion in model container [2021-08-25 20:31:51,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:51" (3/3) ... [2021-08-25 20:31:51,330 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-08-25 20:31:51,334 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:31:51,334 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:31:51,363 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:31:51,367 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:31:51,367 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:31:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7191780821917808) internal successors, (251), 147 states have internal predecessors, (251), 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:31:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:31:51,383 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:51,384 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] [2021-08-25 20:31:51,384 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:51,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2021-08-25 20:31:51,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:31:51,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191641210] [2021-08-25 20:31:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:51,397 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:31:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:31:51,403 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:31:51,421 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:31:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:51,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:31:51,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:31:51,751 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:31:51,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:31:51,888 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:31:51,889 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:31:51,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191641210] [2021-08-25 20:31:51,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191641210] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:51,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:51,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:31:51,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159444513] [2021-08-25 20:31:51,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:51,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:31:51,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:51,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:51,910 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7191780821917808) internal successors, (251), 147 states have internal predecessors, (251), 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 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:31:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:52,070 INFO L93 Difference]: Finished difference Result 561 states and 957 transitions. [2021-08-25 20:31:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 35 [2021-08-25 20:31:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:52,086 INFO L225 Difference]: With dead ends: 561 [2021-08-25 20:31:52,086 INFO L226 Difference]: Without dead ends: 382 [2021-08-25 20:31:52,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-08-25 20:31:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2021-08-25 20:31:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.5277044854881265) internal successors, (579), 379 states have internal predecessors, (579), 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:31:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2021-08-25 20:31:52,153 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 35 [2021-08-25 20:31:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:52,153 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2021-08-25 20:31:52,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:31:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2021-08-25 20:31:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:31:52,156 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:52,156 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] [2021-08-25 20:31:52,182 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:31:52,383 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:31:52,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:52,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1192573563, now seen corresponding path program 1 times [2021-08-25 20:31:52,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:31:52,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481745121] [2021-08-25 20:31:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:52,386 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:31:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:31:52,387 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:31:52,388 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:31:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:52,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:31:52,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:31:52,713 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:31:52,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:31:52,886 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:31:52,887 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:31:52,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481745121] [2021-08-25 20:31:52,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481745121] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:52,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:52,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:31:52,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606456896] [2021-08-25 20:31:52,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:52,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:31:52,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:52,898 INFO L87 Difference]: Start difference. First operand 380 states and 579 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:31:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:53,224 INFO L93 Difference]: Finished difference Result 876 states and 1345 transitions. [2021-08-25 20:31:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:31:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:53,227 INFO L225 Difference]: With dead ends: 876 [2021-08-25 20:31:53,227 INFO L226 Difference]: Without dead ends: 628 [2021-08-25 20:31:53,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-08-25 20:31:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2021-08-25 20:31:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.52) internal successors, (950), 625 states have internal predecessors, (950), 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:31:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 950 transitions. [2021-08-25 20:31:53,243 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 950 transitions. Word has length 59 [2021-08-25 20:31:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:53,243 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 950 transitions. [2021-08-25 20:31:53,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:31:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 950 transitions. [2021-08-25 20:31:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:31:53,251 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:53,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:53,262 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:31:53,459 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:31:53,459 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:53,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1680839393, now seen corresponding path program 1 times [2021-08-25 20:31:53,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:31:53,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857781510] [2021-08-25 20:31:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:53,460 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:31:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:31:53,461 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:31:53,462 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:31:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:53,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:31:53,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:31:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:53,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:31:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:54,288 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:31:54,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857781510] [2021-08-25 20:31:54,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857781510] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:54,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:54,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:31:54,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375921922] [2021-08-25 20:31:54,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:54,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:31:54,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:54,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:54,289 INFO L87 Difference]: Start difference. First operand 626 states and 950 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:31:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:54,519 INFO L93 Difference]: Finished difference Result 1366 states and 2085 transitions. [2021-08-25 20:31:54,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:54,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:31:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:54,522 INFO L225 Difference]: With dead ends: 1366 [2021-08-25 20:31:54,522 INFO L226 Difference]: Without dead ends: 872 [2021-08-25 20:31:54,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-08-25 20:31:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2021-08-25 20:31:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.5154994259471872) internal successors, (1320), 871 states have internal predecessors, (1320), 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:31:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1320 transitions. [2021-08-25 20:31:54,541 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1320 transitions. Word has length 103 [2021-08-25 20:31:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:54,541 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1320 transitions. [2021-08-25 20:31:54,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:31:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1320 transitions. [2021-08-25 20:31:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-25 20:31:54,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:54,543 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:54,553 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:31:54,751 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:31:54,751 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1159018067, now seen corresponding path program 1 times [2021-08-25 20:31:54,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:31:54,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352978472] [2021-08-25 20:31:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:54,752 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:31:54,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:31:54,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:31:54,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:31:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:55,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:31:55,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:31:55,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:31:55,314 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:31:55,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-08-25 20:31:55,509 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:31:55,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-25 20:31:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:31:55,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:31:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:31:55,997 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:31:55,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352978472] [2021-08-25 20:31:55,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352978472] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:55,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:55,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-08-25 20:31:55,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372438693] [2021-08-25 20:31:55,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:31:55,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:31:55,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:31:56,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:31:56,001 INFO L87 Difference]: Start difference. First operand 872 states and 1320 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:32:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:01,277 INFO L93 Difference]: Finished difference Result 3288 states and 4998 transitions. [2021-08-25 20:32:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:32:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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 127 [2021-08-25 20:32:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:01,293 INFO L225 Difference]: With dead ends: 3288 [2021-08-25 20:32:01,293 INFO L226 Difference]: Without dead ends: 2424 [2021-08-25 20:32:01,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:32:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2021-08-25 20:32:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1046. [2021-08-25 20:32:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 1.5502392344497609) internal successors, (1620), 1045 states have internal predecessors, (1620), 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:32:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1620 transitions. [2021-08-25 20:32:01,337 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1620 transitions. Word has length 127 [2021-08-25 20:32:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:01,337 INFO L470 AbstractCegarLoop]: Abstraction has 1046 states and 1620 transitions. [2021-08-25 20:32:01,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:32:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1620 transitions. [2021-08-25 20:32:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-25 20:32:01,340 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:01,340 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:01,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:01,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:01,553 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2021-08-25 20:32:01,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:01,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646763361] [2021-08-25 20:32:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:01,554 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:01,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:01,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:32:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:32:02,098 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:32:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:32:02,607 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:32:02,607 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:32:02,608 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:32:02,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:02,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:02,814 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:32:02,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:32:02 BoogieIcfgContainer [2021-08-25 20:32:02,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:32:02,896 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:32:02,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:32:02,897 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:32:02,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:51" (3/4) ... [2021-08-25 20:32:02,898 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:32:03,001 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:32:03,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:32:03,003 INFO L168 Benchmark]: Toolchain (without parser) took 13751.75 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 34.9 MB in the beginning and 62.8 MB in the end (delta: -27.9 MB). Peak memory consumption was 96.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:03,003 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 40.3 MB in the end (delta: 25.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:32:03,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.48 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.7 MB in the beginning and 49.2 MB in the end (delta: -14.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:03,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.12 ms. Allocated memory is still 71.3 MB. Free memory was 49.2 MB in the beginning and 44.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:03,004 INFO L168 Benchmark]: Boogie Preprocessor took 73.84 ms. Allocated memory is still 71.3 MB. Free memory was 44.7 MB in the beginning and 37.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:03,004 INFO L168 Benchmark]: RCFGBuilder took 1465.45 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 37.7 MB in the beginning and 53.3 MB in the end (delta: -15.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:03,004 INFO L168 Benchmark]: TraceAbstraction took 11570.73 ms. Allocated memory was 86.0 MB in the beginning and 182.5 MB in the end (delta: 96.5 MB). Free memory was 53.1 MB in the beginning and 77.5 MB in the end (delta: -24.4 MB). Peak memory consumption was 72.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:03,005 INFO L168 Benchmark]: Witness Printer took 105.51 ms. Allocated memory is still 182.5 MB. Free memory was 77.5 MB in the beginning and 62.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:32:03,006 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.20 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 40.3 MB in the end (delta: 25.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 472.48 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.7 MB in the beginning and 49.2 MB in the end (delta: -14.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.12 ms. Allocated memory is still 71.3 MB. Free memory was 49.2 MB in the beginning and 44.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 73.84 ms. Allocated memory is still 71.3 MB. Free memory was 44.7 MB in the beginning and 37.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1465.45 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 37.7 MB in the beginning and 53.3 MB in the end (delta: -15.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11570.73 ms. Allocated memory was 86.0 MB in the beginning and 182.5 MB in the end (delta: 96.5 MB). Free memory was 53.1 MB in the beginning and 77.5 MB in the end (delta: -24.4 MB). Peak memory consumption was 72.0 MB. Max. memory is 16.1 GB. * Witness Printer took 105.51 ms. Allocated memory is still 182.5 MB. Free memory was 77.5 MB in the beginning and 62.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: 1728]: 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)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [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}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 FALSE !(s->hit) [L1357] s->state = 8512 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8512 [L1363] EXPR s->s3 [L1363] EXPR (s->s3)->tmp.new_cipher [L1363] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1363] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1366] ret = __VERIFIER_nondet_int() [L1367] COND TRUE blastFlag == 2 [L1368] blastFlag = 6 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1372] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1378] s->state = 8528 [L1379] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8528 [L1383] EXPR s->s3 [L1383] EXPR (s->s3)->tmp.new_cipher [L1383] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1383] l = ((s->s3)->tmp.new_cipher)->algorithms [L1384] EXPR s->options VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1384] COND TRUE s->options & 2097152UL [L1385] EXPR s->s3 [L1385] (s->s3)->tmp.use_rsa_tmp = 1 [L1389] EXPR s->s3 [L1389] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1389] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1407] ret = __VERIFIER_nondet_int() [L1408] COND TRUE blastFlag == 6 [L1409] blastFlag = 7 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1413] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1430] s->state = 8544 [L1431] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8544 [L1435] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1435] COND TRUE s->verify_mode & 1 [L1436] EXPR s->session [L1436] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1436] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1446] EXPR s->s3 [L1446] EXPR (s->s3)->tmp.new_cipher [L1446] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1446] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1456] EXPR s->s3 [L1456] (s->s3)->tmp.cert_request = 1 [L1457] ret = __VERIFIER_nondet_int() [L1458] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1728] reach_error() VAL [init=1, SSLv3_server_data={-2147483617:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11451.2ms, OverallIterations: 5, TraceHistogramMax: 5, EmptinessCheckTime: 20.7ms, AutomataDifference: 6054.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1143 SDtfs, 1492 SDslu, 1653 SDs, 0 SdLazy, 816 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5221.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 628 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 82.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1046occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 129.6ms AutomataMinimizationTime, 4 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 184.1ms SsaConstructionTime, 592.1ms SatisfiabilityAnalysisTime, 2141.9ms InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 640 ConstructedInterpolants, 0 QuantifiedInterpolants, 1648 SizeOfPredicates, 3 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 506/506 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:32:03,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...