./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.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_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/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_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/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_b5211272-e66f-4349-a166-fb023c3a1b10/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 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:15:44,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:15:44,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:15:44,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:15:44,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:15:44,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:15:44,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:15:44,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:15:44,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:15:44,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:15:44,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:15:44,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:15:44,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:15:44,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:15:44,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:15:44,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:15:44,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:15:44,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:15:44,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:15:44,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:15:44,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:15:44,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:15:44,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:15:44,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:15:44,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:15:44,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:15:44,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:15:44,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:15:44,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:15:44,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:15:44,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:15:44,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:15:44,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:15:44,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:15:44,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:15:44,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:15:44,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:15:44,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:15:44,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:15:44,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:15:44,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:15:44,384 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:15:44,410 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:15:44,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:15:44,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:15:44,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:15:44,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:15:44,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:15:44,412 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:15:44,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:15:44,413 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:15:44,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:15:44,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:15:44,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:15:44,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:15:44,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:15:44,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:15:44,414 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:15:44,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:15:44,415 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:15:44,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:15:44,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:15:44,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:15:44,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:15:44,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:15:44,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:15:44,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:15:44,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:15:44,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:15:44,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:15:44,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:15:44,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:15:44,417 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_b5211272-e66f-4349-a166-fb023c3a1b10/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_b5211272-e66f-4349-a166-fb023c3a1b10/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 -> 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 [2021-10-13 00:15:44,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:15:44,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:15:44,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:15:44,671 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:15:44,672 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:15:44,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-10-13 00:15:44,737 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/data/710223c96/c58aaca8e79f4314b5e05c4164a89e7f/FLAGf7e8fc482 [2021-10-13 00:15:45,162 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:15:45,163 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-10-13 00:15:45,172 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/data/710223c96/c58aaca8e79f4314b5e05c4164a89e7f/FLAGf7e8fc482 [2021-10-13 00:15:45,532 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/data/710223c96/c58aaca8e79f4314b5e05c4164a89e7f [2021-10-13 00:15:45,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:15:45,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:15:45,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:15:45,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:15:45,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:15:45,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:45,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a261a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45, skipping insertion in model container [2021-10-13 00:15:45,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:45,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:15:45,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:15:45,722 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_b5211272-e66f-4349-a166-fb023c3a1b10/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-10-13 00:15:45,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:15:45,823 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:15:45,834 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_b5211272-e66f-4349-a166-fb023c3a1b10/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-10-13 00:15:45,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:15:45,916 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:15:45,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45 WrapperNode [2021-10-13 00:15:45,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:15:45,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:15:45,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:15:45,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:15:45,928 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:15:45" (1/1) ... [2021-10-13 00:15:45,936 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:15:45" (1/1) ... [2021-10-13 00:15:45,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:15:45,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:15:45,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:15:45,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:15:45,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:45,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:45,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:45,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:45,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:46,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:46,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:46,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:15:46,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:15:46,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:15:46,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:15:46,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2021-10-13 00:15:46,025 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:15:46,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:15:46,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:15:46,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:15:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:15:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:15:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:15:46,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:15:46,719 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:15:46,719 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2021-10-13 00:15:46,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:46 BoogieIcfgContainer [2021-10-13 00:15:46,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:15:46,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:15:46,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:15:46,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:15:46,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:15:45" (1/3) ... [2021-10-13 00:15:46,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f3f344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:46, skipping insertion in model container [2021-10-13 00:15:46,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (2/3) ... [2021-10-13 00:15:46,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f3f344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:46, skipping insertion in model container [2021-10-13 00:15:46,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:46" (3/3) ... [2021-10-13 00:15:46,729 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-10-13 00:15:46,734 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:15:46,735 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:15:46,776 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:15:46,784 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:15:46,784 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:15:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:15:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 00:15:46,807 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:46,808 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] [2021-10-13 00:15:46,808 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2021-10-13 00:15:46,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:46,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700996009] [2021-10-13 00:15:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:46,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:46,980 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:15:46,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:46,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700996009] [2021-10-13 00:15:46,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700996009] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:46,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:46,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:46,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158544483] [2021-10-13 00:15:46,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:46,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:47,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:47,004 INFO L87 Difference]: Start difference. First operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 states have internal predecessors, (180), 0 states have call successors, (0), 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.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:15:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:47,050 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2021-10-13 00:15:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:47,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-13 00:15:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:47,089 INFO L225 Difference]: With dead ends: 210 [2021-10-13 00:15:47,090 INFO L226 Difference]: Without dead ends: 104 [2021-10-13 00:15:47,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-13 00:15:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-13 00:15:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 103 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:15:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2021-10-13 00:15:47,158 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2021-10-13 00:15:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:47,159 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2021-10-13 00:15:47,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:15:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2021-10-13 00:15:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-13 00:15:47,161 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:47,162 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, 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:15:47,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:15:47,162 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2021-10-13 00:15:47,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:47,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637750962] [2021-10-13 00:15:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:47,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:47,289 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:15:47,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:47,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637750962] [2021-10-13 00:15:47,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637750962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:47,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:47,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:47,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038596648] [2021-10-13 00:15:47,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:47,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:47,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:47,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:47,297 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:47,346 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2021-10-13 00:15:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-10-13 00:15:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:47,355 INFO L225 Difference]: With dead ends: 199 [2021-10-13 00:15:47,355 INFO L226 Difference]: Without dead ends: 104 [2021-10-13 00:15:47,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-13 00:15:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-13 00:15:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 103 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:15:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2021-10-13 00:15:47,368 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2021-10-13 00:15:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:47,368 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2021-10-13 00:15:47,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2021-10-13 00:15:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-13 00:15:47,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:47,371 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, 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:15:47,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:15:47,372 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2021-10-13 00:15:47,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:47,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212018799] [2021-10-13 00:15:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:47,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:47,456 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:15:47,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:47,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212018799] [2021-10-13 00:15:47,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212018799] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:47,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:47,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:47,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514355551] [2021-10-13 00:15:47,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:47,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:47,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:47,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:47,459 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:47,485 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2021-10-13 00:15:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:47,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-10-13 00:15:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:47,487 INFO L225 Difference]: With dead ends: 196 [2021-10-13 00:15:47,487 INFO L226 Difference]: Without dead ends: 104 [2021-10-13 00:15:47,488 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:15:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-13 00:15:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-13 00:15:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 103 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:15:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2021-10-13 00:15:47,497 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2021-10-13 00:15:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:47,498 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2021-10-13 00:15:47,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2021-10-13 00:15:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-13 00:15:47,501 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:47,501 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, 1, 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:15:47,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:15:47,502 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:47,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:47,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2021-10-13 00:15:47,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:47,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211766662] [2021-10-13 00:15:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:47,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:47,568 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:15:47,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:47,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211766662] [2021-10-13 00:15:47,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211766662] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:47,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:47,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:47,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838813007] [2021-10-13 00:15:47,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:47,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:47,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:47,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:47,571 INFO L87 Difference]: Start difference. First operand 104 states and 168 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:15:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:47,598 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2021-10-13 00:15:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:47,600 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 70 [2021-10-13 00:15:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:47,601 INFO L225 Difference]: With dead ends: 193 [2021-10-13 00:15:47,602 INFO L226 Difference]: Without dead ends: 104 [2021-10-13 00:15:47,602 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:15:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-13 00:15:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-13 00:15:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 103 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:15:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2021-10-13 00:15:47,615 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2021-10-13 00:15:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:47,616 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2021-10-13 00:15:47,616 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:15:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2021-10-13 00:15:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 00:15:47,619 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:47,619 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, 1, 1, 1, 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:15:47,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:15:47,620 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:47,620 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2021-10-13 00:15:47,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:47,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498840677] [2021-10-13 00:15:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:47,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:47,683 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:15:47,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:47,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498840677] [2021-10-13 00:15:47,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498840677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:47,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:47,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:47,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608193798] [2021-10-13 00:15:47,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:47,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:47,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:47,686 INFO L87 Difference]: Start difference. First operand 104 states and 167 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:15:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:47,717 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2021-10-13 00:15:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:47,717 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 72 [2021-10-13 00:15:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:47,719 INFO L225 Difference]: With dead ends: 271 [2021-10-13 00:15:47,719 INFO L226 Difference]: Without dead ends: 191 [2021-10-13 00:15:47,720 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:15:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-10-13 00:15:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2021-10-13 00:15:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 187 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:15:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2021-10-13 00:15:47,761 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2021-10-13 00:15:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:47,761 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2021-10-13 00:15:47,761 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:15:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2021-10-13 00:15:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 00:15:47,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:47,765 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, 1, 1, 1, 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:15:47,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:15:47,766 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2021-10-13 00:15:47,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:47,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272863207] [2021-10-13 00:15:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:47,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:47,889 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:15:47,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:47,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272863207] [2021-10-13 00:15:47,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272863207] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:47,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:47,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:15:47,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294610877] [2021-10-13 00:15:47,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:15:47,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:15:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:15:47,892 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:15:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:48,022 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2021-10-13 00:15:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:15:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 72 [2021-10-13 00:15:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:48,025 INFO L225 Difference]: With dead ends: 444 [2021-10-13 00:15:48,025 INFO L226 Difference]: Without dead ends: 261 [2021-10-13 00:15:48,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.1ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:15:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-13 00:15:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2021-10-13 00:15:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:15:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2021-10-13 00:15:48,043 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2021-10-13 00:15:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:48,043 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2021-10-13 00:15:48,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:15:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2021-10-13 00:15:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 00:15:48,045 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:48,045 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, 1, 1, 1, 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:15:48,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:15:48,046 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2021-10-13 00:15:48,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:48,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621140201] [2021-10-13 00:15:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:48,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:48,121 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:15:48,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:48,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621140201] [2021-10-13 00:15:48,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621140201] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:48,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:48,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:48,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584368074] [2021-10-13 00:15:48,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:48,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:48,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:48,124 INFO L87 Difference]: Start difference. First operand 194 states and 310 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:15:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:48,164 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2021-10-13 00:15:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:48,165 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 72 [2021-10-13 00:15:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:48,167 INFO L225 Difference]: With dead ends: 408 [2021-10-13 00:15:48,167 INFO L226 Difference]: Without dead ends: 271 [2021-10-13 00:15:48,168 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:15:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-13 00:15:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2021-10-13 00:15:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 0 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:15:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2021-10-13 00:15:48,184 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2021-10-13 00:15:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:48,185 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2021-10-13 00:15:48,185 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:15:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2021-10-13 00:15:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 00:15:48,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:48,187 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, 1, 1, 1, 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:15:48,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:15:48,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:48,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2021-10-13 00:15:48,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:48,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486768566] [2021-10-13 00:15:48,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:48,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:48,249 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:15:48,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:48,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486768566] [2021-10-13 00:15:48,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486768566] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:48,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:48,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:15:48,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878942982] [2021-10-13 00:15:48,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:15:48,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:48,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:15:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:15:48,253 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:15:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:48,342 INFO L93 Difference]: Finished difference Result 749 states and 1171 transitions. [2021-10-13 00:15:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:15:48,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 72 [2021-10-13 00:15:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:48,347 INFO L225 Difference]: With dead ends: 749 [2021-10-13 00:15:48,347 INFO L226 Difference]: Without dead ends: 554 [2021-10-13 00:15:48,348 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.7ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:15:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-10-13 00:15:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 280. [2021-10-13 00:15:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 279 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:15:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2021-10-13 00:15:48,386 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2021-10-13 00:15:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:48,388 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2021-10-13 00:15:48,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:15:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2021-10-13 00:15:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-13 00:15:48,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:48,390 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, 1, 1, 1, 1, 1, 1, 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:15:48,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:15:48,390 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2021-10-13 00:15:48,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:48,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676015437] [2021-10-13 00:15:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:48,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:48,455 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:15:48,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:48,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676015437] [2021-10-13 00:15:48,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676015437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:48,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:48,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:48,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143059088] [2021-10-13 00:15:48,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:48,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:48,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:48,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:48,458 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:48,502 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2021-10-13 00:15:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:48,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-10-13 00:15:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:48,508 INFO L225 Difference]: With dead ends: 563 [2021-10-13 00:15:48,508 INFO L226 Difference]: Without dead ends: 332 [2021-10-13 00:15:48,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-10-13 00:15:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2021-10-13 00:15:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.5391849529780564) internal successors, (491), 319 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:15:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2021-10-13 00:15:48,537 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2021-10-13 00:15:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:48,538 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2021-10-13 00:15:48,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2021-10-13 00:15:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-13 00:15:48,544 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:48,545 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, 1, 1, 1, 1, 1, 1, 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:15:48,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:15:48,545 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:48,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2021-10-13 00:15:48,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:48,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030779287] [2021-10-13 00:15:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:48,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:48,602 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:15:48,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:48,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030779287] [2021-10-13 00:15:48,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030779287] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:48,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:48,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:48,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952416561] [2021-10-13 00:15:48,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:48,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:48,605 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:48,641 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2021-10-13 00:15:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-10-13 00:15:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:48,644 INFO L225 Difference]: With dead ends: 567 [2021-10-13 00:15:48,644 INFO L226 Difference]: Without dead ends: 284 [2021-10-13 00:15:48,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-13 00:15:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-10-13 00:15:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4946619217081851) internal successors, (420), 281 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:15:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2021-10-13 00:15:48,664 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2021-10-13 00:15:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:48,665 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2021-10-13 00:15:48,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2021-10-13 00:15:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-13 00:15:48,667 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:48,667 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:48,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:15:48,667 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:48,668 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2021-10-13 00:15:48,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:48,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913229286] [2021-10-13 00:15:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:48,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:48,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:48,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913229286] [2021-10-13 00:15:48,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913229286] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:48,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:48,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:15:48,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618910295] [2021-10-13 00:15:48,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:15:48,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:48,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:15:48,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:48,735 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:48,784 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2021-10-13 00:15:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:15:48,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-10-13 00:15:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:48,789 INFO L225 Difference]: With dead ends: 811 [2021-10-13 00:15:48,789 INFO L226 Difference]: Without dead ends: 580 [2021-10-13 00:15:48,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-13 00:15:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2021-10-13 00:15:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4764397905759161) internal successors, (846), 573 states have internal predecessors, (846), 0 states have call successors, (0), 0 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:15:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2021-10-13 00:15:48,829 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2021-10-13 00:15:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:48,831 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2021-10-13 00:15:48,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2021-10-13 00:15:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-13 00:15:48,833 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:48,833 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:48,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:15:48,834 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:48,834 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2021-10-13 00:15:48,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:48,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416890258] [2021-10-13 00:15:48,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:48,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:48,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:48,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416890258] [2021-10-13 00:15:48,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416890258] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:48,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:48,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:15:48,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057842961] [2021-10-13 00:15:48,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:15:48,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:15:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:48,917 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:15:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:48,992 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2021-10-13 00:15:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:15:48,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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 87 [2021-10-13 00:15:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:48,996 INFO L225 Difference]: With dead ends: 1097 [2021-10-13 00:15:48,997 INFO L226 Difference]: Without dead ends: 574 [2021-10-13 00:15:49,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:15:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-10-13 00:15:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2021-10-13 00:15:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.469458987783595) internal successors, (842), 573 states have internal predecessors, (842), 0 states have call successors, (0), 0 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:15:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2021-10-13 00:15:49,040 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2021-10-13 00:15:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:49,041 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2021-10-13 00:15:49,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:15:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2021-10-13 00:15:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 00:15:49,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:49,044 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:49,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:15:49,044 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2021-10-13 00:15:49,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:49,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473143395] [2021-10-13 00:15:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:49,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:49,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:49,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473143395] [2021-10-13 00:15:49,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473143395] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:49,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:49,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:49,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346985288] [2021-10-13 00:15:49,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:49,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:49,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:49,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:49,083 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:49,159 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2021-10-13 00:15:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:49,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-13 00:15:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:49,166 INFO L225 Difference]: With dead ends: 1592 [2021-10-13 00:15:49,166 INFO L226 Difference]: Without dead ends: 1069 [2021-10-13 00:15:49,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-10-13 00:15:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2021-10-13 00:15:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.4598290598290597) internal successors, (854), 585 states have internal predecessors, (854), 0 states have call successors, (0), 0 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:15:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2021-10-13 00:15:49,219 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2021-10-13 00:15:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:49,219 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2021-10-13 00:15:49,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2021-10-13 00:15:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-13 00:15:49,221 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:49,221 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:49,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:15:49,221 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:49,222 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2021-10-13 00:15:49,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:49,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451190424] [2021-10-13 00:15:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:49,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:49,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:49,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451190424] [2021-10-13 00:15:49,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451190424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:49,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:49,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:15:49,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305807879] [2021-10-13 00:15:49,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:15:49,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:15:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:49,295 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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:15:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:49,374 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2021-10-13 00:15:49,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:15:49,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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 89 [2021-10-13 00:15:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:49,378 INFO L225 Difference]: With dead ends: 1105 [2021-10-13 00:15:49,378 INFO L226 Difference]: Without dead ends: 570 [2021-10-13 00:15:49,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:15:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-13 00:15:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-10-13 00:15:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.437609841827768) internal successors, (818), 569 states have internal predecessors, (818), 0 states have call successors, (0), 0 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:15:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2021-10-13 00:15:49,427 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2021-10-13 00:15:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:49,428 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2021-10-13 00:15:49,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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:15:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2021-10-13 00:15:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-13 00:15:49,429 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:49,430 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:49,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:15:49,430 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2021-10-13 00:15:49,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:49,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669745910] [2021-10-13 00:15:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:49,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:49,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:49,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669745910] [2021-10-13 00:15:49,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669745910] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:49,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:49,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:49,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037516662] [2021-10-13 00:15:49,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:49,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:49,475 INFO L87 Difference]: Start difference. First operand 570 states and 818 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:15:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:49,579 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2021-10-13 00:15:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:49,580 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 90 [2021-10-13 00:15:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:49,586 INFO L225 Difference]: With dead ends: 1592 [2021-10-13 00:15:49,586 INFO L226 Difference]: Without dead ends: 1073 [2021-10-13 00:15:49,589 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-10-13 00:15:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2021-10-13 00:15:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4315424610051992) internal successors, (826), 577 states have internal predecessors, (826), 0 states have call successors, (0), 0 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:15:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2021-10-13 00:15:49,651 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2021-10-13 00:15:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:49,651 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2021-10-13 00:15:49,651 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:15:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2021-10-13 00:15:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-13 00:15:49,653 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:49,653 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:49,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:15:49,653 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2021-10-13 00:15:49,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:49,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888686031] [2021-10-13 00:15:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:49,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:49,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:49,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888686031] [2021-10-13 00:15:49,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888686031] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:49,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:49,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:49,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210538630] [2021-10-13 00:15:49,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:49,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:49,694 INFO L87 Difference]: Start difference. First operand 578 states and 826 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:15:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:49,780 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2021-10-13 00:15:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:49,780 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 90 [2021-10-13 00:15:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:49,785 INFO L225 Difference]: With dead ends: 1311 [2021-10-13 00:15:49,785 INFO L226 Difference]: Without dead ends: 784 [2021-10-13 00:15:49,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-10-13 00:15:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2021-10-13 00:15:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 1.449645390070922) internal successors, (1022), 705 states have internal predecessors, (1022), 0 states have call successors, (0), 0 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:15:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2021-10-13 00:15:49,856 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2021-10-13 00:15:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:49,856 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2021-10-13 00:15:49,856 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:15:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2021-10-13 00:15:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-13 00:15:49,858 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:49,858 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:49,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:15:49,858 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2021-10-13 00:15:49,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:49,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28269494] [2021-10-13 00:15:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:49,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:49,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:49,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28269494] [2021-10-13 00:15:49,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28269494] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:15:49,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950034692] [2021-10-13 00:15:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:49,905 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:15:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:15:49,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:15:49,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 00:15:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:50,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:15:50,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:15:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:50,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950034692] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:50,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:15:50,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-13 00:15:50,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263856079] [2021-10-13 00:15:50,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:50,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:50,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:50,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:50,374 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:50,466 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2021-10-13 00:15:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:50,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-10-13 00:15:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:50,470 INFO L225 Difference]: With dead ends: 1341 [2021-10-13 00:15:50,471 INFO L226 Difference]: Without dead ends: 686 [2021-10-13 00:15:50,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-13 00:15:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-10-13 00:15:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.429197080291971) internal successors, (979), 685 states have internal predecessors, (979), 0 states have call successors, (0), 0 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:15:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2021-10-13 00:15:50,546 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2021-10-13 00:15:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:50,547 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2021-10-13 00:15:50,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2021-10-13 00:15:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 00:15:50,548 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:50,549 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:50,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:15:50,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 00:15:50,763 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2021-10-13 00:15:50,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:50,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369727519] [2021-10-13 00:15:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:50,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:50,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:50,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369727519] [2021-10-13 00:15:50,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369727519] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:15:50,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529864832] [2021-10-13 00:15:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:50,805 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:15:50,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:15:50,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:15:50,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 00:15:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:50,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:15:50,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:15:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:51,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529864832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:51,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:15:51,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-13 00:15:51,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679361972] [2021-10-13 00:15:51,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:51,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:51,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:51,181 INFO L87 Difference]: Start difference. First operand 686 states and 979 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:15:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:51,315 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2021-10-13 00:15:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:51,315 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 93 [2021-10-13 00:15:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:51,323 INFO L225 Difference]: With dead ends: 2025 [2021-10-13 00:15:51,323 INFO L226 Difference]: Without dead ends: 1364 [2021-10-13 00:15:51,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-10-13 00:15:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2021-10-13 00:15:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 1.4125) internal successors, (1921), 1360 states have internal predecessors, (1921), 0 states have call successors, (0), 0 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:15:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2021-10-13 00:15:51,441 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2021-10-13 00:15:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:51,441 INFO L470 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2021-10-13 00:15:51,441 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:15:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2021-10-13 00:15:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 00:15:51,443 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:51,444 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:51,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:15:51,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 00:15:51,659 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2021-10-13 00:15:51,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:51,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128600190] [2021-10-13 00:15:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:51,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:51,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:51,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128600190] [2021-10-13 00:15:51,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128600190] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:51,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:51,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:51,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186920847] [2021-10-13 00:15:51,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:51,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:51,688 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 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:15:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:51,812 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2021-10-13 00:15:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:51,813 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 93 [2021-10-13 00:15:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:51,821 INFO L225 Difference]: With dead ends: 2736 [2021-10-13 00:15:51,821 INFO L226 Difference]: Without dead ends: 1463 [2021-10-13 00:15:51,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-10-13 00:15:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2021-10-13 00:15:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1462 states have (on average 1.4008207934336525) internal successors, (2048), 1462 states have internal predecessors, (2048), 0 states have call successors, (0), 0 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:15:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2021-10-13 00:15:51,919 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2021-10-13 00:15:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:51,920 INFO L470 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2021-10-13 00:15:51,920 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:15:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2021-10-13 00:15:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 00:15:51,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:51,922 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:51,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:15:51,922 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2021-10-13 00:15:51,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:51,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736603081] [2021-10-13 00:15:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:51,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:51,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:51,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736603081] [2021-10-13 00:15:51,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736603081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:51,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:51,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:51,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943192911] [2021-10-13 00:15:51,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:51,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:51,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:51,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:51,949 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 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:15:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:52,044 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2021-10-13 00:15:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:52,044 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 93 [2021-10-13 00:15:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:52,050 INFO L225 Difference]: With dead ends: 2354 [2021-10-13 00:15:52,050 INFO L226 Difference]: Without dead ends: 973 [2021-10-13 00:15:52,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-10-13 00:15:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2021-10-13 00:15:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.389917695473251) internal successors, (1351), 972 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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:15:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2021-10-13 00:15:52,120 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2021-10-13 00:15:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:52,120 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2021-10-13 00:15:52,120 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:15:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2021-10-13 00:15:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-13 00:15:52,122 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:52,122 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:52,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:15:52,123 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2021-10-13 00:15:52,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:52,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835735558] [2021-10-13 00:15:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:52,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:52,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:52,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835735558] [2021-10-13 00:15:52,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835735558] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:52,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:52,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:15:52,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40311245] [2021-10-13 00:15:52,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:15:52,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:52,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:15:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:52,168 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:52,209 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2021-10-13 00:15:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:15:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-13 00:15:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:52,212 INFO L225 Difference]: With dead ends: 1258 [2021-10-13 00:15:52,212 INFO L226 Difference]: Without dead ends: 373 [2021-10-13 00:15:52,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-10-13 00:15:52,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2021-10-13 00:15:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.3548387096774193) internal successors, (504), 372 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:15:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2021-10-13 00:15:52,264 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2021-10-13 00:15:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:52,264 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2021-10-13 00:15:52,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2021-10-13 00:15:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-13 00:15:52,266 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:52,266 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:52,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:15:52,267 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2021-10-13 00:15:52,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:52,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940151352] [2021-10-13 00:15:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:52,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:52,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:52,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940151352] [2021-10-13 00:15:52,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940151352] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:15:52,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008852904] [2021-10-13 00:15:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:52,317 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:15:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:15:52,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:15:52,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 00:15:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:52,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:15:52,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:15:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:52,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008852904] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:52,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:15:52,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-13 00:15:52,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252311801] [2021-10-13 00:15:52,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:52,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:52,701 INFO L87 Difference]: Start difference. First operand 373 states and 504 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:15:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:52,769 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2021-10-13 00:15:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:52,771 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 94 [2021-10-13 00:15:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:52,775 INFO L225 Difference]: With dead ends: 1059 [2021-10-13 00:15:52,775 INFO L226 Difference]: Without dead ends: 732 [2021-10-13 00:15:52,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-13 00:15:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2021-10-13 00:15:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.3365384615384615) internal successors, (973), 728 states have internal predecessors, (973), 0 states have call successors, (0), 0 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:15:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2021-10-13 00:15:52,827 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2021-10-13 00:15:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:52,828 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2021-10-13 00:15:52,828 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:15:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2021-10-13 00:15:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-13 00:15:52,830 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:52,830 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:52,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:15:53,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:15:53,057 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2021-10-13 00:15:53,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:53,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443102814] [2021-10-13 00:15:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:53,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:53,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:53,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443102814] [2021-10-13 00:15:53,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443102814] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:53,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:53,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:53,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559022694] [2021-10-13 00:15:53,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:53,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:53,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:53,084 INFO L87 Difference]: Start difference. First operand 729 states and 973 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:15:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:53,158 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2021-10-13 00:15:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:53,159 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 94 [2021-10-13 00:15:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:53,163 INFO L225 Difference]: With dead ends: 1382 [2021-10-13 00:15:53,163 INFO L226 Difference]: Without dead ends: 811 [2021-10-13 00:15:53,164 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-10-13 00:15:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2021-10-13 00:15:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.317283950617284) internal successors, (1067), 810 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:15:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2021-10-13 00:15:53,219 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2021-10-13 00:15:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:53,219 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2021-10-13 00:15:53,219 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:15:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2021-10-13 00:15:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-13 00:15:53,221 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:53,221 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:53,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:15:53,222 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2021-10-13 00:15:53,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:53,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675432552] [2021-10-13 00:15:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:53,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:53,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:53,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675432552] [2021-10-13 00:15:53,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675432552] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:53,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:53,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:15:53,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19042372] [2021-10-13 00:15:53,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:53,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:53,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:53,246 INFO L87 Difference]: Start difference. First operand 811 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:15:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:53,296 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2021-10-13 00:15:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:53,296 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 94 [2021-10-13 00:15:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:53,300 INFO L225 Difference]: With dead ends: 1208 [2021-10-13 00:15:53,300 INFO L226 Difference]: Without dead ends: 551 [2021-10-13 00:15:53,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:15:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-10-13 00:15:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2021-10-13 00:15:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 550 states have internal predecessors, (712), 0 states have call successors, (0), 0 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:15:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2021-10-13 00:15:53,337 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2021-10-13 00:15:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:53,338 INFO L470 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2021-10-13 00:15:53,338 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:15:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2021-10-13 00:15:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 00:15:53,340 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:53,340 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:53,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:15:53,340 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2021-10-13 00:15:53,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:53,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513916913] [2021-10-13 00:15:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:53,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:53,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:53,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513916913] [2021-10-13 00:15:53,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513916913] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:53,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:53,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:15:53,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473649212] [2021-10-13 00:15:53,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:15:53,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:15:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:53,387 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:53,444 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2021-10-13 00:15:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:15:53,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-10-13 00:15:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:53,447 INFO L225 Difference]: With dead ends: 820 [2021-10-13 00:15:53,447 INFO L226 Difference]: Without dead ends: 427 [2021-10-13 00:15:53,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-10-13 00:15:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-10-13 00:15:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.272300469483568) internal successors, (542), 426 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:15:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2021-10-13 00:15:53,484 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2021-10-13 00:15:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:53,484 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2021-10-13 00:15:53,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2021-10-13 00:15:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 00:15:53,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:53,486 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:53,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:15:53,489 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2021-10-13 00:15:53,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:53,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601619397] [2021-10-13 00:15:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:53,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:53,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:53,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601619397] [2021-10-13 00:15:53,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601619397] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:15:53,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912304925] [2021-10-13 00:15:53,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:53,530 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:15:53,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:15:53,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:15:53,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 00:15:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:53,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:15:53,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:15:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-13 00:15:53,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912304925] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:53,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:15:53,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-13 00:15:53,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996514166] [2021-10-13 00:15:53,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:15:53,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:15:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:53,925 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:53,998 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2021-10-13 00:15:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:15:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-10-13 00:15:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:54,004 INFO L225 Difference]: With dead ends: 1163 [2021-10-13 00:15:54,004 INFO L226 Difference]: Without dead ends: 822 [2021-10-13 00:15:54,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-10-13 00:15:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2021-10-13 00:15:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.2506112469437654) internal successors, (1023), 818 states have internal predecessors, (1023), 0 states have call successors, (0), 0 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:15:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2021-10-13 00:15:54,072 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2021-10-13 00:15:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:54,073 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2021-10-13 00:15:54,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:15:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2021-10-13 00:15:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 00:15:54,075 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:54,075 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:54,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 00:15:54,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:15:54,291 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2021-10-13 00:15:54,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:54,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484062141] [2021-10-13 00:15:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:54,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:54,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:54,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484062141] [2021-10-13 00:15:54,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484062141] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:15:54,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705165590] [2021-10-13 00:15:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:54,330 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:15:54,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:15:54,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:15:54,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 00:15:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:54,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 00:15:54,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:15:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:54,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705165590] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:54,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:15:54,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-10-13 00:15:54,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387075895] [2021-10-13 00:15:54,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:15:54,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:54,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:15:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:54,863 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:15:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:54,955 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2021-10-13 00:15:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:15:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-10-13 00:15:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:54,961 INFO L225 Difference]: With dead ends: 1704 [2021-10-13 00:15:54,961 INFO L226 Difference]: Without dead ends: 1054 [2021-10-13 00:15:54,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-10-13 00:15:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2021-10-13 00:15:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2542037586547972) internal successors, (1268), 1011 states have internal predecessors, (1268), 0 states have call successors, (0), 0 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:15:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2021-10-13 00:15:55,087 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2021-10-13 00:15:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:55,088 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2021-10-13 00:15:55,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:15:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2021-10-13 00:15:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 00:15:55,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:55,091 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:55,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 00:15:55,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-13 00:15:55,317 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:55,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:55,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2021-10-13 00:15:55,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:55,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538210112] [2021-10-13 00:15:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:55,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:55,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:55,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538210112] [2021-10-13 00:15:55,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538210112] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:55,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:55,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:15:55,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241891890] [2021-10-13 00:15:55,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:15:55,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:55,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:15:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:55,370 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:15:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:55,496 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2021-10-13 00:15:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:15:55,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-10-13 00:15:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:55,505 INFO L225 Difference]: With dead ends: 2540 [2021-10-13 00:15:55,505 INFO L226 Difference]: Without dead ends: 1698 [2021-10-13 00:15:55,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:15:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2021-10-13 00:15:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2021-10-13 00:15:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.249757045675413) internal successors, (1286), 1029 states have internal predecessors, (1286), 0 states have call successors, (0), 0 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:15:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2021-10-13 00:15:55,615 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2021-10-13 00:15:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:55,615 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2021-10-13 00:15:55,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:15:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2021-10-13 00:15:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 00:15:55,617 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:15:55,617 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:55,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:15:55,618 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:15:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:15:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2021-10-13 00:15:55,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:15:55,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026403887] [2021-10-13 00:15:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:15:55,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:15:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:15:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:15:55,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:15:55,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026403887] [2021-10-13 00:15:55,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026403887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:15:55,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:15:55,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:15:55,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262618943] [2021-10-13 00:15:55,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:15:55,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:15:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:15:55,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:15:55,673 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:15:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:15:55,734 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2021-10-13 00:15:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:15:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-10-13 00:15:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:15:55,734 INFO L225 Difference]: With dead ends: 1285 [2021-10-13 00:15:55,735 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 00:15:55,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:15:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 00:15:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 00:15:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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:15:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 00:15:55,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-10-13 00:15:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:15:55,738 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 00:15:55,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:15:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 00:15:55,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 00:15:55,741 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:15:55,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:15:55,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 00:15:55,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:55,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:56,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:15:59,537 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 404) no Hoare annotation was computed. [2021-10-13 00:15:59,538 INFO L853 garLoopResultBuilder]: At program point L333-1(lines 309 341) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse15 (= ~b1_ev~0 1)) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (= ~d0_ev~0 1)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-13 00:15:59,538 INFO L853 garLoopResultBuilder]: At program point L267(lines 259 269) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,538 INFO L853 garLoopResultBuilder]: At program point L366-3(lines 342 374) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,539 INFO L853 garLoopResultBuilder]: At program point L333-3(lines 309 341) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,539 INFO L853 garLoopResultBuilder]: At program point L267-1(lines 259 269) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,539 INFO L853 garLoopResultBuilder]: At program point L268(lines 256 270) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,539 INFO L853 garLoopResultBuilder]: At program point L268-1(lines 256 270) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,539 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 118) no Hoare annotation was computed. [2021-10-13 00:15:59,540 INFO L857 garLoopResultBuilder]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2021-10-13 00:15:59,540 INFO L857 garLoopResultBuilder]: For program point L71(lines 43 93) no Hoare annotation was computed. [2021-10-13 00:15:59,540 INFO L860 garLoopResultBuilder]: At program point L501(lines 485 503) the Hoare annotation is: true [2021-10-13 00:15:59,540 INFO L853 garLoopResultBuilder]: At program point L303(lines 271 308) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,540 INFO L857 garLoopResultBuilder]: For program point L204(lines 204 210) no Hoare annotation was computed. [2021-10-13 00:15:59,540 INFO L853 garLoopResultBuilder]: At program point L204-1(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (<= 2 ~d1_ev~0) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1)) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0)) [2021-10-13 00:15:59,540 INFO L857 garLoopResultBuilder]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L853 garLoopResultBuilder]: At program point L204-3(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,541 INFO L857 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 117) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 179) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L857 garLoopResultBuilder]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L857 garLoopResultBuilder]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L857 garLoopResultBuilder]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2021-10-13 00:15:59,541 INFO L853 garLoopResultBuilder]: At program point L406(lines 395 408) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,542 INFO L853 garLoopResultBuilder]: At program point L407(lines 391 409) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2021-10-13 00:15:59,542 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-10-13 00:15:59,543 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-13 00:15:59,543 INFO L857 garLoopResultBuilder]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2021-10-13 00:15:59,543 INFO L857 garLoopResultBuilder]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2021-10-13 00:15:59,543 INFO L853 garLoopResultBuilder]: At program point L211(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (= ~d0_req_up~0 1)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (= ~d1_req_up~0 1)) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~b1_ev~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~b1_ev~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-10-13 00:15:59,543 INFO L853 garLoopResultBuilder]: At program point L211-1(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,543 INFO L857 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2021-10-13 00:15:59,543 INFO L857 garLoopResultBuilder]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,543 INFO L857 garLoopResultBuilder]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,544 INFO L857 garLoopResultBuilder]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2021-10-13 00:15:59,544 INFO L857 garLoopResultBuilder]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,544 INFO L853 garLoopResultBuilder]: At program point L247-1(lines 313 317) the Hoare annotation is: (let ((.cse6 (= ~b1_ev~0 0)) (.cse8 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse15 (= ~d0_ev~0 0)) (.cse5 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (not (= ~b0_req_up~0 1))) (.cse14 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-13 00:15:59,544 INFO L857 garLoopResultBuilder]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,544 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-10-13 00:15:59,544 INFO L857 garLoopResultBuilder]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2021-10-13 00:15:59,544 INFO L853 garLoopResultBuilder]: At program point L447(lines 493 499) the Hoare annotation is: (and (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,544 INFO L857 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2021-10-13 00:15:59,548 INFO L857 garLoopResultBuilder]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2021-10-13 00:15:59,548 INFO L857 garLoopResultBuilder]: For program point L382(lines 382 386) no Hoare annotation was computed. [2021-10-13 00:15:59,549 INFO L853 garLoopResultBuilder]: At program point L382-2(lines 346 350) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse9 (= ~b1_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~z_val~0 0)) (.cse17 (= ~d0_ev~0 1)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15))) [2021-10-13 00:15:59,549 INFO L857 garLoopResultBuilder]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2021-10-13 00:15:59,550 INFO L853 garLoopResultBuilder]: At program point L382-5(lines 346 350) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,550 INFO L853 garLoopResultBuilder]: At program point L482(lines 453 484) the Hoare annotation is: (and (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~z_ev~0 2) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0)) [2021-10-13 00:15:59,550 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 00:15:59,550 INFO L853 garLoopResultBuilder]: At program point L218(lines 203 241) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse17 (= ~b1_ev~0 0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse18 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (<= 2 ~d1_ev~0)) (.cse9 (not (= ~b1_val_t~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (= ~d1_req_up~0 1)) (.cse15 (not (= ~b0_req_up~0 1))) (.cse16 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse18 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-10-13 00:15:59,551 INFO L853 garLoopResultBuilder]: At program point L218-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,551 INFO L857 garLoopResultBuilder]: For program point L53(lines 43 93) no Hoare annotation was computed. [2021-10-13 00:15:59,551 INFO L857 garLoopResultBuilder]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,551 INFO L857 garLoopResultBuilder]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,551 INFO L857 garLoopResultBuilder]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,551 INFO L857 garLoopResultBuilder]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,552 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2021-10-13 00:15:59,552 INFO L853 garLoopResultBuilder]: At program point L121(lines 98 123) the Hoare annotation is: (let ((.cse9 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15))) [2021-10-13 00:15:59,552 INFO L853 garLoopResultBuilder]: At program point L121-1(lines 98 123) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,552 INFO L853 garLoopResultBuilder]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,553 INFO L853 garLoopResultBuilder]: At program point L122(lines 95 124) the Hoare annotation is: (let ((.cse17 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse8 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= |ULTIMATE.start_is_method1_triggered_#res| 0))) (.cse14 (not (= ~d0_val_t~0 0))) (.cse15 (not (= ~b1_val~0 0))) (.cse16 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16))) [2021-10-13 00:15:59,553 INFO L853 garLoopResultBuilder]: At program point L122-1(lines 95 124) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= |ULTIMATE.start_is_method1_triggered_#res| 0)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,553 INFO L857 garLoopResultBuilder]: For program point L189(lines 189 194) no Hoare annotation was computed. [2021-10-13 00:15:59,553 INFO L857 garLoopResultBuilder]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2021-10-13 00:15:59,554 INFO L857 garLoopResultBuilder]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2021-10-13 00:15:59,554 INFO L857 garLoopResultBuilder]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2021-10-13 00:15:59,554 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 00:15:59,554 INFO L857 garLoopResultBuilder]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,554 INFO L857 garLoopResultBuilder]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,555 INFO L857 garLoopResultBuilder]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,555 INFO L857 garLoopResultBuilder]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,555 INFO L857 garLoopResultBuilder]: For program point L291(lines 291 298) no Hoare annotation was computed. [2021-10-13 00:15:59,555 INFO L853 garLoopResultBuilder]: At program point L225(lines 203 241) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-10-13 00:15:59,555 INFO L853 garLoopResultBuilder]: At program point L225-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,556 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-13 00:15:59,556 INFO L857 garLoopResultBuilder]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-13 00:15:59,556 INFO L857 garLoopResultBuilder]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-13 00:15:59,556 INFO L857 garLoopResultBuilder]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-13 00:15:59,556 INFO L853 garLoopResultBuilder]: At program point L424-1(lines 342 446) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-13 00:15:59,557 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 00:15:59,557 INFO L857 garLoopResultBuilder]: For program point L425(line 425) no Hoare annotation was computed. [2021-10-13 00:15:59,557 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 265) no Hoare annotation was computed. [2021-10-13 00:15:59,557 INFO L857 garLoopResultBuilder]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2021-10-13 00:15:59,557 INFO L857 garLoopResultBuilder]: For program point L129(lines 129 134) no Hoare annotation was computed. [2021-10-13 00:15:59,557 INFO L857 garLoopResultBuilder]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2021-10-13 00:15:59,558 INFO L857 garLoopResultBuilder]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2021-10-13 00:15:59,559 INFO L857 garLoopResultBuilder]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2021-10-13 00:15:59,559 INFO L860 garLoopResultBuilder]: At program point L493(lines 493 499) the Hoare annotation is: true [2021-10-13 00:15:59,559 INFO L857 garLoopResultBuilder]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,559 INFO L857 garLoopResultBuilder]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,559 INFO L857 garLoopResultBuilder]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2021-10-13 00:15:59,560 INFO L857 garLoopResultBuilder]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2021-10-13 00:15:59,560 INFO L857 garLoopResultBuilder]: For program point L65(lines 65 69) no Hoare annotation was computed. [2021-10-13 00:15:59,560 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 00:15:59,560 INFO L857 garLoopResultBuilder]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2021-10-13 00:15:59,560 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-10-13 00:15:59,560 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 119) no Hoare annotation was computed. [2021-10-13 00:15:59,561 INFO L857 garLoopResultBuilder]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2021-10-13 00:15:59,561 INFO L853 garLoopResultBuilder]: At program point L232(lines 247 251) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-10-13 00:15:59,562 INFO L853 garLoopResultBuilder]: At program point L232-1(lines 200 242) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 00:15:59,566 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:15:59,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:15:59 BoogieIcfgContainer [2021-10-13 00:15:59,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:15:59,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:15:59,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:15:59,628 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:15:59,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:46" (3/4) ... [2021-10-13 00:15:59,631 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 00:15:59,648 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 00:15:59,651 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 00:15:59,652 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:15:59,653 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:15:59,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-10-13 00:15:59,690 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-10-13 00:15:59,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-10-13 00:15:59,771 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:15:59,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:15:59,773 INFO L168 Benchmark]: Toolchain (without parser) took 14235.41 ms. Allocated memory was 98.6 MB in the beginning and 218.1 MB in the end (delta: 119.5 MB). Free memory was 60.4 MB in the beginning and 86.7 MB in the end (delta: -26.3 MB). Peak memory consumption was 93.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:15:59,773 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 98.6 MB. Free memory is still 77.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:15:59,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.16 ms. Allocated memory is still 98.6 MB. Free memory was 60.2 MB in the beginning and 72.9 MB in the end (delta: -12.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:15:59,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.71 ms. Allocated memory is still 98.6 MB. Free memory was 72.9 MB in the beginning and 70.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:15:59,775 INFO L168 Benchmark]: Boogie Preprocessor took 38.06 ms. Allocated memory is still 98.6 MB. Free memory was 70.5 MB in the beginning and 68.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:15:59,775 INFO L168 Benchmark]: RCFGBuilder took 705.42 ms. Allocated memory is still 98.6 MB. Free memory was 68.7 MB in the beginning and 50.5 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:15:59,776 INFO L168 Benchmark]: TraceAbstraction took 12904.22 ms. Allocated memory was 98.6 MB in the beginning and 218.1 MB in the end (delta: 119.5 MB). Free memory was 50.1 MB in the beginning and 97.2 MB in the end (delta: -47.1 MB). Peak memory consumption was 116.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:15:59,776 INFO L168 Benchmark]: Witness Printer took 143.49 ms. Allocated memory is still 218.1 MB. Free memory was 97.2 MB in the beginning and 86.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:15:59,782 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.22 ms. Allocated memory is still 98.6 MB. Free memory is still 77.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 380.16 ms. Allocated memory is still 98.6 MB. Free memory was 60.2 MB in the beginning and 72.9 MB in the end (delta: -12.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.71 ms. Allocated memory is still 98.6 MB. Free memory was 72.9 MB in the beginning and 70.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.06 ms. Allocated memory is still 98.6 MB. Free memory was 70.5 MB in the beginning and 68.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 705.42 ms. Allocated memory is still 98.6 MB. Free memory was 68.7 MB in the beginning and 50.5 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12904.22 ms. Allocated memory was 98.6 MB in the beginning and 218.1 MB in the end (delta: 119.5 MB). Free memory was 50.1 MB in the beginning and 97.2 MB in the end (delta: -47.1 MB). Peak memory consumption was 116.8 MB. Max. memory is 16.1 GB. * Witness Printer took 143.49 ms. Allocated memory is still 218.1 MB. Free memory was 97.2 MB in the beginning and 86.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 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 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12790.9ms, OverallIterations: 29, TraceHistogramMax: 2, EmptinessCheckTime: 63.5ms, AutomataDifference: 2347.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 3795.7ms, InitialAbstractionConstructionTime: 12.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4786 SDtfs, 2809 SDslu, 5283 SDs, 0 SdLazy, 418 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 423.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 228.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1418.5ms AutomataMinimizationTime, 29 MinimizatonAttempts, 2142 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3769 HoareAnnotationTreeSize, 33 FomulaSimplifications, 63912 FormulaSimplificationTreeSizeReduction, 919.0ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 4734 FormulaSimplificationTreeSizeReductionInter, 2855.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 188.3ms SsaConstructionTime, 527.1ms SatisfiabilityAnalysisTime, 2403.6ms InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 5233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(tmp == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) && 1 == b1_req_up - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((0 == z_val_t && !(1 == b1_req_up)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((b0_req_up == 1 && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && d0_val_t == b0_val_t) && z_ev == 2) && b0_val_t == 1) && 2 <= d1_ev) && d0_req_up == 1) && b0_val == 0) && d1_val_t == b0_val_t) && 2 <= d0_ev) && z_val == 0) && 2 <= b0_ev) && d1_req_up == 1) && 1 == b1_req_up) && b1_val_t == b0_val_t - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) RESULT: Ultimate proved your program to be correct! [2021-10-13 00:15:59,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5211272-e66f-4349-a166-fb023c3a1b10/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...