./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 aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0 --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 de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 16:20:00,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 16:20:00,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 16:20:00,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 16:20:00,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 16:20:00,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 16:20:00,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 16:20:00,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 16:20:00,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 16:20:00,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 16:20:00,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 16:20:00,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 16:20:00,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 16:20:00,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 16:20:00,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 16:20:00,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 16:20:00,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 16:20:00,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 16:20:00,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 16:20:00,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 16:20:00,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 16:20:00,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 16:20:00,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 16:20:00,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 16:20:00,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 16:20:00,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 16:20:00,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 16:20:00,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 16:20:00,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 16:20:00,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 16:20:00,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 16:20:00,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 16:20:00,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 16:20:00,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 16:20:00,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 16:20:00,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 16:20:00,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 16:20:00,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 16:20:00,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 16:20:00,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 16:20:00,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 16:20:00,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-22 16:20:00,677 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 16:20:00,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 16:20:00,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 16:20:00,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 16:20:00,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 16:20:00,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 16:20:00,680 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 16:20:00,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 16:20:00,681 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 16:20:00,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 16:20:00,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 16:20:00,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 16:20:00,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 16:20:00,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 16:20:00,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 16:20:00,683 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 16:20:00,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 16:20:00,684 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 16:20:00,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 16:20:00,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 16:20:00,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 16:20:00,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 16:20:00,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:20:00,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 16:20:00,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 16:20:00,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 16:20:00,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 16:20:00,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 16:20:00,688 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 16:20:00,688 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 16:20:00,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 16:20:00,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 16:20:00,689 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_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/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_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2021-11-22 16:20:00,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 16:20:01,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 16:20:01,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 16:20:01,020 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 16:20:01,021 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 16:20:01,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-22 16:20:01,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/data/9aa696a5f/87d49e2d34324a1ba8f973030e65dbc8/FLAGfba2b09be [2021-11-22 16:20:01,609 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 16:20:01,609 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-22 16:20:01,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/data/9aa696a5f/87d49e2d34324a1ba8f973030e65dbc8/FLAGfba2b09be [2021-11-22 16:20:01,975 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/data/9aa696a5f/87d49e2d34324a1ba8f973030e65dbc8 [2021-11-22 16:20:01,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 16:20:01,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 16:20:01,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 16:20:01,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 16:20:01,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 16:20:01,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:20:01" (1/1) ... [2021-11-22 16:20:01,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57832841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:01, skipping insertion in model container [2021-11-22 16:20:01,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:20:01" (1/1) ... [2021-11-22 16:20:01,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 16:20:02,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 16:20:02,186 WARN L230 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_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-22 16:20:02,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:20:02,301 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 16:20:02,325 WARN L230 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_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-22 16:20:02,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:20:02,380 INFO L208 MainTranslator]: Completed translation [2021-11-22 16:20:02,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02 WrapperNode [2021-11-22 16:20:02,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 16:20:02,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 16:20:02,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 16:20:02,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 16:20:02,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,441 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 25, calls inlined = 31, statements flattened = 350 [2021-11-22 16:20:02,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 16:20:02,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 16:20:02,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 16:20:02,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 16:20:02,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 16:20:02,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 16:20:02,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 16:20:02,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 16:20:02,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:20:02,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:20:02,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 16:20:02,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 16:20:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 16:20:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 16:20:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 16:20:02,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 16:20:02,777 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 16:20:02,778 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 16:20:03,149 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 16:20:03,158 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 16:20:03,159 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-22 16:20:03,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:20:03 BoogieIcfgContainer [2021-11-22 16:20:03,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 16:20:03,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 16:20:03,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 16:20:03,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 16:20:03,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:20:01" (1/3) ... [2021-11-22 16:20:03,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d32c32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:20:03, skipping insertion in model container [2021-11-22 16:20:03,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (2/3) ... [2021-11-22 16:20:03,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d32c32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:20:03, skipping insertion in model container [2021-11-22 16:20:03,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:20:03" (3/3) ... [2021-11-22 16:20:03,170 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-11-22 16:20:03,175 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 16:20:03,175 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-22 16:20:03,262 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 16:20:03,268 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, mAutomataTypeConcurrency=PETRI_NET, 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-11-22 16:20:03,268 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-22 16:20:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.596774193548387) internal successors, (198), 125 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 16:20:03,299 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:03,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:03,301 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1945267885, now seen corresponding path program 1 times [2021-11-22 16:20:03,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:03,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814431076] [2021-11-22 16:20:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:03,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:03,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814431076] [2021-11-22 16:20:03,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814431076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:03,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:03,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:03,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116081440] [2021-11-22 16:20:03,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:03,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:03,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:03,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:03,621 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.596774193548387) internal successors, (198), 125 states have internal predecessors, (198), 0 states have call successors, (0), 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 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:03,714 INFO L93 Difference]: Finished difference Result 244 states and 386 transitions. [2021-11-22 16:20:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:03,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-22 16:20:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:03,737 INFO L225 Difference]: With dead ends: 244 [2021-11-22 16:20:03,738 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 16:20:03,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:03,747 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 5 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:03,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 369 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 16:20:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 16:20:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2021-11-22 16:20:03,816 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 32 [2021-11-22 16:20:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:03,817 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2021-11-22 16:20:03,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2021-11-22 16:20:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 16:20:03,827 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:03,827 INFO L514 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] [2021-11-22 16:20:03,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 16:20:03,828 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1987216090, now seen corresponding path program 1 times [2021-11-22 16:20:03,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:03,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109818438] [2021-11-22 16:20:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:03,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:03,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:03,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109818438] [2021-11-22 16:20:03,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109818438] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:03,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:03,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:03,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087820321] [2021-11-22 16:20:03,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:03,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:03,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:03,946 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:03,995 INFO L93 Difference]: Finished difference Result 231 states and 360 transitions. [2021-11-22 16:20:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:03,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-22 16:20:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:03,999 INFO L225 Difference]: With dead ends: 231 [2021-11-22 16:20:03,999 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 16:20:04,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,004 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 6 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:04,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 16:20:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 16:20:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.55) internal successors, (186), 120 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 186 transitions. [2021-11-22 16:20:04,026 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 186 transitions. Word has length 73 [2021-11-22 16:20:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,028 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 186 transitions. [2021-11-22 16:20:04,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 186 transitions. [2021-11-22 16:20:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 16:20:04,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,035 INFO L514 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, 1] [2021-11-22 16:20:04,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 16:20:04,037 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 21849430, now seen corresponding path program 1 times [2021-11-22 16:20:04,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015725586] [2021-11-22 16:20:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:04,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015725586] [2021-11-22 16:20:04,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015725586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:04,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796330267] [2021-11-22 16:20:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:04,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,127 INFO L87 Difference]: Start difference. First operand 121 states and 186 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,156 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2021-11-22 16:20:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:04,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-22 16:20:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,162 INFO L225 Difference]: With dead ends: 227 [2021-11-22 16:20:04,164 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 16:20:04,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,168 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 7 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:04,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 347 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 16:20:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 16:20:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 120 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2021-11-22 16:20:04,185 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 76 [2021-11-22 16:20:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,186 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2021-11-22 16:20:04,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2021-11-22 16:20:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-22 16:20:04,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,191 INFO L514 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, 1, 1, 1, 1] [2021-11-22 16:20:04,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 16:20:04,192 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1419680001, now seen corresponding path program 1 times [2021-11-22 16:20:04,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454257227] [2021-11-22 16:20:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:04,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454257227] [2021-11-22 16:20:04,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454257227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:04,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898143364] [2021-11-22 16:20:04,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:04,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,326 INFO L87 Difference]: Start difference. First operand 121 states and 185 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,351 INFO L93 Difference]: Finished difference Result 223 states and 346 transitions. [2021-11-22 16:20:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-22 16:20:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,356 INFO L225 Difference]: With dead ends: 223 [2021-11-22 16:20:04,372 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 16:20:04,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,377 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 8 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:04,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 16:20:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 16:20:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5333333333333334) internal successors, (184), 120 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2021-11-22 16:20:04,396 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 79 [2021-11-22 16:20:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,398 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2021-11-22 16:20:04,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2021-11-22 16:20:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 16:20:04,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,400 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:04,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 16:20:04,400 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1762144197, now seen corresponding path program 1 times [2021-11-22 16:20:04,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226426715] [2021-11-22 16:20:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:04,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226426715] [2021-11-22 16:20:04,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226426715] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:04,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958287681] [2021-11-22 16:20:04,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:04,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:04,542 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,610 INFO L93 Difference]: Finished difference Result 237 states and 362 transitions. [2021-11-22 16:20:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 16:20:04,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 16:20:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,614 INFO L225 Difference]: With dead ends: 237 [2021-11-22 16:20:04,614 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 16:20:04,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:04,616 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 163 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:04,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 16:20:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 16:20:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 120 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 182 transitions. [2021-11-22 16:20:04,630 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 182 transitions. Word has length 82 [2021-11-22 16:20:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,633 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 182 transitions. [2021-11-22 16:20:04,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 182 transitions. [2021-11-22 16:20:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 16:20:04,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,639 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:04,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 16:20:04,640 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 199430461, now seen corresponding path program 1 times [2021-11-22 16:20:04,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437758369] [2021-11-22 16:20:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:04,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437758369] [2021-11-22 16:20:04,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437758369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:04,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455774476] [2021-11-22 16:20:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:04,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:04,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,719 INFO L87 Difference]: Start difference. First operand 121 states and 182 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,766 INFO L93 Difference]: Finished difference Result 236 states and 361 transitions. [2021-11-22 16:20:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:04,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 16:20:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,770 INFO L225 Difference]: With dead ends: 236 [2021-11-22 16:20:04,770 INFO L226 Difference]: Without dead ends: 145 [2021-11-22 16:20:04,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,771 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 23 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:04,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 362 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-22 16:20:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-11-22 16:20:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5) internal successors, (216), 144 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 216 transitions. [2021-11-22 16:20:04,783 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 216 transitions. Word has length 82 [2021-11-22 16:20:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,784 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 216 transitions. [2021-11-22 16:20:04,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 216 transitions. [2021-11-22 16:20:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 16:20:04,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,785 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:04,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 16:20:04,786 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 158755711, now seen corresponding path program 1 times [2021-11-22 16:20:04,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33213904] [2021-11-22 16:20:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:04,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33213904] [2021-11-22 16:20:04,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33213904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:04,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192096607] [2021-11-22 16:20:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:04,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,831 INFO L87 Difference]: Start difference. First operand 145 states and 216 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,878 INFO L93 Difference]: Finished difference Result 366 states and 557 transitions. [2021-11-22 16:20:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:04,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 16:20:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,892 INFO L225 Difference]: With dead ends: 366 [2021-11-22 16:20:04,892 INFO L226 Difference]: Without dead ends: 265 [2021-11-22 16:20:04,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,894 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 149 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:04,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 327 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-22 16:20:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2021-11-22 16:20:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5115384615384615) internal successors, (393), 260 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 393 transitions. [2021-11-22 16:20:04,945 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 393 transitions. Word has length 82 [2021-11-22 16:20:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,945 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 393 transitions. [2021-11-22 16:20:04,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 393 transitions. [2021-11-22 16:20:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 16:20:04,947 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,948 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:04,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 16:20:04,948 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2051119617, now seen corresponding path program 1 times [2021-11-22 16:20:04,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135336771] [2021-11-22 16:20:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:05,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:05,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135336771] [2021-11-22 16:20:05,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135336771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:05,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:05,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:05,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483905647] [2021-11-22 16:20:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:05,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:05,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:05,041 INFO L87 Difference]: Start difference. First operand 261 states and 393 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,100 INFO L93 Difference]: Finished difference Result 505 states and 777 transitions. [2021-11-22 16:20:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 16:20:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,108 INFO L225 Difference]: With dead ends: 505 [2021-11-22 16:20:05,109 INFO L226 Difference]: Without dead ends: 317 [2021-11-22 16:20:05,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:05,111 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-22 16:20:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-11-22 16:20:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.5158227848101267) internal successors, (479), 316 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 479 transitions. [2021-11-22 16:20:05,144 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 479 transitions. Word has length 82 [2021-11-22 16:20:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:05,148 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 479 transitions. [2021-11-22 16:20:05,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 479 transitions. [2021-11-22 16:20:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 16:20:05,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:05,151 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:05,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 16:20:05,151 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1350361341, now seen corresponding path program 1 times [2021-11-22 16:20:05,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:05,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875978177] [2021-11-22 16:20:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:05,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:05,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:05,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875978177] [2021-11-22 16:20:05,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875978177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:05,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:05,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:05,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551707202] [2021-11-22 16:20:05,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:05,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:05,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:05,254 INFO L87 Difference]: Start difference. First operand 317 states and 479 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,329 INFO L93 Difference]: Finished difference Result 585 states and 884 transitions. [2021-11-22 16:20:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:20:05,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 16:20:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,333 INFO L225 Difference]: With dead ends: 585 [2021-11-22 16:20:05,333 INFO L226 Difference]: Without dead ends: 389 [2021-11-22 16:20:05,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:05,336 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 119 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 714 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-22 16:20:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 323. [2021-11-22 16:20:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.5062111801242235) internal successors, (485), 322 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 485 transitions. [2021-11-22 16:20:05,357 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 485 transitions. Word has length 82 [2021-11-22 16:20:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:05,358 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 485 transitions. [2021-11-22 16:20:05,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 485 transitions. [2021-11-22 16:20:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 16:20:05,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:05,360 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:05,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 16:20:05,361 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:05,361 INFO L85 PathProgramCache]: Analyzing trace with hash 321002043, now seen corresponding path program 1 times [2021-11-22 16:20:05,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:05,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639864311] [2021-11-22 16:20:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:05,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:05,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:05,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639864311] [2021-11-22 16:20:05,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639864311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:05,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:05,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:05,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400951681] [2021-11-22 16:20:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:05,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:05,413 INFO L87 Difference]: Start difference. First operand 323 states and 485 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,450 INFO L93 Difference]: Finished difference Result 603 states and 910 transitions. [2021-11-22 16:20:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 16:20:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,455 INFO L225 Difference]: With dead ends: 603 [2021-11-22 16:20:05,455 INFO L226 Difference]: Without dead ends: 401 [2021-11-22 16:20:05,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:05,457 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 63 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 320 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-11-22 16:20:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 397. [2021-11-22 16:20:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4974747474747474) internal successors, (593), 396 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 593 transitions. [2021-11-22 16:20:05,481 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 593 transitions. Word has length 82 [2021-11-22 16:20:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:05,485 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 593 transitions. [2021-11-22 16:20:05,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 593 transitions. [2021-11-22 16:20:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 16:20:05,489 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:05,489 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:05,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 16:20:05,490 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:05,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:05,490 INFO L85 PathProgramCache]: Analyzing trace with hash -160078215, now seen corresponding path program 1 times [2021-11-22 16:20:05,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:05,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722063094] [2021-11-22 16:20:05,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:05,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:05,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:05,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722063094] [2021-11-22 16:20:05,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722063094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:05,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:05,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:05,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088426626] [2021-11-22 16:20:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:05,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:05,575 INFO L87 Difference]: Start difference. First operand 397 states and 593 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,661 INFO L93 Difference]: Finished difference Result 851 states and 1268 transitions. [2021-11-22 16:20:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 16:20:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,666 INFO L225 Difference]: With dead ends: 851 [2021-11-22 16:20:05,667 INFO L226 Difference]: Without dead ends: 575 [2021-11-22 16:20:05,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 16:20:05,669 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 354 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 738 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-22 16:20:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2021-11-22 16:20:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.4664948453608246) internal successors, (569), 388 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 569 transitions. [2021-11-22 16:20:05,698 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 569 transitions. Word has length 82 [2021-11-22 16:20:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:05,699 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 569 transitions. [2021-11-22 16:20:05,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 569 transitions. [2021-11-22 16:20:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 16:20:05,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:05,704 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:05,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 16:20:05,705 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:05,706 INFO L85 PathProgramCache]: Analyzing trace with hash -296544543, now seen corresponding path program 1 times [2021-11-22 16:20:05,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:05,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370515501] [2021-11-22 16:20:05,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:05,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:05,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:05,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370515501] [2021-11-22 16:20:05,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370515501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:05,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:05,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:05,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929216789] [2021-11-22 16:20:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:05,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:05,758 INFO L87 Difference]: Start difference. First operand 389 states and 569 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,800 INFO L93 Difference]: Finished difference Result 669 states and 980 transitions. [2021-11-22 16:20:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:05,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 16:20:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,803 INFO L225 Difference]: With dead ends: 669 [2021-11-22 16:20:05,803 INFO L226 Difference]: Without dead ends: 319 [2021-11-22 16:20:05,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:05,806 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 492 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-11-22 16:20:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2021-11-22 16:20:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4465408805031446) internal successors, (460), 318 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 460 transitions. [2021-11-22 16:20:05,826 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 460 transitions. Word has length 85 [2021-11-22 16:20:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:05,826 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 460 transitions. [2021-11-22 16:20:05,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 460 transitions. [2021-11-22 16:20:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 16:20:05,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:05,828 INFO L514 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, 1, 1] [2021-11-22 16:20:05,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 16:20:05,829 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash 380949780, now seen corresponding path program 1 times [2021-11-22 16:20:05,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:05,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044308903] [2021-11-22 16:20:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:05,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:05,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044308903] [2021-11-22 16:20:05,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044308903] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:05,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:05,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:05,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043229759] [2021-11-22 16:20:05,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:05,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:05,895 INFO L87 Difference]: Start difference. First operand 319 states and 460 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,973 INFO L93 Difference]: Finished difference Result 1039 states and 1511 transitions. [2021-11-22 16:20:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 16:20:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-22 16:20:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,978 INFO L225 Difference]: With dead ends: 1039 [2021-11-22 16:20:05,979 INFO L226 Difference]: Without dead ends: 791 [2021-11-22 16:20:05,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:05,980 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 236 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 659 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-11-22 16:20:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 783. [2021-11-22 16:20:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4526854219948848) internal successors, (1136), 782 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1136 transitions. [2021-11-22 16:20:06,039 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1136 transitions. Word has length 97 [2021-11-22 16:20:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:06,039 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 1136 transitions. [2021-11-22 16:20:06,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1136 transitions. [2021-11-22 16:20:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 16:20:06,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:06,042 INFO L514 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, 1, 1, 1] [2021-11-22 16:20:06,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 16:20:06,043 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1002780980, now seen corresponding path program 1 times [2021-11-22 16:20:06,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872905074] [2021-11-22 16:20:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:06,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:06,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:06,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872905074] [2021-11-22 16:20:06,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872905074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:06,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:06,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:06,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827806327] [2021-11-22 16:20:06,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:06,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:06,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:06,126 INFO L87 Difference]: Start difference. First operand 783 states and 1136 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:06,248 INFO L93 Difference]: Finished difference Result 1495 states and 2177 transitions. [2021-11-22 16:20:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 16:20:06,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-22 16:20:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:06,254 INFO L225 Difference]: With dead ends: 1495 [2021-11-22 16:20:06,254 INFO L226 Difference]: Without dead ends: 783 [2021-11-22 16:20:06,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-22 16:20:06,256 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 286 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:06,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 342 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2021-11-22 16:20:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2021-11-22 16:20:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4475703324808185) internal successors, (1132), 782 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1132 transitions. [2021-11-22 16:20:06,318 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1132 transitions. Word has length 98 [2021-11-22 16:20:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:06,318 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 1132 transitions. [2021-11-22 16:20:06,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1132 transitions. [2021-11-22 16:20:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 16:20:06,321 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:06,321 INFO L514 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, 1, 1, 1, 1] [2021-11-22 16:20:06,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 16:20:06,322 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash 151780410, now seen corresponding path program 1 times [2021-11-22 16:20:06,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:06,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399513527] [2021-11-22 16:20:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:06,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:06,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:06,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399513527] [2021-11-22 16:20:06,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399513527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:06,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:06,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:06,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57628908] [2021-11-22 16:20:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:06,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:06,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:06,362 INFO L87 Difference]: Start difference. First operand 783 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:06,478 INFO L93 Difference]: Finished difference Result 2179 states and 3158 transitions. [2021-11-22 16:20:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 16:20:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:06,488 INFO L225 Difference]: With dead ends: 2179 [2021-11-22 16:20:06,489 INFO L226 Difference]: Without dead ends: 1467 [2021-11-22 16:20:06,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:06,494 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 101 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:06,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 346 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2021-11-22 16:20:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 795. [2021-11-22 16:20:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.4408060453400504) internal successors, (1144), 794 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1144 transitions. [2021-11-22 16:20:06,573 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1144 transitions. Word has length 99 [2021-11-22 16:20:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:06,573 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1144 transitions. [2021-11-22 16:20:06,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2021-11-22 16:20:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 16:20:06,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:06,576 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-22 16:20:06,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 16:20:06,577 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2041109337, now seen corresponding path program 1 times [2021-11-22 16:20:06,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:06,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988433714] [2021-11-22 16:20:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:06,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:06,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:06,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988433714] [2021-11-22 16:20:06,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988433714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:06,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:06,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:06,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183362798] [2021-11-22 16:20:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:06,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:06,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:06,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:06,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:06,655 INFO L87 Difference]: Start difference. First operand 795 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:06,764 INFO L93 Difference]: Finished difference Result 1503 states and 2161 transitions. [2021-11-22 16:20:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 16:20:06,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-22 16:20:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:06,770 INFO L225 Difference]: With dead ends: 1503 [2021-11-22 16:20:06,770 INFO L226 Difference]: Without dead ends: 779 [2021-11-22 16:20:06,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-22 16:20:06,772 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 278 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:06,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 325 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-11-22 16:20:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2021-11-22 16:20:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.424164524421594) internal successors, (1108), 778 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1108 transitions. [2021-11-22 16:20:06,841 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1108 transitions. Word has length 100 [2021-11-22 16:20:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:06,842 INFO L470 AbstractCegarLoop]: Abstraction has 779 states and 1108 transitions. [2021-11-22 16:20:06,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1108 transitions. [2021-11-22 16:20:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 16:20:06,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:06,844 INFO L514 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, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:06,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 16:20:06,845 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1410373239, now seen corresponding path program 1 times [2021-11-22 16:20:06,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636586313] [2021-11-22 16:20:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:06,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:06,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636586313] [2021-11-22 16:20:06,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636586313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:06,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:06,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:06,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450224558] [2021-11-22 16:20:06,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:06,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:06,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:06,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:06,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:06,893 INFO L87 Difference]: Start difference. First operand 779 states and 1108 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:07,017 INFO L93 Difference]: Finished difference Result 2179 states and 3112 transitions. [2021-11-22 16:20:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:07,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 16:20:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:07,027 INFO L225 Difference]: With dead ends: 2179 [2021-11-22 16:20:07,028 INFO L226 Difference]: Without dead ends: 1471 [2021-11-22 16:20:07,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:07,033 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 100 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:07,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2021-11-22 16:20:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 787. [2021-11-22 16:20:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.4198473282442747) internal successors, (1116), 786 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1116 transitions. [2021-11-22 16:20:07,143 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1116 transitions. Word has length 101 [2021-11-22 16:20:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:07,143 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1116 transitions. [2021-11-22 16:20:07,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1116 transitions. [2021-11-22 16:20:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 16:20:07,146 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:07,147 INFO L514 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, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:07,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 16:20:07,147 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:07,148 INFO L85 PathProgramCache]: Analyzing trace with hash 517899463, now seen corresponding path program 1 times [2021-11-22 16:20:07,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:07,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109686361] [2021-11-22 16:20:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:07,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:07,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:07,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109686361] [2021-11-22 16:20:07,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109686361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:07,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:07,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:07,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117853714] [2021-11-22 16:20:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:07,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:07,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:07,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:07,194 INFO L87 Difference]: Start difference. First operand 787 states and 1116 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:07,282 INFO L93 Difference]: Finished difference Result 1729 states and 2445 transitions. [2021-11-22 16:20:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 16:20:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:07,291 INFO L225 Difference]: With dead ends: 1729 [2021-11-22 16:20:07,291 INFO L226 Difference]: Without dead ends: 1013 [2021-11-22 16:20:07,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:07,294 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 44 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:07,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 348 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2021-11-22 16:20:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 935. [2021-11-22 16:20:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.4132762312633833) internal successors, (1320), 934 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1320 transitions. [2021-11-22 16:20:07,380 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1320 transitions. Word has length 101 [2021-11-22 16:20:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:07,381 INFO L470 AbstractCegarLoop]: Abstraction has 935 states and 1320 transitions. [2021-11-22 16:20:07,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1320 transitions. [2021-11-22 16:20:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 16:20:07,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:07,384 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:07,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 16:20:07,384 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:07,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash -274060690, now seen corresponding path program 1 times [2021-11-22 16:20:07,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:07,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245145774] [2021-11-22 16:20:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:07,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:07,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:07,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245145774] [2021-11-22 16:20:07,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245145774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:07,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:07,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:07,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214208755] [2021-11-22 16:20:07,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:07,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:07,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:07,441 INFO L87 Difference]: Start difference. First operand 935 states and 1320 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:07,598 INFO L93 Difference]: Finished difference Result 1951 states and 2756 transitions. [2021-11-22 16:20:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:07,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 104 [2021-11-22 16:20:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:07,605 INFO L225 Difference]: With dead ends: 1951 [2021-11-22 16:20:07,605 INFO L226 Difference]: Without dead ends: 1087 [2021-11-22 16:20:07,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:07,608 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 350 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:07,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 344 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-11-22 16:20:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1083. [2021-11-22 16:20:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.4011090573012939) internal successors, (1516), 1082 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1516 transitions. [2021-11-22 16:20:07,706 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1516 transitions. Word has length 104 [2021-11-22 16:20:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:07,706 INFO L470 AbstractCegarLoop]: Abstraction has 1083 states and 1516 transitions. [2021-11-22 16:20:07,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1516 transitions. [2021-11-22 16:20:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 16:20:07,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:07,709 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:07,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 16:20:07,710 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1649167344, now seen corresponding path program 1 times [2021-11-22 16:20:07,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:07,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578592956] [2021-11-22 16:20:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:07,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:07,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:07,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578592956] [2021-11-22 16:20:07,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578592956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:07,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:07,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:07,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646544996] [2021-11-22 16:20:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:07,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:07,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:07,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:07,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:07,767 INFO L87 Difference]: Start difference. First operand 1083 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:07,967 INFO L93 Difference]: Finished difference Result 2525 states and 3521 transitions. [2021-11-22 16:20:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 104 [2021-11-22 16:20:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:07,977 INFO L225 Difference]: With dead ends: 2525 [2021-11-22 16:20:07,977 INFO L226 Difference]: Without dead ends: 1477 [2021-11-22 16:20:07,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:07,980 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 374 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:07,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 368 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2021-11-22 16:20:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1473. [2021-11-22 16:20:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1472 states have (on average 1.3797554347826086) internal successors, (2031), 1472 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2031 transitions. [2021-11-22 16:20:08,115 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2031 transitions. Word has length 104 [2021-11-22 16:20:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:08,115 INFO L470 AbstractCegarLoop]: Abstraction has 1473 states and 2031 transitions. [2021-11-22 16:20:08,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2031 transitions. [2021-11-22 16:20:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 16:20:08,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:08,119 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:08,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 16:20:08,119 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1711206958, now seen corresponding path program 1 times [2021-11-22 16:20:08,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:08,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006636732] [2021-11-22 16:20:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:08,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:08,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006636732] [2021-11-22 16:20:08,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006636732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:08,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:08,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:08,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491209956] [2021-11-22 16:20:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:08,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:08,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:08,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:08,182 INFO L87 Difference]: Start difference. First operand 1473 states and 2031 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:08,440 INFO L93 Difference]: Finished difference Result 3529 states and 4833 transitions. [2021-11-22 16:20:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:08,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 104 [2021-11-22 16:20:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:08,453 INFO L225 Difference]: With dead ends: 3529 [2021-11-22 16:20:08,453 INFO L226 Difference]: Without dead ends: 2119 [2021-11-22 16:20:08,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:08,456 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 370 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:08,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 360 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-11-22 16:20:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2115. [2021-11-22 16:20:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2114 states have (on average 1.3543046357615893) internal successors, (2863), 2114 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2863 transitions. [2021-11-22 16:20:08,659 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2863 transitions. Word has length 104 [2021-11-22 16:20:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:08,660 INFO L470 AbstractCegarLoop]: Abstraction has 2115 states and 2863 transitions. [2021-11-22 16:20:08,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2863 transitions. [2021-11-22 16:20:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 16:20:08,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:08,664 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:08,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 16:20:08,664 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1851755568, now seen corresponding path program 1 times [2021-11-22 16:20:08,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:08,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505728110] [2021-11-22 16:20:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:08,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:08,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:08,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505728110] [2021-11-22 16:20:08,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505728110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:08,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:08,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:08,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977563090] [2021-11-22 16:20:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:08,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:08,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:08,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:08,751 INFO L87 Difference]: Start difference. First operand 2115 states and 2863 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:09,067 INFO L93 Difference]: Finished difference Result 4809 states and 6518 transitions. [2021-11-22 16:20:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:20:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 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 104 [2021-11-22 16:20:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:09,084 INFO L225 Difference]: With dead ends: 4809 [2021-11-22 16:20:09,085 INFO L226 Difference]: Without dead ends: 2817 [2021-11-22 16:20:09,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:09,088 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 611 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:09,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 519 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2021-11-22 16:20:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2265. [2021-11-22 16:20:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.3418727915194346) internal successors, (3038), 2264 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3038 transitions. [2021-11-22 16:20:09,253 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3038 transitions. Word has length 104 [2021-11-22 16:20:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:09,253 INFO L470 AbstractCegarLoop]: Abstraction has 2265 states and 3038 transitions. [2021-11-22 16:20:09,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3038 transitions. [2021-11-22 16:20:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-22 16:20:09,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:09,257 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:09,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 16:20:09,258 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1821084671, now seen corresponding path program 1 times [2021-11-22 16:20:09,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:09,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453772375] [2021-11-22 16:20:09,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:09,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:09,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453772375] [2021-11-22 16:20:09,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453772375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:09,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:09,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:09,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180982697] [2021-11-22 16:20:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:09,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:09,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:09,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:09,328 INFO L87 Difference]: Start difference. First operand 2265 states and 3038 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:09,659 INFO L93 Difference]: Finished difference Result 5415 states and 7254 transitions. [2021-11-22 16:20:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:20:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-22 16:20:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:09,679 INFO L225 Difference]: With dead ends: 5415 [2021-11-22 16:20:09,680 INFO L226 Difference]: Without dead ends: 3303 [2021-11-22 16:20:09,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:09,685 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 650 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:09,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 561 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2021-11-22 16:20:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2557. [2021-11-22 16:20:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.3262910798122065) internal successors, (3390), 2556 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3390 transitions. [2021-11-22 16:20:09,916 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3390 transitions. Word has length 105 [2021-11-22 16:20:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:09,916 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 3390 transitions. [2021-11-22 16:20:09,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3390 transitions. [2021-11-22 16:20:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-22 16:20:09,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:09,921 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:09,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 16:20:09,922 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1650223701, now seen corresponding path program 1 times [2021-11-22 16:20:09,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:09,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345606308] [2021-11-22 16:20:09,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:09,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:09,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:09,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345606308] [2021-11-22 16:20:09,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345606308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:09,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:09,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:09,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986478036] [2021-11-22 16:20:09,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:09,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:09,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:09,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:09,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:09,978 INFO L87 Difference]: Start difference. First operand 2557 states and 3390 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:10,428 INFO L93 Difference]: Finished difference Result 6302 states and 8323 transitions. [2021-11-22 16:20:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:20:10,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-22 16:20:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:10,449 INFO L225 Difference]: With dead ends: 6302 [2021-11-22 16:20:10,450 INFO L226 Difference]: Without dead ends: 3946 [2021-11-22 16:20:10,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:10,455 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 646 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:10,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 563 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-11-22 16:20:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3055. [2021-11-22 16:20:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 3054 states have (on average 1.3077930582842174) internal successors, (3994), 3054 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 3994 transitions. [2021-11-22 16:20:10,724 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 3994 transitions. Word has length 106 [2021-11-22 16:20:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:10,724 INFO L470 AbstractCegarLoop]: Abstraction has 3055 states and 3994 transitions. [2021-11-22 16:20:10,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3994 transitions. [2021-11-22 16:20:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:10,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:10,729 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:10,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 16:20:10,730 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash -754854780, now seen corresponding path program 1 times [2021-11-22 16:20:10,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:10,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023571237] [2021-11-22 16:20:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:10,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:10,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:10,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023571237] [2021-11-22 16:20:10,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023571237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:10,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:10,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:10,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175238848] [2021-11-22 16:20:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:10,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:10,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:10,783 INFO L87 Difference]: Start difference. First operand 3055 states and 3994 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:11,191 INFO L93 Difference]: Finished difference Result 6717 states and 8830 transitions. [2021-11-22 16:20:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:20:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:11,217 INFO L225 Difference]: With dead ends: 6717 [2021-11-22 16:20:11,217 INFO L226 Difference]: Without dead ends: 3967 [2021-11-22 16:20:11,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:11,223 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 577 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:11,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 510 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2021-11-22 16:20:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3959. [2021-11-22 16:20:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3958 states have (on average 1.303688731682668) internal successors, (5160), 3958 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5160 transitions. [2021-11-22 16:20:11,551 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5160 transitions. Word has length 107 [2021-11-22 16:20:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:11,552 INFO L470 AbstractCegarLoop]: Abstraction has 3959 states and 5160 transitions. [2021-11-22 16:20:11,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5160 transitions. [2021-11-22 16:20:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:11,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:11,560 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:11,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 16:20:11,561 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash -918958968, now seen corresponding path program 1 times [2021-11-22 16:20:11,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:11,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149967405] [2021-11-22 16:20:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:11,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:11,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149967405] [2021-11-22 16:20:11,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149967405] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:11,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:11,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:11,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674859854] [2021-11-22 16:20:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:11,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:11,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:11,613 INFO L87 Difference]: Start difference. First operand 3959 states and 5160 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:12,078 INFO L93 Difference]: Finished difference Result 9353 states and 12225 transitions. [2021-11-22 16:20:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:12,094 INFO L225 Difference]: With dead ends: 9353 [2021-11-22 16:20:12,094 INFO L226 Difference]: Without dead ends: 5700 [2021-11-22 16:20:12,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 16:20:12,101 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 282 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:12,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 713 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2021-11-22 16:20:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 3938. [2021-11-22 16:20:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 1.3030226060452121) internal successors, (5130), 3937 states have internal predecessors, (5130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5130 transitions. [2021-11-22 16:20:12,458 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5130 transitions. Word has length 107 [2021-11-22 16:20:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:12,459 INFO L470 AbstractCegarLoop]: Abstraction has 3938 states and 5130 transitions. [2021-11-22 16:20:12,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5130 transitions. [2021-11-22 16:20:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:12,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:12,465 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:12,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 16:20:12,465 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1381863622, now seen corresponding path program 1 times [2021-11-22 16:20:12,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:12,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174839504] [2021-11-22 16:20:12,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:12,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:12,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174839504] [2021-11-22 16:20:12,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174839504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:12,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:12,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:12,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973814528] [2021-11-22 16:20:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:12,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:12,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:12,508 INFO L87 Difference]: Start difference. First operand 3938 states and 5130 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:12,837 INFO L93 Difference]: Finished difference Result 7582 states and 9891 transitions. [2021-11-22 16:20:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:12,847 INFO L225 Difference]: With dead ends: 7582 [2021-11-22 16:20:12,847 INFO L226 Difference]: Without dead ends: 3950 [2021-11-22 16:20:12,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:12,853 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 312 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:12,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 391 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-11-22 16:20:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3938. [2021-11-22 16:20:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 1.2931165862331724) internal successors, (5091), 3937 states have internal predecessors, (5091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5091 transitions. [2021-11-22 16:20:13,140 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5091 transitions. Word has length 107 [2021-11-22 16:20:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:13,140 INFO L470 AbstractCegarLoop]: Abstraction has 3938 states and 5091 transitions. [2021-11-22 16:20:13,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5091 transitions. [2021-11-22 16:20:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:13,146 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:13,146 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:13,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 16:20:13,146 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash 988836612, now seen corresponding path program 1 times [2021-11-22 16:20:13,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:13,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077616333] [2021-11-22 16:20:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:13,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:13,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:13,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077616333] [2021-11-22 16:20:13,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077616333] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:13,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:13,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:13,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468230132] [2021-11-22 16:20:13,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:13,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:13,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:13,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:13,189 INFO L87 Difference]: Start difference. First operand 3938 states and 5091 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:13,635 INFO L93 Difference]: Finished difference Result 10203 states and 13133 transitions. [2021-11-22 16:20:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:20:13,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:13,648 INFO L225 Difference]: With dead ends: 10203 [2021-11-22 16:20:13,649 INFO L226 Difference]: Without dead ends: 6571 [2021-11-22 16:20:13,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:13,656 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 283 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:13,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 681 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6571 states. [2021-11-22 16:20:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6571 to 3938. [2021-11-22 16:20:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 1.2908305816611634) internal successors, (5082), 3937 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5082 transitions. [2021-11-22 16:20:13,966 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5082 transitions. Word has length 107 [2021-11-22 16:20:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:13,966 INFO L470 AbstractCegarLoop]: Abstraction has 3938 states and 5082 transitions. [2021-11-22 16:20:13,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5082 transitions. [2021-11-22 16:20:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:13,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:13,972 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:13,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 16:20:13,973 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1531123322, now seen corresponding path program 1 times [2021-11-22 16:20:13,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878669972] [2021-11-22 16:20:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:13,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 16:20:14,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:14,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878669972] [2021-11-22 16:20:14,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878669972] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:14,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:14,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:14,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205045252] [2021-11-22 16:20:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:14,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:14,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:14,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:14,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:14,013 INFO L87 Difference]: Start difference. First operand 3938 states and 5082 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:14,490 INFO L93 Difference]: Finished difference Result 5308 states and 6814 transitions. [2021-11-22 16:20:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:14,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:14,502 INFO L225 Difference]: With dead ends: 5308 [2021-11-22 16:20:14,503 INFO L226 Difference]: Without dead ends: 5304 [2021-11-22 16:20:14,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:14,506 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 61 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:14,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 316 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2021-11-22 16:20:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 5304. [2021-11-22 16:20:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5304 states, 5303 states have (on average 1.2832359042051669) internal successors, (6805), 5303 states have internal predecessors, (6805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 6805 transitions. [2021-11-22 16:20:14,920 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 6805 transitions. Word has length 107 [2021-11-22 16:20:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:14,920 INFO L470 AbstractCegarLoop]: Abstraction has 5304 states and 6805 transitions. [2021-11-22 16:20:14,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 6805 transitions. [2021-11-22 16:20:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:14,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:14,926 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:14,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 16:20:14,927 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash 392654924, now seen corresponding path program 1 times [2021-11-22 16:20:14,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:14,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467959188] [2021-11-22 16:20:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:14,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:14,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467959188] [2021-11-22 16:20:14,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467959188] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 16:20:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867076126] [2021-11-22 16:20:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:14,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:20:14,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:20:14,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 16:20:14,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 16:20:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:15,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 16:20:15,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:20:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:15,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 16:20:15,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867076126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:15,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 16:20:15,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-22 16:20:15,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433982742] [2021-11-22 16:20:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:15,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:15,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:15,401 INFO L87 Difference]: Start difference. First operand 5304 states and 6805 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:15,894 INFO L93 Difference]: Finished difference Result 9200 states and 11867 transitions. [2021-11-22 16:20:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 16:20:15,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:15,906 INFO L225 Difference]: With dead ends: 9200 [2021-11-22 16:20:15,906 INFO L226 Difference]: Without dead ends: 5439 [2021-11-22 16:20:15,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:15,912 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 276 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:15,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 309 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2021-11-22 16:20:16,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5439. [2021-11-22 16:20:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5438 states have (on average 1.2789628539904376) internal successors, (6955), 5438 states have internal predecessors, (6955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 6955 transitions. [2021-11-22 16:20:16,313 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 6955 transitions. Word has length 107 [2021-11-22 16:20:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:16,313 INFO L470 AbstractCegarLoop]: Abstraction has 5439 states and 6955 transitions. [2021-11-22 16:20:16,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 6955 transitions. [2021-11-22 16:20:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:16,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:16,318 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:16,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 16:20:16,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:20:16,545 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash 377136206, now seen corresponding path program 1 times [2021-11-22 16:20:16,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:16,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810274136] [2021-11-22 16:20:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:16,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:16,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810274136] [2021-11-22 16:20:16,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810274136] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:16,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:16,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:16,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672218809] [2021-11-22 16:20:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:16,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:16,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:16,596 INFO L87 Difference]: Start difference. First operand 5439 states and 6955 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:17,180 INFO L93 Difference]: Finished difference Result 15403 states and 19713 transitions. [2021-11-22 16:20:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 16:20:17,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:17,201 INFO L225 Difference]: With dead ends: 15403 [2021-11-22 16:20:17,202 INFO L226 Difference]: Without dead ends: 10141 [2021-11-22 16:20:17,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:17,212 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 96 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:17,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 525 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10141 states. [2021-11-22 16:20:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10141 to 5463. [2021-11-22 16:20:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5463 states, 5462 states have (on average 1.2777370926400586) internal successors, (6979), 5462 states have internal predecessors, (6979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 6979 transitions. [2021-11-22 16:20:17,664 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 6979 transitions. Word has length 107 [2021-11-22 16:20:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:17,664 INFO L470 AbstractCegarLoop]: Abstraction has 5463 states and 6979 transitions. [2021-11-22 16:20:17,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 6979 transitions. [2021-11-22 16:20:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 16:20:17,670 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:17,670 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:17,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 16:20:17,671 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1120529074, now seen corresponding path program 1 times [2021-11-22 16:20:17,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:17,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395448884] [2021-11-22 16:20:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:17,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:17,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395448884] [2021-11-22 16:20:17,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395448884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:17,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:17,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:17,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092799287] [2021-11-22 16:20:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:17,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:17,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:17,718 INFO L87 Difference]: Start difference. First operand 5463 states and 6979 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:18,172 INFO L93 Difference]: Finished difference Result 10589 states and 13533 transitions. [2021-11-22 16:20:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 16:20:18,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2021-11-22 16:20:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:18,186 INFO L225 Difference]: With dead ends: 10589 [2021-11-22 16:20:18,186 INFO L226 Difference]: Without dead ends: 5303 [2021-11-22 16:20:18,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-22 16:20:18,194 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 263 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:18,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 329 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2021-11-22 16:20:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 5303. [2021-11-22 16:20:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5303 states, 5302 states have (on average 1.2749905695963788) internal successors, (6760), 5302 states have internal predecessors, (6760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 6760 transitions. [2021-11-22 16:20:18,793 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 6760 transitions. Word has length 107 [2021-11-22 16:20:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:18,794 INFO L470 AbstractCegarLoop]: Abstraction has 5303 states and 6760 transitions. [2021-11-22 16:20:18,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 6760 transitions. [2021-11-22 16:20:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-22 16:20:18,803 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:18,804 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:18,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 16:20:18,804 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1901059480, now seen corresponding path program 1 times [2021-11-22 16:20:18,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348748633] [2021-11-22 16:20:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:18,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-22 16:20:18,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348748633] [2021-11-22 16:20:18,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348748633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:18,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:18,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:18,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499008888] [2021-11-22 16:20:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:18,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:18,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:18,869 INFO L87 Difference]: Start difference. First operand 5303 states and 6760 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:18,961 INFO L93 Difference]: Finished difference Result 5620 states and 7139 transitions. [2021-11-22 16:20:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 16:20:18,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 170 [2021-11-22 16:20:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:18,962 INFO L225 Difference]: With dead ends: 5620 [2021-11-22 16:20:18,963 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 16:20:18,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:18,969 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:18,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 288 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 16:20:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 16:20:18,971 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-11-22 16:20:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 16:20:18,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2021-11-22 16:20:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:18,972 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 16:20:18,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:20:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 16:20:18,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 16:20:18,977 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-22 16:20:18,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 16:20:18,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 16:24:07,127 WARN L227 SmtUtils]: Spent 3.79m on a formula simplification. DAG size of input: 123 DAG size of output: 104 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-22 16:24:19,875 INFO L854 garLoopResultBuilder]: At program point L432-2(lines 432 454) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,876 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2021-11-22 16:24:19,876 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2021-11-22 16:24:19,876 INFO L858 garLoopResultBuilder]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2021-11-22 16:24:19,876 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2021-11-22 16:24:19,877 INFO L858 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2021-11-22 16:24:19,877 INFO L858 garLoopResultBuilder]: For program point L137-3(lines 137 142) no Hoare annotation was computed. [2021-11-22 16:24:19,877 INFO L858 garLoopResultBuilder]: For program point L137-5(lines 137 142) no Hoare annotation was computed. [2021-11-22 16:24:19,877 INFO L858 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2021-11-22 16:24:19,877 INFO L858 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2021-11-22 16:24:19,877 INFO L858 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,878 INFO L858 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,878 INFO L858 garLoopResultBuilder]: For program point L369-3(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,878 INFO L858 garLoopResultBuilder]: For program point L336-3(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,878 INFO L854 garLoopResultBuilder]: At program point L205(lines 193 207) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,878 INFO L854 garLoopResultBuilder]: At program point L205-1(lines 193 207) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~z_ev~0 ~d1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~d1_ev~0 0) .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,879 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2021-11-22 16:24:19,879 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2021-11-22 16:24:19,879 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2021-11-22 16:24:19,879 INFO L858 garLoopResultBuilder]: For program point L107-1(lines 107 127) no Hoare annotation was computed. [2021-11-22 16:24:19,879 INFO L854 garLoopResultBuilder]: At program point L240-1(lines 208 250) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,880 INFO L854 garLoopResultBuilder]: At program point L240-3(lines 208 250) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~z_ev~0 ~d1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~d1_ev~0 0) .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,880 INFO L854 garLoopResultBuilder]: At program point L175(lines 163 177) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~b1_ev~0 1)) (not (= ~d1_val_t~0 ~d1_val~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)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,880 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 163 177) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~b1_ev~0 1))) (.cse12 (not (= ~d0_val~0 0))) (.cse13 (not (= ~b1_val_t~0 0))) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse15 (not (= ~d1_val~0 0))) (.cse16 (= ~z_val~0 0)) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~z_req_up~0 1) .cse17 .cse18 .cse19))) [2021-11-22 16:24:19,881 INFO L858 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2021-11-22 16:24:19,881 INFO L854 garLoopResultBuilder]: At program point L374-1(lines 350 382) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,881 INFO L854 garLoopResultBuilder]: At program point L341-1(lines 317 349) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,882 INFO L854 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0))) (let ((.cse20 (not .cse3)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~b1_ev~0 1))) (.cse12 (not (= ~d0_val~0 0))) (.cse13 (not (= ~b1_val_t~0 0))) (.cse21 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (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 .cse17 .cse18 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 1) .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 (= ~z_req_up~0 1) .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse19)))) [2021-11-22 16:24:19,882 INFO L854 garLoopResultBuilder]: At program point L374-3(lines 350 382) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~b1_ev~0 1))) (.cse12 (not (= ~d0_val~0 0))) (.cse13 (not (= ~b1_val_t~0 0))) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse15 (not (= ~d1_val~0 0))) (.cse16 (= ~z_val~0 0)) (.cse17 (not (= ~b1_ev~0 0))) (.cse18 (not (= ~d0_val_t~0 0))) (.cse19 (not (= ~b1_val~0 0))) (.cse20 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse20) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-22 16:24:19,882 INFO L854 garLoopResultBuilder]: At program point L341-3(lines 317 349) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~d0_val~0 0))) (.cse11 (not (= ~b1_val_t~0 0))) (.cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (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 .cse17 (= ~d1_ev~0 1) .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~z_ev~0 ~d1_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,883 INFO L854 garLoopResultBuilder]: At program point L275-1(lines 267 277) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,883 INFO L854 garLoopResultBuilder]: At program point L276(lines 264 278) the Hoare annotation is: (let ((.cse22 (= ~comp_m1_st~0 0))) (let ((.cse0 (not .cse22)) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse18 (not (= ~b1_ev~0 0))) (.cse19 (not (= ~d0_val_t~0 0))) (.cse20 (not (= ~b1_val~0 0))) (.cse21 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~z_req_up~0 1) .cse19 .cse20 .cse21) (and (= |ULTIMATE.start_exists_runnable_thread_#res#1| 1) .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 1) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse21)))) [2021-11-22 16:24:19,883 INFO L854 garLoopResultBuilder]: At program point L276-1(lines 264 278) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,884 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2021-11-22 16:24:19,884 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 111 126) no Hoare annotation was computed. [2021-11-22 16:24:19,884 INFO L854 garLoopResultBuilder]: At program point L145(lines 133 147) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~b1_ev~0 ~z_ev~0) (= ~comp_m1_st~0 0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (= ~z_ev~0 ~d0_ev~0) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1)) (= 1 ~b1_req_up~0)) [2021-11-22 16:24:19,884 INFO L854 garLoopResultBuilder]: At program point L145-1(lines 133 147) the Hoare annotation is: false [2021-11-22 16:24:19,884 INFO L858 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2021-11-22 16:24:19,885 INFO L861 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2021-11-22 16:24:19,885 INFO L854 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse18 (not (= ~b1_ev~0 0))) (.cse19 (not (= ~d0_val_t~0 0))) (.cse20 (not (= ~b1_val~0 0))) (.cse21 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~z_req_up~0 1) .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse21))) [2021-11-22 16:24:19,885 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 218) no Hoare annotation was computed. [2021-11-22 16:24:19,885 INFO L858 garLoopResultBuilder]: For program point L212-2(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,885 INFO L858 garLoopResultBuilder]: For program point L212-3(lines 212 218) no Hoare annotation was computed. [2021-11-22 16:24:19,886 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2021-11-22 16:24:19,886 INFO L858 garLoopResultBuilder]: For program point L212-5(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,886 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2021-11-22 16:24:19,886 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 115 125) no Hoare annotation was computed. [2021-11-22 16:24:19,886 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2021-11-22 16:24:19,886 INFO L858 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2021-11-22 16:24:19,886 INFO L858 garLoopResultBuilder]: For program point L182-3(lines 182 187) no Hoare annotation was computed. [2021-11-22 16:24:19,887 INFO L858 garLoopResultBuilder]: For program point L182-5(lines 182 187) no Hoare annotation was computed. [2021-11-22 16:24:19,887 INFO L854 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,887 INFO L854 garLoopResultBuilder]: At program point L415(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,888 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2021-11-22 16:24:19,888 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2021-11-22 16:24:19,888 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-11-22 16:24:19,888 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-11-22 16:24:19,888 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 16:24:19,888 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2021-11-22 16:24:19,888 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2021-11-22 16:24:19,889 INFO L858 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2021-11-22 16:24:19,889 INFO L858 garLoopResultBuilder]: For program point L119-1(lines 119 124) no Hoare annotation was computed. [2021-11-22 16:24:19,889 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2021-11-22 16:24:19,889 INFO L858 garLoopResultBuilder]: For program point L152-3(lines 152 157) no Hoare annotation was computed. [2021-11-22 16:24:19,889 INFO L854 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2021-11-22 16:24:19,889 INFO L858 garLoopResultBuilder]: For program point L152-5(lines 152 157) no Hoare annotation was computed. [2021-11-22 16:24:19,890 INFO L858 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,890 INFO L858 garLoopResultBuilder]: For program point L219-3(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,890 INFO L858 garLoopResultBuilder]: For program point L286(line 286) no Hoare annotation was computed. [2021-11-22 16:24:19,890 INFO L858 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2021-11-22 16:24:19,890 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 325) no Hoare annotation was computed. [2021-11-22 16:24:19,890 INFO L858 garLoopResultBuilder]: For program point L354-2(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,890 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2021-11-22 16:24:19,891 INFO L858 garLoopResultBuilder]: For program point L321-2(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,891 INFO L858 garLoopResultBuilder]: For program point L354-3(lines 354 358) no Hoare annotation was computed. [2021-11-22 16:24:19,891 INFO L858 garLoopResultBuilder]: For program point L321-3(lines 321 325) no Hoare annotation was computed. [2021-11-22 16:24:19,891 INFO L854 garLoopResultBuilder]: At program point L255-2(lines 251 263) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,891 INFO L858 garLoopResultBuilder]: For program point L354-5(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,892 INFO L858 garLoopResultBuilder]: For program point L321-5(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,892 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 16:24:19,892 INFO L854 garLoopResultBuilder]: At program point L190(lines 178 192) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,892 INFO L854 garLoopResultBuilder]: At program point L190-1(lines 178 192) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse25 (= ~d1_ev~0 0)) (.cse20 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0)) (.cse21 (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0)) (.cse22 (= |ULTIMATE.start_is_method1_triggered_#res#1| 0)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse7 (= ~z_ev~0 2)) (.cse8 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse9 (not (= ~b0_ev~0 1))) (.cse24 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|))) (.cse10 (not (= ~comp_m1_i~0 1))) (.cse11 (= ~z_ev~0 ~d1_ev~0)) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse26 (= ~z_req_up~0 1)) (.cse18 (not (= ~d0_val_t~0 0))) (.cse19 (not (= ~b1_val~0 0))) (.cse23 (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 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse26 .cse18 .cse19 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19 .cse23))) [2021-11-22 16:24:19,892 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-11-22 16:24:19,893 INFO L858 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2021-11-22 16:24:19,893 INFO L854 garLoopResultBuilder]: At program point L455(lines 418 460) the Hoare annotation is: (and (not (= ~d1_ev~0 1)) (not (= ~b0_ev~0 0)) (not (= ~d0_ev~0 1)) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0))) [2021-11-22 16:24:19,893 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2021-11-22 16:24:19,893 INFO L858 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2021-11-22 16:24:19,893 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2021-11-22 16:24:19,894 INFO L854 garLoopResultBuilder]: At program point L390-2(lines 383 398) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (= ~comp_m1_st~0 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 1) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_#res#1| 1) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,894 INFO L858 garLoopResultBuilder]: For program point L390-3(lines 390 394) no Hoare annotation was computed. [2021-11-22 16:24:19,894 INFO L854 garLoopResultBuilder]: At program point L390-5(lines 383 398) the Hoare annotation is: (let ((.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (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 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (not (= ~d0_ev~0 1)) .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~b1_ev~0 1)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse19) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_is_method1_triggered_#res#1| 1) .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) .cse19))) [2021-11-22 16:24:19,894 INFO L854 garLoopResultBuilder]: At program point L490(lines 461 492) the Hoare annotation is: (and (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~b1_ev~0 ~z_ev~0) (= ~comp_m1_st~0 0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~z_ev~0 2) (= ~comp_m1_i~0 ~b0_val~0) (= ~z_ev~0 ~d0_ev~0) (= ~z_ev~0 ~d1_ev~0) (= ~b0_val_t~0 1) (= ~d0_req_up~0 1) (= ~b0_val~0 ~d1_val~0) (= ~b0_val~0 0) (= ~d1_val_t~0 ~b0_val_t~0) (= ~z_val~0 0) (= ~d1_req_up~0 1) (= ~b0_ev~0 ~z_ev~0) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0)) [2021-11-22 16:24:19,895 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,895 INFO L854 garLoopResultBuilder]: At program point L160(lines 148 162) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (= ~z_ev~0 ~d0_ev~0) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~b1_ev~0 1)) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,895 INFO L854 garLoopResultBuilder]: At program point L160-1(lines 148 162) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse18 (not (= ~d0_val_t~0 0))) (.cse19 (not (= ~b1_val~0 0))) (.cse20 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~z_req_up~0 1) .cse18 .cse19 .cse20))) [2021-11-22 16:24:19,895 INFO L858 garLoopResultBuilder]: For program point L226-3(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,895 INFO L858 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2021-11-22 16:24:19,896 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 16:24:19,896 INFO L858 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,896 INFO L858 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,896 INFO L858 garLoopResultBuilder]: For program point L359-3(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,896 INFO L858 garLoopResultBuilder]: For program point L326-3(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,896 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2021-11-22 16:24:19,897 INFO L854 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,897 INFO L854 garLoopResultBuilder]: At program point L129-1(lines 106 131) the Hoare annotation is: (let ((.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1)) (.cse20 (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 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~b1_ev~0 1)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~d1_ev~0 1) .cse20))) [2021-11-22 16:24:19,897 INFO L854 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~z_req_up~0 1) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 16:24:19,898 INFO L854 garLoopResultBuilder]: At program point L130(lines 103 132) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_#res#1| 1) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,898 INFO L854 garLoopResultBuilder]: At program point L130-1(lines 103 132) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_is_method1_triggered_#res#1| 1)) (.cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse21 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~d0_val~0 0))) (.cse11 (not (= ~b1_val_t~0 0))) (.cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse13 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse20 (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 .cse17 .cse18 .cse19 (= ~d1_ev~0 1) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 (not (= ~b1_ev~0 1)) .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse20))) [2021-11-22 16:24:19,898 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-11-22 16:24:19,898 INFO L858 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-11-22 16:24:19,898 INFO L858 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-11-22 16:24:19,899 INFO L858 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-11-22 16:24:19,899 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 16:24:19,899 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-22 16:24:19,899 INFO L858 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,899 INFO L858 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,899 INFO L858 garLoopResultBuilder]: For program point L364-3(lines 353 381) no Hoare annotation was computed. [2021-11-22 16:24:19,900 INFO L858 garLoopResultBuilder]: For program point L331-3(lines 320 348) no Hoare annotation was computed. [2021-11-22 16:24:19,900 INFO L854 garLoopResultBuilder]: At program point L100(lines 46 102) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (= ~z_req_up~0 1) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-22 16:24:19,900 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2021-11-22 16:24:19,900 INFO L858 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,900 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2021-11-22 16:24:19,901 INFO L858 garLoopResultBuilder]: For program point L233-3(lines 211 249) no Hoare annotation was computed. [2021-11-22 16:24:19,901 INFO L858 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2021-11-22 16:24:19,901 INFO L858 garLoopResultBuilder]: For program point L167-3(lines 167 172) no Hoare annotation was computed. [2021-11-22 16:24:19,901 INFO L858 garLoopResultBuilder]: For program point L167-5(lines 167 172) no Hoare annotation was computed. [2021-11-22 16:24:19,905 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-22 16:24:19,906 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 16:24:20,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:24:20 BoogieIcfgContainer [2021-11-22 16:24:20,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 16:24:20,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 16:24:20,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 16:24:20,008 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 16:24:20,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:20:03" (3/4) ... [2021-11-22 16:24:20,011 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 16:24:20,028 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-22 16:24:20,029 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-22 16:24:20,030 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 16:24:20,030 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 16:24:20,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) [2021-11-22 16:24:20,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) [2021-11-22 16:24:20,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,059 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,059 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-22 16:24:20,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-22 16:24:20,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((\result == 1 && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-22 16:24:20,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,062 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) [2021-11-22 16:24:20,062 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-22 16:24:20,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) [2021-11-22 16:24:20,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-22 16:24:20,119 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/witness.graphml [2021-11-22 16:24:20,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 16:24:20,120 INFO L158 Benchmark]: Toolchain (without parser) took 258138.62ms. Allocated memory was 96.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 62.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2021-11-22 16:24:20,121 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 79.7MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 16:24:20,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.54ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 71.6MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 16:24:20,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.53ms. Allocated memory is still 96.5MB. Free memory was 71.3MB in the beginning and 69.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 16:24:20,131 INFO L158 Benchmark]: Boogie Preprocessor took 36.65ms. Allocated memory is still 96.5MB. Free memory was 69.1MB in the beginning and 67.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 16:24:20,132 INFO L158 Benchmark]: RCFGBuilder took 680.94ms. Allocated memory is still 96.5MB. Free memory was 67.0MB in the beginning and 49.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-22 16:24:20,132 INFO L158 Benchmark]: TraceAbstraction took 256843.91ms. Allocated memory was 96.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 758.8MB. Max. memory is 16.1GB. [2021-11-22 16:24:20,132 INFO L158 Benchmark]: Witness Printer took 112.09ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 16:24:20,135 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.35ms. Allocated memory is still 79.7MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.54ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 71.6MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.53ms. Allocated memory is still 96.5MB. Free memory was 71.3MB in the beginning and 69.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.65ms. Allocated memory is still 96.5MB. Free memory was 69.1MB in the beginning and 67.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 680.94ms. Allocated memory is still 96.5MB. Free memory was 67.0MB in the beginning and 49.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 256843.91ms. Allocated memory was 96.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 758.8MB. Max. memory is 16.1GB. * Witness Printer took 112.09ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 256.6s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 240.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7212 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7212 mSDsluCounter, 14222 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7983 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 793 IncrementalHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 6239 mSDtfsCounter, 793 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5463occurred in iteration=31, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 12996 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 37 PreInvPairs, 195 NumberOfFragments, 4846 HoareAnnotationTreeSize, 37 FomulaSimplifications, 28304704 FormulaSimplificationTreeSizeReduction, 230.6s HoareSimplificationTime, 37 FomulaSimplificationsInter, 2224938 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3275 NumberOfCodeBlocks, 3275 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3241 ConstructedInterpolants, 0 QuantifiedInterpolants, 6589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 34 InterpolantComputations, 33 PerfectInterpolantSequences, 204/210 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: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((\result == 1 && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d1_val_t == d1_val)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((((!(d1_ev == 1) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(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: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((((((((((((b0_req_up == 1 && 0 == z_val_t) && b1_ev == z_ev) && comp_m1_st == 0) && d0_val_t == b0_val_t) && z_ev == 2) && comp_m1_i == b0_val) && z_ev == d0_ev) && z_ev == d1_ev) && b0_val_t == 1) && d0_req_up == 1) && b0_val == d1_val) && b0_val == 0) && d1_val_t == b0_val_t) && z_val == 0) && d1_req_up == 1) && b0_ev == z_ev) && 1 == b1_req_up) && b1_val_t == b0_val_t - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && z_ev == d0_ev) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d1_val_t == d1_val)) && !(b1_val_t == 0)) && d0_req_up == 1) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && b1_ev == z_ev) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && z_ev == d0_ev) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d1_val_t == d1_val)) && !(b1_val_t == 0)) && d0_req_up == 1) && z_val == 0) && !(d0_val_t == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && 1 == b1_req_up - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) RESULT: Ultimate proved your program to be correct! [2021-11-22 16:24:20,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_460fae3a-c82f-410e-a5e2-9b1d5a0af0c1/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE