./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt --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 8822f5291178e45ba1da62c4d4636880280d6cc4 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-4e77c04 [2021-10-13 00:28:47,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:28:47,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:28:47,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:28:47,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:28:47,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:28:47,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:28:47,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:28:47,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:28:47,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:28:47,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:28:47,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:28:47,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:28:47,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:28:47,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:28:47,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:28:47,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:28:47,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:28:47,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:28:47,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:28:47,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:28:48,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:28:48,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:28:48,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:28:48,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:28:48,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:28:48,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:28:48,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:28:48,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:28:48,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:28:48,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:28:48,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:28:48,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:28:48,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:28:48,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:28:48,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:28:48,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:28:48,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:28:48,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:28:48,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:28:48,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:28:48,039 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:28:48,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:28:48,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:28:48,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:28:48,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:28:48,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:28:48,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:28:48,103 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:28:48,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:28:48,103 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:28:48,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:28:48,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:28:48,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:28:48,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:28:48,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:28:48,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:28:48,107 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:28:48,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:28:48,107 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:28:48,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:28:48,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:28:48,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:28:48,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:28:48,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:28:48,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:28:48,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:28:48,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:28:48,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:28:48,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:28:48,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:28:48,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:28:48,113 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt 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 -> 8822f5291178e45ba1da62c4d4636880280d6cc4 [2021-10-13 00:28:48,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:28:48,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:28:48,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:28:48,542 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:28:48,543 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:28:48,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2021-10-13 00:28:48,639 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/data/05ae79d32/73da559c66f347aaa0be58251514dba3/FLAGfcbd9d924 [2021-10-13 00:28:49,298 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:28:49,303 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2021-10-13 00:28:49,320 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/data/05ae79d32/73da559c66f347aaa0be58251514dba3/FLAGfcbd9d924 [2021-10-13 00:28:49,570 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/data/05ae79d32/73da559c66f347aaa0be58251514dba3 [2021-10-13 00:28:49,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:28:49,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:28:49,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:28:49,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:28:49,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:28:49,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:49" (1/1) ... [2021-10-13 00:28:49,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c9b8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:49, skipping insertion in model container [2021-10-13 00:28:49,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:49" (1/1) ... [2021-10-13 00:28:49,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:28:49,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:28:49,984 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c[49194,49207] [2021-10-13 00:28:49,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:28:50,003 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:28:50,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c[49194,49207] [2021-10-13 00:28:50,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:28:50,100 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:28:50,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50 WrapperNode [2021-10-13 00:28:50,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:28:50,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:28:50,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:28:50,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:28:50,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:28:50,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:28:50,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:28:50,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:28:50,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:28:50,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:28:50,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:28:50,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:28:50,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (1/1) ... [2021-10-13 00:28:50,329 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:28:50,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:28:50,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:28:50,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:28:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:28:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:28:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:28:50,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:28:50,612 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:28:51,523 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 00:28:51,523 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 00:28:51,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:28:51,533 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 00:28:51,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:51 BoogieIcfgContainer [2021-10-13 00:28:51,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:28:51,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:28:51,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:28:51,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:28:51,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:28:49" (1/3) ... [2021-10-13 00:28:51,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a1a563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:28:51, skipping insertion in model container [2021-10-13 00:28:51,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:50" (2/3) ... [2021-10-13 00:28:51,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a1a563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:28:51, skipping insertion in model container [2021-10-13 00:28:51,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:51" (3/3) ... [2021-10-13 00:28:51,556 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2021-10-13 00:28:51,570 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:28:51,570 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:28:51,656 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:28:51,667 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-10-13 00:28:51,668 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:28:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 165 states have (on average 1.7636363636363637) internal successors, (291), 166 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 00:28:51,714 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:51,715 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] [2021-10-13 00:28:51,716 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1659372905, now seen corresponding path program 1 times [2021-10-13 00:28:51,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:51,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597917] [2021-10-13 00:28:51,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:51,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:52,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:52,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597917] [2021-10-13 00:28:52,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:52,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:52,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:52,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877136359] [2021-10-13 00:28:52,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:52,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:52,212 INFO L87 Difference]: Start difference. First operand has 167 states, 165 states have (on average 1.7636363636363637) internal successors, (291), 166 states have internal predecessors, (291), 0 states have call successors, (0), 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 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:52,499 INFO L93 Difference]: Finished difference Result 353 states and 613 transitions. [2021-10-13 00:28:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:52,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-13 00:28:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:52,519 INFO L225 Difference]: With dead ends: 353 [2021-10-13 00:28:52,521 INFO L226 Difference]: Without dead ends: 174 [2021-10-13 00:28:52,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-13 00:28:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2021-10-13 00:28:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6198830409356726) internal successors, (277), 171 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 277 transitions. [2021-10-13 00:28:52,635 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 277 transitions. Word has length 28 [2021-10-13 00:28:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:52,636 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 277 transitions. [2021-10-13 00:28:52,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 277 transitions. [2021-10-13 00:28:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 00:28:52,640 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:52,641 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] [2021-10-13 00:28:52,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:28:52,642 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1067837001, now seen corresponding path program 1 times [2021-10-13 00:28:52,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:52,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476714119] [2021-10-13 00:28:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:52,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:52,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:52,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476714119] [2021-10-13 00:28:52,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476714119] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:52,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:52,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:52,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024599616] [2021-10-13 00:28:52,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:52,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:52,776 INFO L87 Difference]: Start difference. First operand 172 states and 277 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:52,986 INFO L93 Difference]: Finished difference Result 358 states and 575 transitions. [2021-10-13 00:28:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:52,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 00:28:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:52,995 INFO L225 Difference]: With dead ends: 358 [2021-10-13 00:28:52,995 INFO L226 Difference]: Without dead ends: 194 [2021-10-13 00:28:53,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-13 00:28:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-10-13 00:28:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.5906735751295338) internal successors, (307), 193 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 307 transitions. [2021-10-13 00:28:53,031 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 307 transitions. Word has length 29 [2021-10-13 00:28:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:53,032 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 307 transitions. [2021-10-13 00:28:53,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 307 transitions. [2021-10-13 00:28:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 00:28:53,040 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:53,041 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] [2021-10-13 00:28:53,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:28:53,042 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:53,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1369735938, now seen corresponding path program 1 times [2021-10-13 00:28:53,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:53,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801138412] [2021-10-13 00:28:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:53,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:53,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:53,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801138412] [2021-10-13 00:28:53,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801138412] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:53,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:53,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:53,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723735778] [2021-10-13 00:28:53,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:53,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:53,126 INFO L87 Difference]: Start difference. First operand 194 states and 307 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:53,315 INFO L93 Difference]: Finished difference Result 388 states and 616 transitions. [2021-10-13 00:28:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:53,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 00:28:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:53,318 INFO L225 Difference]: With dead ends: 388 [2021-10-13 00:28:53,319 INFO L226 Difference]: Without dead ends: 202 [2021-10-13 00:28:53,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-13 00:28:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2021-10-13 00:28:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 199 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2021-10-13 00:28:53,335 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 29 [2021-10-13 00:28:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:53,336 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2021-10-13 00:28:53,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2021-10-13 00:28:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 00:28:53,338 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:53,338 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] [2021-10-13 00:28:53,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:28:53,339 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:53,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1614302654, now seen corresponding path program 1 times [2021-10-13 00:28:53,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:53,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297633474] [2021-10-13 00:28:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:53,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:53,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:53,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297633474] [2021-10-13 00:28:53,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297633474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:53,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:53,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:53,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187930006] [2021-10-13 00:28:53,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:53,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:53,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:53,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:53,430 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:53,618 INFO L93 Difference]: Finished difference Result 393 states and 626 transitions. [2021-10-13 00:28:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:53,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 00:28:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:53,621 INFO L225 Difference]: With dead ends: 393 [2021-10-13 00:28:53,622 INFO L226 Difference]: Without dead ends: 201 [2021-10-13 00:28:53,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-13 00:28:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-10-13 00:28:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.595) internal successors, (319), 200 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 319 transitions. [2021-10-13 00:28:53,648 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 319 transitions. Word has length 29 [2021-10-13 00:28:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:53,649 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 319 transitions. [2021-10-13 00:28:53,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 319 transitions. [2021-10-13 00:28:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 00:28:53,652 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:53,652 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] [2021-10-13 00:28:53,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:28:53,653 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash -210698213, now seen corresponding path program 1 times [2021-10-13 00:28:53,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:53,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194674494] [2021-10-13 00:28:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:53,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:53,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:53,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194674494] [2021-10-13 00:28:53,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194674494] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:53,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:53,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:53,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025252943] [2021-10-13 00:28:53,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:53,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:53,752 INFO L87 Difference]: Start difference. First operand 201 states and 319 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:53,915 INFO L93 Difference]: Finished difference Result 404 states and 638 transitions. [2021-10-13 00:28:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:53,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-10-13 00:28:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:53,920 INFO L225 Difference]: With dead ends: 404 [2021-10-13 00:28:53,920 INFO L226 Difference]: Without dead ends: 211 [2021-10-13 00:28:53,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-13 00:28:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2021-10-13 00:28:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.585) internal successors, (317), 200 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 317 transitions. [2021-10-13 00:28:53,940 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 317 transitions. Word has length 30 [2021-10-13 00:28:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:53,940 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 317 transitions. [2021-10-13 00:28:53,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 317 transitions. [2021-10-13 00:28:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:28:53,944 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:53,944 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] [2021-10-13 00:28:53,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:28:53,945 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -852120702, now seen corresponding path program 1 times [2021-10-13 00:28:53,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:53,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712957946] [2021-10-13 00:28:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:53,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:54,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:54,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712957946] [2021-10-13 00:28:54,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712957946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:54,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:54,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:54,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389306949] [2021-10-13 00:28:54,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:54,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:54,047 INFO L87 Difference]: Start difference. First operand 201 states and 317 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:54,199 INFO L93 Difference]: Finished difference Result 404 states and 634 transitions. [2021-10-13 00:28:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-10-13 00:28:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:54,212 INFO L225 Difference]: With dead ends: 404 [2021-10-13 00:28:54,212 INFO L226 Difference]: Without dead ends: 211 [2021-10-13 00:28:54,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-13 00:28:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2021-10-13 00:28:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.575) internal successors, (315), 200 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 315 transitions. [2021-10-13 00:28:54,226 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 315 transitions. Word has length 31 [2021-10-13 00:28:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:54,226 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 315 transitions. [2021-10-13 00:28:54,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 315 transitions. [2021-10-13 00:28:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:28:54,228 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:54,228 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] [2021-10-13 00:28:54,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:28:54,228 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1795373184, now seen corresponding path program 1 times [2021-10-13 00:28:54,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:54,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514763753] [2021-10-13 00:28:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:54,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:54,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:54,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514763753] [2021-10-13 00:28:54,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514763753] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:54,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:54,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:54,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37083783] [2021-10-13 00:28:54,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:54,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:54,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:54,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:54,313 INFO L87 Difference]: Start difference. First operand 201 states and 315 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:54,450 INFO L93 Difference]: Finished difference Result 404 states and 630 transitions. [2021-10-13 00:28:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:54,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-13 00:28:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:54,458 INFO L225 Difference]: With dead ends: 404 [2021-10-13 00:28:54,458 INFO L226 Difference]: Without dead ends: 211 [2021-10-13 00:28:54,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-13 00:28:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2021-10-13 00:28:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.565) internal successors, (313), 200 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 313 transitions. [2021-10-13 00:28:54,477 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 313 transitions. Word has length 32 [2021-10-13 00:28:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:54,477 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 313 transitions. [2021-10-13 00:28:54,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions. [2021-10-13 00:28:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:28:54,479 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:54,479 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] [2021-10-13 00:28:54,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:28:54,480 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1439838815, now seen corresponding path program 1 times [2021-10-13 00:28:54,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:54,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359807060] [2021-10-13 00:28:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:54,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:54,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:54,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359807060] [2021-10-13 00:28:54,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359807060] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:54,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:54,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:28:54,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533074509] [2021-10-13 00:28:54,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:28:54,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:28:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:28:54,606 INFO L87 Difference]: Start difference. First operand 201 states and 313 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:54,884 INFO L93 Difference]: Finished difference Result 600 states and 930 transitions. [2021-10-13 00:28:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:28:54,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-13 00:28:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:54,890 INFO L225 Difference]: With dead ends: 600 [2021-10-13 00:28:54,890 INFO L226 Difference]: Without dead ends: 407 [2021-10-13 00:28:54,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:28:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-10-13 00:28:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2021-10-13 00:28:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.557591623036649) internal successors, (595), 382 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions. [2021-10-13 00:28:54,924 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 32 [2021-10-13 00:28:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:54,924 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 595 transitions. [2021-10-13 00:28:54,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions. [2021-10-13 00:28:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-13 00:28:54,928 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:54,929 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:28:54,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:28:54,929 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash -443745160, now seen corresponding path program 1 times [2021-10-13 00:28:54,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:54,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912304925] [2021-10-13 00:28:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:54,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:55,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:55,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912304925] [2021-10-13 00:28:55,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912304925] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:55,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:55,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:55,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802735402] [2021-10-13 00:28:55,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:55,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:55,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:55,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:55,048 INFO L87 Difference]: Start difference. First operand 383 states and 595 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:55,251 INFO L93 Difference]: Finished difference Result 842 states and 1324 transitions. [2021-10-13 00:28:55,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:55,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-10-13 00:28:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:55,259 INFO L225 Difference]: With dead ends: 842 [2021-10-13 00:28:55,259 INFO L226 Difference]: Without dead ends: 467 [2021-10-13 00:28:55,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-10-13 00:28:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 449. [2021-10-13 00:28:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.5848214285714286) internal successors, (710), 448 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-10-13 00:28:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 710 transitions. [2021-10-13 00:28:55,299 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 710 transitions. Word has length 44 [2021-10-13 00:28:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:55,303 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 710 transitions. [2021-10-13 00:28:55,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 710 transitions. [2021-10-13 00:28:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 00:28:55,304 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:55,304 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:28:55,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:28:55,305 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:55,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 974176282, now seen corresponding path program 1 times [2021-10-13 00:28:55,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:55,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188402978] [2021-10-13 00:28:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:55,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:55,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:55,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188402978] [2021-10-13 00:28:55,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188402978] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:55,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:55,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:55,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938424781] [2021-10-13 00:28:55,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:55,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:55,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:55,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:55,382 INFO L87 Difference]: Start difference. First operand 449 states and 710 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:55,575 INFO L93 Difference]: Finished difference Result 931 states and 1482 transitions. [2021-10-13 00:28:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:55,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-13 00:28:55,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:55,580 INFO L225 Difference]: With dead ends: 931 [2021-10-13 00:28:55,580 INFO L226 Difference]: Without dead ends: 490 [2021-10-13 00:28:55,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-13 00:28:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472. [2021-10-13 00:28:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5987261146496816) internal successors, (753), 471 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 753 transitions. [2021-10-13 00:28:55,608 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 753 transitions. Word has length 45 [2021-10-13 00:28:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:55,608 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 753 transitions. [2021-10-13 00:28:55,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 753 transitions. [2021-10-13 00:28:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-13 00:28:55,615 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:55,616 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 00:28:55,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:28:55,616 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1540899075, now seen corresponding path program 1 times [2021-10-13 00:28:55,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:55,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549525824] [2021-10-13 00:28:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:55,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 00:28:55,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:55,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549525824] [2021-10-13 00:28:55,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549525824] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:55,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:55,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:55,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627144209] [2021-10-13 00:28:55,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:55,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:55,717 INFO L87 Difference]: Start difference. First operand 472 states and 753 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:55,894 INFO L93 Difference]: Finished difference Result 988 states and 1578 transitions. [2021-10-13 00:28:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:55,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2021-10-13 00:28:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:55,899 INFO L225 Difference]: With dead ends: 988 [2021-10-13 00:28:55,899 INFO L226 Difference]: Without dead ends: 524 [2021-10-13 00:28:55,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-10-13 00:28:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506. [2021-10-13 00:28:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.5920792079207922) internal successors, (804), 505 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 804 transitions. [2021-10-13 00:28:55,928 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 804 transitions. Word has length 56 [2021-10-13 00:28:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:55,929 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 804 transitions. [2021-10-13 00:28:55,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 804 transitions. [2021-10-13 00:28:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-13 00:28:55,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:55,931 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 00:28:55,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:28:55,932 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1188180310, now seen corresponding path program 1 times [2021-10-13 00:28:55,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:55,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096388845] [2021-10-13 00:28:55,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:55,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 00:28:55,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:55,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096388845] [2021-10-13 00:28:55,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096388845] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:55,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:55,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:55,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022845025] [2021-10-13 00:28:55,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:55,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:55,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:55,989 INFO L87 Difference]: Start difference. First operand 506 states and 804 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:56,168 INFO L93 Difference]: Finished difference Result 1022 states and 1626 transitions. [2021-10-13 00:28:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 57 [2021-10-13 00:28:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:56,178 INFO L225 Difference]: With dead ends: 1022 [2021-10-13 00:28:56,178 INFO L226 Difference]: Without dead ends: 524 [2021-10-13 00:28:56,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-10-13 00:28:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506. [2021-10-13 00:28:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.5861386138613862) internal successors, (801), 505 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 801 transitions. [2021-10-13 00:28:56,211 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 801 transitions. Word has length 57 [2021-10-13 00:28:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:56,213 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 801 transitions. [2021-10-13 00:28:56,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 801 transitions. [2021-10-13 00:28:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-13 00:28:56,215 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:56,215 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:28:56,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:28:56,216 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2067348000, now seen corresponding path program 1 times [2021-10-13 00:28:56,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:56,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718195708] [2021-10-13 00:28:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:56,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 00:28:56,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:56,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718195708] [2021-10-13 00:28:56,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718195708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:56,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:56,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:56,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781901658] [2021-10-13 00:28:56,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:56,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:56,265 INFO L87 Difference]: Start difference. First operand 506 states and 801 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:56,481 INFO L93 Difference]: Finished difference Result 1069 states and 1697 transitions. [2021-10-13 00:28:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 57 [2021-10-13 00:28:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:56,487 INFO L225 Difference]: With dead ends: 1069 [2021-10-13 00:28:56,487 INFO L226 Difference]: Without dead ends: 571 [2021-10-13 00:28:56,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-10-13 00:28:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2021-10-13 00:28:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5809859154929577) internal successors, (898), 568 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 898 transitions. [2021-10-13 00:28:56,520 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 898 transitions. Word has length 57 [2021-10-13 00:28:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:56,522 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 898 transitions. [2021-10-13 00:28:56,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 898 transitions. [2021-10-13 00:28:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-13 00:28:56,524 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:56,524 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:28:56,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:28:56,525 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash -583256949, now seen corresponding path program 1 times [2021-10-13 00:28:56,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:56,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877125934] [2021-10-13 00:28:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:56,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:56,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:56,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877125934] [2021-10-13 00:28:56,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877125934] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:56,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:56,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:56,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338663834] [2021-10-13 00:28:56,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:56,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:56,583 INFO L87 Difference]: Start difference. First operand 569 states and 898 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-10-13 00:28:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:56,775 INFO L93 Difference]: Finished difference Result 1179 states and 1859 transitions. [2021-10-13 00:28:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:56,776 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 79 [2021-10-13 00:28:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:56,780 INFO L225 Difference]: With dead ends: 1179 [2021-10-13 00:28:56,781 INFO L226 Difference]: Without dead ends: 618 [2021-10-13 00:28:56,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-10-13 00:28:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2021-10-13 00:28:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 1.574468085106383) internal successors, (962), 611 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 962 transitions. [2021-10-13 00:28:56,817 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 962 transitions. Word has length 79 [2021-10-13 00:28:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:56,817 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 962 transitions. [2021-10-13 00:28:56,818 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-10-13 00:28:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 962 transitions. [2021-10-13 00:28:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-13 00:28:56,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:56,823 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-13 00:28:56,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:28:56,824 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:56,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1357251849, now seen corresponding path program 1 times [2021-10-13 00:28:56,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:56,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110514584] [2021-10-13 00:28:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:56,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:28:56,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:56,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110514584] [2021-10-13 00:28:56,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110514584] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:56,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:56,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:56,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172348285] [2021-10-13 00:28:56,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:56,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:56,873 INFO L87 Difference]: Start difference. First operand 612 states and 962 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-10-13 00:28:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:57,062 INFO L93 Difference]: Finished difference Result 1222 states and 1920 transitions. [2021-10-13 00:28:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:57,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 80 [2021-10-13 00:28:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:57,067 INFO L225 Difference]: With dead ends: 1222 [2021-10-13 00:28:57,068 INFO L226 Difference]: Without dead ends: 618 [2021-10-13 00:28:57,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-10-13 00:28:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2021-10-13 00:28:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 1.5695581014729951) internal successors, (959), 611 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 959 transitions. [2021-10-13 00:28:57,104 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 959 transitions. Word has length 80 [2021-10-13 00:28:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:57,105 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 959 transitions. [2021-10-13 00:28:57,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-10-13 00:28:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 959 transitions. [2021-10-13 00:28:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-13 00:28:57,107 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:57,108 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-10-13 00:28:57,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:28:57,108 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2054627548, now seen corresponding path program 1 times [2021-10-13 00:28:57,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:57,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774203997] [2021-10-13 00:28:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:57,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 00:28:57,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:57,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774203997] [2021-10-13 00:28:57,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774203997] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:57,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:57,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:57,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163788620] [2021-10-13 00:28:57,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:57,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:57,163 INFO L87 Difference]: Start difference. First operand 612 states and 959 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10-13 00:28:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:57,345 INFO L93 Difference]: Finished difference Result 1218 states and 1908 transitions. [2021-10-13 00:28:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:57,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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 85 [2021-10-13 00:28:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:57,350 INFO L225 Difference]: With dead ends: 1218 [2021-10-13 00:28:57,351 INFO L226 Difference]: Without dead ends: 614 [2021-10-13 00:28:57,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-10-13 00:28:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2021-10-13 00:28:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 1.5613747954173487) internal successors, (954), 611 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 954 transitions. [2021-10-13 00:28:57,389 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 954 transitions. Word has length 85 [2021-10-13 00:28:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:57,390 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 954 transitions. [2021-10-13 00:28:57,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10-13 00:28:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 954 transitions. [2021-10-13 00:28:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 00:28:57,392 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:57,392 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-13 00:28:57,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:28:57,393 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1047765588, now seen corresponding path program 1 times [2021-10-13 00:28:57,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:57,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512455140] [2021-10-13 00:28:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:57,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-13 00:28:57,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:57,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512455140] [2021-10-13 00:28:57,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512455140] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:57,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:57,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:57,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431926746] [2021-10-13 00:28:57,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:57,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:57,447 INFO L87 Difference]: Start difference. First operand 612 states and 954 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:57,639 INFO L93 Difference]: Finished difference Result 1276 states and 1991 transitions. [2021-10-13 00:28:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 93 [2021-10-13 00:28:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:57,644 INFO L225 Difference]: With dead ends: 1276 [2021-10-13 00:28:57,645 INFO L226 Difference]: Without dead ends: 672 [2021-10-13 00:28:57,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-10-13 00:28:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644. [2021-10-13 00:28:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5505443234836702) internal successors, (997), 643 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 997 transitions. [2021-10-13 00:28:57,681 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 997 transitions. Word has length 93 [2021-10-13 00:28:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:57,681 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 997 transitions. [2021-10-13 00:28:57,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 997 transitions. [2021-10-13 00:28:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-13 00:28:57,684 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:57,684 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 00:28:57,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:28:57,684 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:57,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1111400187, now seen corresponding path program 1 times [2021-10-13 00:28:57,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:57,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005131765] [2021-10-13 00:28:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:57,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-13 00:28:57,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:57,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005131765] [2021-10-13 00:28:57,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005131765] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:57,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:57,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:57,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832242265] [2021-10-13 00:28:57,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:57,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:57,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:57,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:57,731 INFO L87 Difference]: Start difference. First operand 644 states and 997 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-10-13 00:28:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:57,909 INFO L93 Difference]: Finished difference Result 1308 states and 2028 transitions. [2021-10-13 00:28:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:57,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 94 [2021-10-13 00:28:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:57,915 INFO L225 Difference]: With dead ends: 1308 [2021-10-13 00:28:57,915 INFO L226 Difference]: Without dead ends: 672 [2021-10-13 00:28:57,917 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-10-13 00:28:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644. [2021-10-13 00:28:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5412130637636081) internal successors, (991), 643 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 991 transitions. [2021-10-13 00:28:57,962 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 991 transitions. Word has length 94 [2021-10-13 00:28:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:57,963 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 991 transitions. [2021-10-13 00:28:57,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-10-13 00:28:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 991 transitions. [2021-10-13 00:28:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:28:57,966 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:57,967 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:28:57,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:28:57,967 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash -51700436, now seen corresponding path program 1 times [2021-10-13 00:28:57,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:57,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775607901] [2021-10-13 00:28:57,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:57,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 00:28:58,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:58,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775607901] [2021-10-13 00:28:58,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775607901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:58,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:58,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:58,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777899766] [2021-10-13 00:28:58,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:58,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:58,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:58,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:58,021 INFO L87 Difference]: Start difference. First operand 644 states and 991 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:58,241 INFO L93 Difference]: Finished difference Result 1344 states and 2068 transitions. [2021-10-13 00:28:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 00:28:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:58,247 INFO L225 Difference]: With dead ends: 1344 [2021-10-13 00:28:58,247 INFO L226 Difference]: Without dead ends: 708 [2021-10-13 00:28:58,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2021-10-13 00:28:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2021-10-13 00:28:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.5352517985611511) internal successors, (1067), 695 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2021-10-13 00:28:58,287 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2021-10-13 00:28:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:58,288 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2021-10-13 00:28:58,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2021-10-13 00:28:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 00:28:58,290 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:58,291 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:28:58,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:28:58,292 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:58,293 INFO L82 PathProgramCache]: Analyzing trace with hash -530812530, now seen corresponding path program 1 times [2021-10-13 00:28:58,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:58,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562442802] [2021-10-13 00:28:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:58,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 00:28:58,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:58,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562442802] [2021-10-13 00:28:58,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562442802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:58,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:58,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:58,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15432040] [2021-10-13 00:28:58,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:58,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:58,335 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:58,550 INFO L93 Difference]: Finished difference Result 1401 states and 2150 transitions. [2021-10-13 00:28:58,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-13 00:28:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:58,556 INFO L225 Difference]: With dead ends: 1401 [2021-10-13 00:28:58,556 INFO L226 Difference]: Without dead ends: 709 [2021-10-13 00:28:58,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-10-13 00:28:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 697. [2021-10-13 00:28:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.5344827586206897) internal successors, (1068), 696 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1068 transitions. [2021-10-13 00:28:58,592 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1068 transitions. Word has length 101 [2021-10-13 00:28:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:58,592 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 1068 transitions. [2021-10-13 00:28:58,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1068 transitions. [2021-10-13 00:28:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-13 00:28:58,595 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:58,595 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 00:28:58,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:28:58,596 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:58,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1306174224, now seen corresponding path program 1 times [2021-10-13 00:28:58,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:58,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155331431] [2021-10-13 00:28:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:58,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-10-13 00:28:58,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:58,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155331431] [2021-10-13 00:28:58,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155331431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:58,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:58,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:58,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113414589] [2021-10-13 00:28:58,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:58,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:58,638 INFO L87 Difference]: Start difference. First operand 697 states and 1068 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-10-13 00:28:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:58,832 INFO L93 Difference]: Finished difference Result 1433 states and 2192 transitions. [2021-10-13 00:28:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:58,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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 112 [2021-10-13 00:28:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:58,838 INFO L225 Difference]: With dead ends: 1433 [2021-10-13 00:28:58,838 INFO L226 Difference]: Without dead ends: 744 [2021-10-13 00:28:58,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-13 00:28:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738. [2021-10-13 00:28:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5237449118046134) internal successors, (1123), 737 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1123 transitions. [2021-10-13 00:28:58,882 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1123 transitions. Word has length 112 [2021-10-13 00:28:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:58,883 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1123 transitions. [2021-10-13 00:28:58,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-10-13 00:28:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1123 transitions. [2021-10-13 00:28:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-13 00:28:58,886 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:58,886 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 00:28:58,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:28:58,886 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:58,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:58,887 INFO L82 PathProgramCache]: Analyzing trace with hash -142977294, now seen corresponding path program 1 times [2021-10-13 00:28:58,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:58,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420860317] [2021-10-13 00:28:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:58,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-10-13 00:28:58,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:58,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420860317] [2021-10-13 00:28:58,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420860317] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:58,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:58,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:58,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119880449] [2021-10-13 00:28:58,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:58,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:58,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:58,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:58,929 INFO L87 Difference]: Start difference. First operand 738 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-10-13 00:28:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:59,121 INFO L93 Difference]: Finished difference Result 1474 states and 2242 transitions. [2021-10-13 00:28:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 113 [2021-10-13 00:28:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:59,128 INFO L225 Difference]: With dead ends: 1474 [2021-10-13 00:28:59,128 INFO L226 Difference]: Without dead ends: 744 [2021-10-13 00:28:59,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-13 00:28:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738. [2021-10-13 00:28:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5169606512890095) internal successors, (1118), 737 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2021-10-13 00:28:59,172 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 113 [2021-10-13 00:28:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:59,173 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2021-10-13 00:28:59,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-10-13 00:28:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2021-10-13 00:28:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-13 00:28:59,192 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:59,193 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-10-13 00:28:59,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:28:59,193 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:59,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1809562376, now seen corresponding path program 1 times [2021-10-13 00:28:59,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:59,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532908082] [2021-10-13 00:28:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:59,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 00:28:59,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:59,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532908082] [2021-10-13 00:28:59,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532908082] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:59,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:59,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:59,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231397970] [2021-10-13 00:28:59,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:59,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:59,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:59,236 INFO L87 Difference]: Start difference. First operand 738 states and 1118 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-10-13 00:28:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:59,418 INFO L93 Difference]: Finished difference Result 1510 states and 2285 transitions. [2021-10-13 00:28:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:59,419 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 115 [2021-10-13 00:28:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:59,425 INFO L225 Difference]: With dead ends: 1510 [2021-10-13 00:28:59,425 INFO L226 Difference]: Without dead ends: 780 [2021-10-13 00:28:59,427 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-10-13 00:28:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770. [2021-10-13 00:28:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.5032509752925878) internal successors, (1156), 769 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1156 transitions. [2021-10-13 00:28:59,473 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1156 transitions. Word has length 115 [2021-10-13 00:28:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:59,473 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1156 transitions. [2021-10-13 00:28:59,473 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-10-13 00:28:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1156 transitions. [2021-10-13 00:28:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-13 00:28:59,476 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:59,476 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-10-13 00:28:59,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:28:59,477 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash 172042817, now seen corresponding path program 1 times [2021-10-13 00:28:59,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:59,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513517347] [2021-10-13 00:28:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:59,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 00:28:59,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:59,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513517347] [2021-10-13 00:28:59,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513517347] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:59,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:59,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:59,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408065521] [2021-10-13 00:28:59,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:59,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:59,530 INFO L87 Difference]: Start difference. First operand 770 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:59,680 INFO L93 Difference]: Finished difference Result 1542 states and 2314 transitions. [2021-10-13 00:28:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:59,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 116 [2021-10-13 00:28:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:59,687 INFO L225 Difference]: With dead ends: 1542 [2021-10-13 00:28:59,688 INFO L226 Difference]: Without dead ends: 780 [2021-10-13 00:28:59,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-10-13 00:28:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770. [2021-10-13 00:28:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.4915474642392719) internal successors, (1147), 769 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1147 transitions. [2021-10-13 00:28:59,735 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1147 transitions. Word has length 116 [2021-10-13 00:28:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:28:59,736 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1147 transitions. [2021-10-13 00:28:59,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1147 transitions. [2021-10-13 00:28:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-13 00:28:59,739 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:28:59,740 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-10-13 00:28:59,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:28:59,740 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:28:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:28:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1961382768, now seen corresponding path program 1 times [2021-10-13 00:28:59,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:28:59,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087382316] [2021-10-13 00:28:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:28:59,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:28:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:28:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-10-13 00:28:59,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:28:59,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087382316] [2021-10-13 00:28:59,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087382316] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:28:59,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:28:59,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:28:59,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487989421] [2021-10-13 00:28:59,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:28:59,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:28:59,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:28:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:59,793 INFO L87 Difference]: Start difference. First operand 770 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:28:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:28:59,976 INFO L93 Difference]: Finished difference Result 1568 states and 2335 transitions. [2021-10-13 00:28:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:28:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2021-10-13 00:28:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:28:59,983 INFO L225 Difference]: With dead ends: 1568 [2021-10-13 00:28:59,983 INFO L226 Difference]: Without dead ends: 806 [2021-10-13 00:28:59,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:28:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-10-13 00:29:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798. [2021-10-13 00:29:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.478042659974906) internal successors, (1178), 797 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1178 transitions. [2021-10-13 00:29:00,050 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1178 transitions. Word has length 137 [2021-10-13 00:29:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:00,050 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1178 transitions. [2021-10-13 00:29:00,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1178 transitions. [2021-10-13 00:29:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-10-13 00:29:00,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:00,055 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-10-13 00:29:00,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:29:00,056 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1483046825, now seen corresponding path program 1 times [2021-10-13 00:29:00,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:00,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26469577] [2021-10-13 00:29:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:00,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-10-13 00:29:00,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:00,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26469577] [2021-10-13 00:29:00,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26469577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:00,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:00,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:00,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567462231] [2021-10-13 00:29:00,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:00,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:00,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:00,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:00,114 INFO L87 Difference]: Start difference. First operand 798 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-10-13 00:29:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:00,291 INFO L93 Difference]: Finished difference Result 1596 states and 2356 transitions. [2021-10-13 00:29:00,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:00,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 138 [2021-10-13 00:29:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:00,298 INFO L225 Difference]: With dead ends: 1596 [2021-10-13 00:29:00,298 INFO L226 Difference]: Without dead ends: 806 [2021-10-13 00:29:00,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-10-13 00:29:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798. [2021-10-13 00:29:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.465495608531995) internal successors, (1168), 797 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1168 transitions. [2021-10-13 00:29:00,348 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1168 transitions. Word has length 138 [2021-10-13 00:29:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:00,348 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1168 transitions. [2021-10-13 00:29:00,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-10-13 00:29:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1168 transitions. [2021-10-13 00:29:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-10-13 00:29:00,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:00,353 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-13 00:29:00,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:29:00,353 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1313212300, now seen corresponding path program 1 times [2021-10-13 00:29:00,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:00,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420818246] [2021-10-13 00:29:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:00,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-10-13 00:29:00,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:00,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420818246] [2021-10-13 00:29:00,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420818246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:00,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:00,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:00,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078111648] [2021-10-13 00:29:00,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:00,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:00,414 INFO L87 Difference]: Start difference. First operand 798 states and 1168 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:00,610 INFO L93 Difference]: Finished difference Result 1651 states and 2410 transitions. [2021-10-13 00:29:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:00,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 141 [2021-10-13 00:29:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:00,617 INFO L225 Difference]: With dead ends: 1651 [2021-10-13 00:29:00,617 INFO L226 Difference]: Without dead ends: 861 [2021-10-13 00:29:00,619 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-10-13 00:29:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 847. [2021-10-13 00:29:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 1.4527186761229314) internal successors, (1229), 846 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1229 transitions. [2021-10-13 00:29:00,674 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1229 transitions. Word has length 141 [2021-10-13 00:29:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:00,674 INFO L470 AbstractCegarLoop]: Abstraction has 847 states and 1229 transitions. [2021-10-13 00:29:00,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1229 transitions. [2021-10-13 00:29:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-10-13 00:29:00,678 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:00,678 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 00:29:00,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:29:00,679 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash 75909554, now seen corresponding path program 1 times [2021-10-13 00:29:00,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:00,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926448541] [2021-10-13 00:29:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:00,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-10-13 00:29:00,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:00,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926448541] [2021-10-13 00:29:00,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926448541] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:00,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:00,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:00,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874332984] [2021-10-13 00:29:00,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:00,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:00,752 INFO L87 Difference]: Start difference. First operand 847 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:00,946 INFO L93 Difference]: Finished difference Result 1700 states and 2468 transitions. [2021-10-13 00:29:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:00,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 142 [2021-10-13 00:29:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:00,952 INFO L225 Difference]: With dead ends: 1700 [2021-10-13 00:29:00,952 INFO L226 Difference]: Without dead ends: 845 [2021-10-13 00:29:00,954 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-10-13 00:29:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 831. [2021-10-13 00:29:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.453012048192771) internal successors, (1206), 830 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1206 transitions. [2021-10-13 00:29:01,010 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1206 transitions. Word has length 142 [2021-10-13 00:29:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:01,010 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1206 transitions. [2021-10-13 00:29:01,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1206 transitions. [2021-10-13 00:29:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-13 00:29:01,014 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:01,014 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-10-13 00:29:01,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:29:01,015 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2072592764, now seen corresponding path program 1 times [2021-10-13 00:29:01,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:01,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029771529] [2021-10-13 00:29:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:01,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-10-13 00:29:01,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:01,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029771529] [2021-10-13 00:29:01,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029771529] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:01,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:01,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:01,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245684336] [2021-10-13 00:29:01,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:01,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:01,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:01,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:01,059 INFO L87 Difference]: Start difference. First operand 831 states and 1206 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-10-13 00:29:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:01,255 INFO L93 Difference]: Finished difference Result 1666 states and 2418 transitions. [2021-10-13 00:29:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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 146 [2021-10-13 00:29:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:01,262 INFO L225 Difference]: With dead ends: 1666 [2021-10-13 00:29:01,262 INFO L226 Difference]: Without dead ends: 843 [2021-10-13 00:29:01,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-10-13 00:29:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 831. [2021-10-13 00:29:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.4445783132530121) internal successors, (1199), 830 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1199 transitions. [2021-10-13 00:29:01,314 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1199 transitions. Word has length 146 [2021-10-13 00:29:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:01,314 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1199 transitions. [2021-10-13 00:29:01,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-10-13 00:29:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1199 transitions. [2021-10-13 00:29:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-10-13 00:29:01,318 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:01,318 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-10-13 00:29:01,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:29:01,319 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash 369501830, now seen corresponding path program 1 times [2021-10-13 00:29:01,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:01,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353031980] [2021-10-13 00:29:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:01,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-10-13 00:29:01,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:01,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353031980] [2021-10-13 00:29:01,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353031980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:01,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:01,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:01,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055724799] [2021-10-13 00:29:01,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:01,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:01,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:01,381 INFO L87 Difference]: Start difference. First operand 831 states and 1199 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:01,574 INFO L93 Difference]: Finished difference Result 1666 states and 2404 transitions. [2021-10-13 00:29:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:01,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2021-10-13 00:29:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:01,580 INFO L225 Difference]: With dead ends: 1666 [2021-10-13 00:29:01,581 INFO L226 Difference]: Without dead ends: 826 [2021-10-13 00:29:01,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-10-13 00:29:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 814. [2021-10-13 00:29:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.4391143911439115) internal successors, (1170), 813 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1170 transitions. [2021-10-13 00:29:01,656 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1170 transitions. Word has length 147 [2021-10-13 00:29:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:01,656 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1170 transitions. [2021-10-13 00:29:01,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1170 transitions. [2021-10-13 00:29:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-10-13 00:29:01,662 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:01,662 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:01,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 00:29:01,663 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:01,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1770310156, now seen corresponding path program 1 times [2021-10-13 00:29:01,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:01,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522514440] [2021-10-13 00:29:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:01,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-10-13 00:29:01,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:01,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522514440] [2021-10-13 00:29:01,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522514440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:01,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:01,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:01,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583467637] [2021-10-13 00:29:01,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:01,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:01,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:01,720 INFO L87 Difference]: Start difference. First operand 814 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:01,800 INFO L93 Difference]: Finished difference Result 2412 states and 3460 transitions. [2021-10-13 00:29:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:01,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-10-13 00:29:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:01,812 INFO L225 Difference]: With dead ends: 2412 [2021-10-13 00:29:01,813 INFO L226 Difference]: Without dead ends: 1606 [2021-10-13 00:29:01,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-10-13 00:29:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 816. [2021-10-13 00:29:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 1.4380368098159508) internal successors, (1172), 815 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1172 transitions. [2021-10-13 00:29:01,875 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1172 transitions. Word has length 154 [2021-10-13 00:29:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:01,876 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1172 transitions. [2021-10-13 00:29:01,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1172 transitions. [2021-10-13 00:29:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-10-13 00:29:01,878 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:01,878 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:01,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 00:29:01,879 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1570716982, now seen corresponding path program 1 times [2021-10-13 00:29:01,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:01,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618557176] [2021-10-13 00:29:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:01,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2021-10-13 00:29:01,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:01,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618557176] [2021-10-13 00:29:01,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618557176] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:01,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:01,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:01,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385687689] [2021-10-13 00:29:01,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:01,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:01,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:01,955 INFO L87 Difference]: Start difference. First operand 816 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:02,070 INFO L93 Difference]: Finished difference Result 2411 states and 3456 transitions. [2021-10-13 00:29:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-10-13 00:29:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:02,082 INFO L225 Difference]: With dead ends: 2411 [2021-10-13 00:29:02,082 INFO L226 Difference]: Without dead ends: 1603 [2021-10-13 00:29:02,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2021-10-13 00:29:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1601. [2021-10-13 00:29:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 1.4325) internal successors, (2292), 1600 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2292 transitions. [2021-10-13 00:29:02,239 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2292 transitions. Word has length 154 [2021-10-13 00:29:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:02,240 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 2292 transitions. [2021-10-13 00:29:02,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2292 transitions. [2021-10-13 00:29:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-13 00:29:02,244 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:02,245 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:02,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 00:29:02,245 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -362729202, now seen corresponding path program 1 times [2021-10-13 00:29:02,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:02,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371081190] [2021-10-13 00:29:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:02,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-10-13 00:29:02,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:02,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371081190] [2021-10-13 00:29:02,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371081190] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:02,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:02,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:02,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182064245] [2021-10-13 00:29:02,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:02,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:02,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:02,418 INFO L87 Difference]: Start difference. First operand 1601 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:02,632 INFO L93 Difference]: Finished difference Result 4747 states and 6780 transitions. [2021-10-13 00:29:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-10-13 00:29:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:02,653 INFO L225 Difference]: With dead ends: 4747 [2021-10-13 00:29:02,653 INFO L226 Difference]: Without dead ends: 3154 [2021-10-13 00:29:02,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2021-10-13 00:29:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 1601. [2021-10-13 00:29:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 1.43) internal successors, (2288), 1600 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2288 transitions. [2021-10-13 00:29:02,815 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2288 transitions. Word has length 156 [2021-10-13 00:29:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:02,815 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 2288 transitions. [2021-10-13 00:29:02,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2288 transitions. [2021-10-13 00:29:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-13 00:29:02,818 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:02,819 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:02,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 00:29:02,819 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash -957693967, now seen corresponding path program 1 times [2021-10-13 00:29:02,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:02,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579888295] [2021-10-13 00:29:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:02,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-13 00:29:02,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:02,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579888295] [2021-10-13 00:29:02,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579888295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:02,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:02,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:02,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458731932] [2021-10-13 00:29:02,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:02,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:02,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:02,875 INFO L87 Difference]: Start difference. First operand 1601 states and 2288 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:03,140 INFO L93 Difference]: Finished difference Result 4783 states and 6836 transitions. [2021-10-13 00:29:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:03,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 157 [2021-10-13 00:29:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:03,161 INFO L225 Difference]: With dead ends: 4783 [2021-10-13 00:29:03,161 INFO L226 Difference]: Without dead ends: 3190 [2021-10-13 00:29:03,164 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2021-10-13 00:29:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3188. [2021-10-13 00:29:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 3187 states have (on average 1.4032005020395357) internal successors, (4472), 3187 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4472 transitions. [2021-10-13 00:29:03,363 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4472 transitions. Word has length 157 [2021-10-13 00:29:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:03,364 INFO L470 AbstractCegarLoop]: Abstraction has 3188 states and 4472 transitions. [2021-10-13 00:29:03,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4472 transitions. [2021-10-13 00:29:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-13 00:29:03,367 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:03,367 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:03,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 00:29:03,368 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:29:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash -3753809, now seen corresponding path program 1 times [2021-10-13 00:29:03,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:03,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217501706] [2021-10-13 00:29:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:03,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:29:03,400 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:29:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:29:03,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:29:03,520 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:29:03,521 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:03,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 00:29:03,531 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:29:03,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:29:03 BoogieIcfgContainer [2021-10-13 00:29:03,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:29:03,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:29:03,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:29:03,681 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:29:03,681 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:51" (3/4) ... [2021-10-13 00:29:03,684 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:29:03,896 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:29:03,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:29:03,898 INFO L168 Benchmark]: Toolchain (without parser) took 14319.44 ms. Allocated memory was 127.9 MB in the beginning and 249.6 MB in the end (delta: 121.6 MB). Free memory was 92.6 MB in the beginning and 215.3 MB in the end (delta: -122.7 MB). Peak memory consumption was 114.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:03,903 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 92.3 MB. Free memory was 62.5 MB in the beginning and 62.5 MB in the end (delta: 28.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:29:03,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.99 ms. Allocated memory is still 127.9 MB. Free memory was 92.6 MB in the beginning and 99.3 MB in the end (delta: -6.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:03,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.63 ms. Allocated memory is still 127.9 MB. Free memory was 99.1 MB in the beginning and 95.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:03,905 INFO L168 Benchmark]: Boogie Preprocessor took 89.36 ms. Allocated memory is still 127.9 MB. Free memory was 95.5 MB in the beginning and 93.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:03,906 INFO L168 Benchmark]: RCFGBuilder took 1252.57 ms. Allocated memory is still 127.9 MB. Free memory was 93.0 MB in the beginning and 61.6 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:03,912 INFO L168 Benchmark]: TraceAbstraction took 12135.28 ms. Allocated memory was 127.9 MB in the beginning and 207.6 MB in the end (delta: 79.7 MB). Free memory was 61.3 MB in the beginning and 78.3 MB in the end (delta: -17.0 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:03,912 INFO L168 Benchmark]: Witness Printer took 216.42 ms. Allocated memory was 207.6 MB in the beginning and 249.6 MB in the end (delta: 41.9 MB). Free memory was 78.3 MB in the beginning and 215.3 MB in the end (delta: -136.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:03,915 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.40 ms. Allocated memory is still 92.3 MB. Free memory was 62.5 MB in the beginning and 62.5 MB in the end (delta: 28.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 517.99 ms. Allocated memory is still 127.9 MB. Free memory was 92.6 MB in the beginning and 99.3 MB in the end (delta: -6.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.63 ms. Allocated memory is still 127.9 MB. Free memory was 99.1 MB in the beginning and 95.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 89.36 ms. Allocated memory is still 127.9 MB. Free memory was 95.5 MB in the beginning and 93.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1252.57 ms. Allocated memory is still 127.9 MB. Free memory was 93.0 MB in the beginning and 61.6 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12135.28 ms. Allocated memory was 127.9 MB in the beginning and 207.6 MB in the end (delta: 79.7 MB). Free memory was 61.3 MB in the beginning and 78.3 MB in the end (delta: -17.0 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.1 GB. * Witness Printer took 216.42 ms. Allocated memory was 207.6 MB in the beginning and 249.6 MB in the end (delta: 41.9 MB). Free memory was 78.3 MB in the beginning and 215.3 MB in the end (delta: -136.9 MB). Peak memory consumption was 20.3 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: 699]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] int s ; [L705] int tmp ; [L709] s = 8464 [L14] int s__info_callback = __VERIFIER_nondet_int() ; [L15] int s__in_handshake = __VERIFIER_nondet_int() ; [L16] int s__state ; [L17] int s__new_session ; [L18] int s__server ; [L19] int s__version = __VERIFIER_nondet_int() ; [L20] int s__type ; [L21] int s__init_num ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = 1; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__cert = __VERIFIER_nondet_int() ; [L28] int s__options = __VERIFIER_nondet_int() ; [L29] int s__verify_mode = __VERIFIER_nondet_int() ; [L30] int s__session__peer = __VERIFIER_nondet_int() ; [L31] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L32] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L35] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__cert_request ; [L37] int s__s3__tmp__reuse_message ; [L38] int s__s3__tmp__use_rsa_tmp ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_cipher__algo_strength ; [L43] int s__session__cipher ; [L44] int buf ; [L45] unsigned long l ; [L46] unsigned long Time ; [L47] unsigned long tmp ; [L48] int cb ; [L49] long num1 = __VERIFIER_nondet_long() ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int got_new_session ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 ; [L62] long tmp___8 = __VERIFIER_nondet_long() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int tmp___10 = __VERIFIER_nondet_int() ; [L65] int blastFlag ; [L66] int __cil_tmp55 ; [L67] unsigned long __cil_tmp56 ; [L68] unsigned long __cil_tmp57 ; [L69] unsigned long __cil_tmp58 ; [L70] unsigned long __cil_tmp59 ; [L71] int __cil_tmp60 ; [L72] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L76] s__state = initial_state [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] Time = tmp [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] got_new_session = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND FALSE !(tmp___1 + 12288) [L97] COND FALSE !(s__cert == 0) [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND TRUE s__state == 8464 [L274] s__shutdown = 0 [L275] ret = __VERIFIER_nondet_int() [L276] COND TRUE blastFlag == 0 [L277] blastFlag = 1 [L279] COND FALSE !(ret <= 0) [L282] got_new_session = 1 [L283] s__state = 8496 [L284] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND TRUE s__state == 8496 [L288] ret = __VERIFIER_nondet_int() [L289] COND TRUE blastFlag == 1 [L290] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L295] COND FALSE !(\read(s__hit)) [L298] s__state = 8512 [L300] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND TRUE s__state == 8512 [L305] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L306] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L307] COND TRUE __cil_tmp56 + 256UL [L308] __cil_tmp56 = 256345 [L309] skip = 1 [L320] s__state = 8528 [L321] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND TRUE s__state == 8528 [L325] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L326] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L328] __cil_tmp57 = (unsigned long )s__options [L329] COND TRUE __cil_tmp57 + 2097152UL [L330] s__s3__tmp__use_rsa_tmp = 1 [L335] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L363] ret = __VERIFIER_nondet_int() [L364] COND FALSE !(blastFlag == 3) [L367] COND FALSE !(ret <= 0) [L384] s__state = 8544 [L385] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND TRUE s__state == 8544 [L389] COND TRUE s__verify_mode + 1 [L390] COND TRUE s__session__peer != 0 [L391] COND TRUE s__verify_mode + 4 [L392] s__verify_mode = 123 [L393] skip = 1 [L394] s__s3__tmp__cert_request = 0 [L395] s__state = 8560 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND FALSE !(s__state == 8544) [L158] COND FALSE !(s__state == 8545) [L161] COND TRUE s__state == 8560 [L439] ret = __VERIFIER_nondet_int() [L440] COND FALSE !(ret <= 0) [L443] s__s3__tmp__next_state___0 = 8576 [L444] s__state = 8448 [L445] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND TRUE ! s__s3__tmp__reuse_message [L655] COND TRUE ! skip [L656] COND TRUE state == 8560 [L657] COND TRUE s__state == 8448 [L658] COND TRUE s__verify_mode != -1 [L659] COND TRUE s__verify_mode != -2 [L660] COND TRUE __cil_tmp61 != 9021 [L661] COND TRUE __cil_tmp58 != 4294967294 [L662] COND TRUE blastFlag != 4 [L663] COND TRUE tmp___7 != 1024 [L699] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 167 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11876.0ms, OverallIterations: 35, TraceHistogramMax: 6, EmptinessCheckTime: 113.6ms, AutomataDifference: 6912.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7183 SDtfs, 6874 SDslu, 1823 SDs, 0 SdLazy, 2872 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3420.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 101.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3188occurred in iteration=34, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1735.9ms AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 157.3ms SsaConstructionTime, 622.9ms SatisfiabilityAnalysisTime, 1589.2ms InterpolantComputationTime, 3216 NumberOfCodeBlocks, 3216 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3025 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 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-10-13 00:29:03,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fbfeffa-4344-4685-b9ff-165571113e6c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...