./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8 --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 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:38:47,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:38:47,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:38:47,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:38:47,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:38:47,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:38:47,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:38:47,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:38:47,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:38:47,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:38:47,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:38:47,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:38:47,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:38:47,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:38:47,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:38:47,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:38:47,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:38:47,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:38:47,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:38:47,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:38:47,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:38:47,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:38:47,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:38:47,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:38:47,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:38:47,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:38:47,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:38:47,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:38:47,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:38:47,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:38:47,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:38:47,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:38:47,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:38:47,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:38:47,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:38:47,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:38:47,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:38:47,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:38:47,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:38:47,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:38:47,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:38:47,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:38:47,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:38:47,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:38:47,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:38:47,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:38:47,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:38:47,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:38:47,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:38:47,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:38:47,771 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:38:47,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:38:47,772 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:38:47,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:38:47,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:38:47,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:38:47,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:38:47,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:38:47,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:38:47,773 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:38:47,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:38:47,773 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:38:47,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:38:47,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:38:47,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:38:47,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:38:47,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:38:47,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:38:47,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:38:47,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:38:47,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:38:47,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:38:47,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:38:47,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:38:47,775 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:38:47,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:38:47,775 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:38:47,776 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/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_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2022-12-13 17:38:47,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:38:47,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:38:47,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:38:47,986 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:38:47,986 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:38:47,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-12-13 17:38:50,535 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:38:50,661 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:38:50,661 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-12-13 17:38:50,671 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/data/eb027b190/ab1235269825444ab934f84e15c6fbeb/FLAG74664ef1d [2022-12-13 17:38:50,685 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/data/eb027b190/ab1235269825444ab934f84e15c6fbeb [2022-12-13 17:38:50,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:38:50,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:38:50,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:38:50,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:38:50,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:38:50,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:50,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680dbfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50, skipping insertion in model container [2022-12-13 17:38:50,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:50,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:38:50,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:38:50,856 WARN L237 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_b0ada446-4c32-4c6e-a299-a5fbab982a80/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-12-13 17:38:50,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:38:50,926 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:38:50,937 WARN L237 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_b0ada446-4c32-4c6e-a299-a5fbab982a80/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-12-13 17:38:50,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:38:50,984 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:38:50,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50 WrapperNode [2022-12-13 17:38:50,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:38:50,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:38:50,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:38:50,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:38:50,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,027 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 321 [2022-12-13 17:38:51,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:38:51,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:38:51,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:38:51,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:38:51,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:38:51,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:38:51,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:38:51,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:38:51,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (1/1) ... [2022-12-13 17:38:51,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:38:51,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:38:51,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:38:51,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:38:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:38:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 17:38:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 17:38:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 17:38:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 17:38:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 17:38:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 17:38:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 17:38:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 17:38:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 17:38:51,128 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 17:38:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:38:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 17:38:51,128 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 17:38:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:38:51,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:38:51,183 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:38:51,186 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:38:51,471 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:38:51,479 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:38:51,479 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-13 17:38:51,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:38:51 BoogieIcfgContainer [2022-12-13 17:38:51,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:38:51,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:38:51,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:38:51,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:38:51,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:38:50" (1/3) ... [2022-12-13 17:38:51,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb98170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:38:51, skipping insertion in model container [2022-12-13 17:38:51,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:38:50" (2/3) ... [2022-12-13 17:38:51,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb98170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:38:51, skipping insertion in model container [2022-12-13 17:38:51,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:38:51" (3/3) ... [2022-12-13 17:38:51,490 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2022-12-13 17:38:51,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:38:51,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:38:51,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:38:51,559 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5995fcfa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:38:51,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:38:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 131 states have internal predecessors, (205), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 17:38:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:51,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:51,572 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:51,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash 377890557, now seen corresponding path program 1 times [2022-12-13 17:38:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:51,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453599896] [2022-12-13 17:38:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:51,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:51,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:51,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453599896] [2022-12-13 17:38:51,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453599896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:51,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:51,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:38:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169166053] [2022-12-13 17:38:51,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:51,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:38:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:52,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:38:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:38:52,029 INFO L87 Difference]: Start difference. First operand has 153 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 131 states have internal predecessors, (205), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:38:52,877 INFO L93 Difference]: Finished difference Result 516 states and 818 transitions. [2022-12-13 17:38:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:38:52,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:38:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:38:52,892 INFO L225 Difference]: With dead ends: 516 [2022-12-13 17:38:52,892 INFO L226 Difference]: Without dead ends: 366 [2022-12-13 17:38:52,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:38:52,901 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 511 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:38:52,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 551 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:38:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-12-13 17:38:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 284. [2022-12-13 17:38:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 243 states have (on average 1.48559670781893) internal successors, (361), 245 states have internal predecessors, (361), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-12-13 17:38:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 418 transitions. [2022-12-13 17:38:52,971 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 418 transitions. Word has length 79 [2022-12-13 17:38:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:38:52,972 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 418 transitions. [2022-12-13 17:38:52,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 418 transitions. [2022-12-13 17:38:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:52,977 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:52,977 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:52,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:38:52,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash -76002114, now seen corresponding path program 1 times [2022-12-13 17:38:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:52,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44797718] [2022-12-13 17:38:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:53,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:53,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:53,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44797718] [2022-12-13 17:38:53,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44797718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:53,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:53,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:38:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016555983] [2022-12-13 17:38:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:53,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:38:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:38:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:38:53,173 INFO L87 Difference]: Start difference. First operand 284 states and 418 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:38:54,258 INFO L93 Difference]: Finished difference Result 871 states and 1299 transitions. [2022-12-13 17:38:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:38:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:38:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:38:54,263 INFO L225 Difference]: With dead ends: 871 [2022-12-13 17:38:54,263 INFO L226 Difference]: Without dead ends: 598 [2022-12-13 17:38:54,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:38:54,266 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 544 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:38:54,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 937 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:38:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-12-13 17:38:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 413. [2022-12-13 17:38:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 354 states have (on average 1.4774011299435028) internal successors, (523), 357 states have internal predecessors, (523), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 17:38:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 604 transitions. [2022-12-13 17:38:54,317 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 604 transitions. Word has length 79 [2022-12-13 17:38:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:38:54,317 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 604 transitions. [2022-12-13 17:38:54,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 604 transitions. [2022-12-13 17:38:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:54,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:54,319 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:54,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:38:54,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:54,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash -130395012, now seen corresponding path program 1 times [2022-12-13 17:38:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:54,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538024480] [2022-12-13 17:38:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:54,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:54,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538024480] [2022-12-13 17:38:54,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538024480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:54,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:54,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:38:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960994781] [2022-12-13 17:38:54,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:54,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:38:54,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:38:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:38:54,473 INFO L87 Difference]: Start difference. First operand 413 states and 604 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:38:55,363 INFO L93 Difference]: Finished difference Result 1334 states and 1979 transitions. [2022-12-13 17:38:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:38:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:38:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:38:55,371 INFO L225 Difference]: With dead ends: 1334 [2022-12-13 17:38:55,371 INFO L226 Difference]: Without dead ends: 932 [2022-12-13 17:38:55,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:38:55,374 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 539 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:38:55,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 935 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:38:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-12-13 17:38:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 674. [2022-12-13 17:38:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 579 states have (on average 1.471502590673575) internal successors, (852), 584 states have internal predecessors, (852), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-12-13 17:38:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 985 transitions. [2022-12-13 17:38:55,440 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 985 transitions. Word has length 79 [2022-12-13 17:38:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:38:55,440 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 985 transitions. [2022-12-13 17:38:55,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 985 transitions. [2022-12-13 17:38:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:55,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:55,443 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:55,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:38:55,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash -547791618, now seen corresponding path program 1 times [2022-12-13 17:38:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:55,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724225206] [2022-12-13 17:38:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:55,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:55,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:55,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:55,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724225206] [2022-12-13 17:38:55,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724225206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:55,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:55,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:38:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052117650] [2022-12-13 17:38:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:55,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:38:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:38:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:38:55,565 INFO L87 Difference]: Start difference. First operand 674 states and 985 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:38:56,581 INFO L93 Difference]: Finished difference Result 2399 states and 3538 transitions. [2022-12-13 17:38:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 17:38:56,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:38:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:38:56,590 INFO L225 Difference]: With dead ends: 2399 [2022-12-13 17:38:56,591 INFO L226 Difference]: Without dead ends: 1736 [2022-12-13 17:38:56,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:38:56,594 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 561 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:38:56,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 925 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:38:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2022-12-13 17:38:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1183. [2022-12-13 17:38:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1020 states have (on average 1.4725490196078432) internal successors, (1502), 1029 states have internal predecessors, (1502), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2022-12-13 17:38:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1737 transitions. [2022-12-13 17:38:56,687 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1737 transitions. Word has length 79 [2022-12-13 17:38:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:38:56,687 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1737 transitions. [2022-12-13 17:38:56,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1737 transitions. [2022-12-13 17:38:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:56,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:56,690 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:56,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:38:56,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 131480636, now seen corresponding path program 1 times [2022-12-13 17:38:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:56,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386585600] [2022-12-13 17:38:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:56,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:56,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:56,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386585600] [2022-12-13 17:38:56,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386585600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:56,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:56,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:38:56,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109991080] [2022-12-13 17:38:56,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:56,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:38:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:56,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:38:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:38:56,815 INFO L87 Difference]: Start difference. First operand 1183 states and 1737 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:38:57,878 INFO L93 Difference]: Finished difference Result 4210 states and 6212 transitions. [2022-12-13 17:38:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 17:38:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:38:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:38:57,888 INFO L225 Difference]: With dead ends: 4210 [2022-12-13 17:38:57,888 INFO L226 Difference]: Without dead ends: 3038 [2022-12-13 17:38:57,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:38:57,892 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 594 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:38:57,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 925 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:38:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2022-12-13 17:38:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2200. [2022-12-13 17:38:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1905 states have (on average 1.4740157480314962) internal successors, (2808), 1922 states have internal predecessors, (2808), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 17:38:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3257 transitions. [2022-12-13 17:38:58,013 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3257 transitions. Word has length 79 [2022-12-13 17:38:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:38:58,014 INFO L495 AbstractCegarLoop]: Abstraction has 2200 states and 3257 transitions. [2022-12-13 17:38:58,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3257 transitions. [2022-12-13 17:38:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:58,016 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:58,017 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:58,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:38:58,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2093055294, now seen corresponding path program 1 times [2022-12-13 17:38:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:58,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127538705] [2022-12-13 17:38:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:58,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:58,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127538705] [2022-12-13 17:38:58,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127538705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:58,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:58,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:38:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300991404] [2022-12-13 17:38:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:58,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:38:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:38:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:38:58,115 INFO L87 Difference]: Start difference. First operand 2200 states and 3257 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:38:58,647 INFO L93 Difference]: Finished difference Result 4935 states and 7382 transitions. [2022-12-13 17:38:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:38:58,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:38:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:38:58,658 INFO L225 Difference]: With dead ends: 4935 [2022-12-13 17:38:58,658 INFO L226 Difference]: Without dead ends: 2746 [2022-12-13 17:38:58,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:38:58,663 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 436 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:38:58,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 384 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:38:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-12-13 17:38:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2200. [2022-12-13 17:38:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1905 states have (on average 1.4650918635170604) internal successors, (2791), 1922 states have internal predecessors, (2791), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 17:38:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3240 transitions. [2022-12-13 17:38:58,785 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3240 transitions. Word has length 79 [2022-12-13 17:38:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:38:58,785 INFO L495 AbstractCegarLoop]: Abstraction has 2200 states and 3240 transitions. [2022-12-13 17:38:58,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3240 transitions. [2022-12-13 17:38:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:58,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:58,788 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:58,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:38:58,788 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2000088068, now seen corresponding path program 1 times [2022-12-13 17:38:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:58,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799119181] [2022-12-13 17:38:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:58,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:58,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799119181] [2022-12-13 17:38:58,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799119181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:58,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:58,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:38:58,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997638169] [2022-12-13 17:38:58,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:58,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:38:58,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:58,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:38:58,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:38:58,894 INFO L87 Difference]: Start difference. First operand 2200 states and 3240 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:38:59,749 INFO L93 Difference]: Finished difference Result 4844 states and 7190 transitions. [2022-12-13 17:38:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:38:59,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:38:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:38:59,761 INFO L225 Difference]: With dead ends: 4844 [2022-12-13 17:38:59,761 INFO L226 Difference]: Without dead ends: 2656 [2022-12-13 17:38:59,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:38:59,765 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 354 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:38:59,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 644 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:38:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2022-12-13 17:38:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2203. [2022-12-13 17:38:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 1908 states have (on average 1.4559748427672956) internal successors, (2778), 1925 states have internal predecessors, (2778), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 17:38:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3227 transitions. [2022-12-13 17:38:59,879 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3227 transitions. Word has length 79 [2022-12-13 17:38:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:38:59,880 INFO L495 AbstractCegarLoop]: Abstraction has 2203 states and 3227 transitions. [2022-12-13 17:38:59,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:38:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3227 transitions. [2022-12-13 17:38:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:38:59,884 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:38:59,885 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:38:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:38:59,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:38:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:38:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 266293118, now seen corresponding path program 1 times [2022-12-13 17:38:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:38:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741386145] [2022-12-13 17:38:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:38:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:38:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:38:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:38:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:38:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:59,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:38:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:38:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:38:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:38:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:38:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741386145] [2022-12-13 17:38:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741386145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:38:59,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:38:59,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:38:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203915741] [2022-12-13 17:38:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:38:59,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:38:59,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:38:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:38:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:38:59,999 INFO L87 Difference]: Start difference. First operand 2203 states and 3227 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:00,810 INFO L93 Difference]: Finished difference Result 5438 states and 8009 transitions. [2022-12-13 17:39:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:39:00,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:39:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:00,820 INFO L225 Difference]: With dead ends: 5438 [2022-12-13 17:39:00,820 INFO L226 Difference]: Without dead ends: 3247 [2022-12-13 17:39:00,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:39:00,824 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 354 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:00,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 641 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:39:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2022-12-13 17:39:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2254. [2022-12-13 17:39:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 1959 states have (on average 1.444104134762634) internal successors, (2829), 1976 states have internal predecessors, (2829), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 17:39:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3278 transitions. [2022-12-13 17:39:01,042 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3278 transitions. Word has length 79 [2022-12-13 17:39:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:01,043 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 3278 transitions. [2022-12-13 17:39:01,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3278 transitions. [2022-12-13 17:39:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:39:01,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:01,046 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:39:01,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:39:01,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1159779456, now seen corresponding path program 1 times [2022-12-13 17:39:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:01,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444644874] [2022-12-13 17:39:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:01,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:39:01,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:01,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444644874] [2022-12-13 17:39:01,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444644874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:01,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:01,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:39:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319808275] [2022-12-13 17:39:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:01,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:39:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:39:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:01,174 INFO L87 Difference]: Start difference. First operand 2254 states and 3278 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:02,986 INFO L93 Difference]: Finished difference Result 10055 states and 14924 transitions. [2022-12-13 17:39:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:39:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:39:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:03,015 INFO L225 Difference]: With dead ends: 10055 [2022-12-13 17:39:03,015 INFO L226 Difference]: Without dead ends: 7813 [2022-12-13 17:39:03,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:39:03,023 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1408 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:03,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 797 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:39:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2022-12-13 17:39:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 6425. [2022-12-13 17:39:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6425 states, 5567 states have (on average 1.445841566373271) internal successors, (8049), 5634 states have internal predecessors, (8049), 501 states have call successors, (501), 308 states have call predecessors, (501), 356 states have return successors, (835), 498 states have call predecessors, (835), 501 states have call successors, (835) [2022-12-13 17:39:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 9385 transitions. [2022-12-13 17:39:03,553 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 9385 transitions. Word has length 79 [2022-12-13 17:39:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:03,553 INFO L495 AbstractCegarLoop]: Abstraction has 6425 states and 9385 transitions. [2022-12-13 17:39:03,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 9385 transitions. [2022-12-13 17:39:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:39:03,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:03,555 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:39:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:39:03,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1236657535, now seen corresponding path program 1 times [2022-12-13 17:39:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544384052] [2022-12-13 17:39:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:03,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:39:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544384052] [2022-12-13 17:39:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544384052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:03,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:03,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:39:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581330907] [2022-12-13 17:39:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:03,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:39:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:39:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:03,674 INFO L87 Difference]: Start difference. First operand 6425 states and 9385 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:04,994 INFO L93 Difference]: Finished difference Result 14892 states and 22145 transitions. [2022-12-13 17:39:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:39:04,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:39:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:05,027 INFO L225 Difference]: With dead ends: 14892 [2022-12-13 17:39:05,028 INFO L226 Difference]: Without dead ends: 8479 [2022-12-13 17:39:05,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:39:05,048 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 315 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:05,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 641 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:39:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8479 states. [2022-12-13 17:39:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8479 to 6503. [2022-12-13 17:39:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6503 states, 5645 states have (on average 1.4350752878653676) internal successors, (8101), 5712 states have internal predecessors, (8101), 501 states have call successors, (501), 308 states have call predecessors, (501), 356 states have return successors, (835), 498 states have call predecessors, (835), 501 states have call successors, (835) [2022-12-13 17:39:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 9437 transitions. [2022-12-13 17:39:05,718 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 9437 transitions. Word has length 79 [2022-12-13 17:39:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:05,719 INFO L495 AbstractCegarLoop]: Abstraction has 6503 states and 9437 transitions. [2022-12-13 17:39:05,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 9437 transitions. [2022-12-13 17:39:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:39:05,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:05,721 INFO L195 NwaCegarLoop]: 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] [2022-12-13 17:39:05,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:39:05,721 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1212942595, now seen corresponding path program 1 times [2022-12-13 17:39:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:05,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816347128] [2022-12-13 17:39:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:05,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:05,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:05,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:39:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:05,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816347128] [2022-12-13 17:39:05,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816347128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:05,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:05,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:39:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905558192] [2022-12-13 17:39:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:39:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:39:05,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:05,809 INFO L87 Difference]: Start difference. First operand 6503 states and 9437 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:08,383 INFO L93 Difference]: Finished difference Result 21917 states and 32003 transitions. [2022-12-13 17:39:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:39:08,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-12-13 17:39:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:08,433 INFO L225 Difference]: With dead ends: 21917 [2022-12-13 17:39:08,433 INFO L226 Difference]: Without dead ends: 15426 [2022-12-13 17:39:08,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:39:08,455 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 1306 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:08,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 788 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:39:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15426 states. [2022-12-13 17:39:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15426 to 12725. [2022-12-13 17:39:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12725 states, 11005 states have (on average 1.4299863698318946) internal successors, (15737), 11156 states have internal predecessors, (15737), 1007 states have call successors, (1007), 616 states have call predecessors, (1007), 712 states have return successors, (1768), 968 states have call predecessors, (1768), 1007 states have call successors, (1768) [2022-12-13 17:39:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12725 states to 12725 states and 18512 transitions. [2022-12-13 17:39:09,541 INFO L78 Accepts]: Start accepts. Automaton has 12725 states and 18512 transitions. Word has length 79 [2022-12-13 17:39:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:09,541 INFO L495 AbstractCegarLoop]: Abstraction has 12725 states and 18512 transitions. [2022-12-13 17:39:09,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 12725 states and 18512 transitions. [2022-12-13 17:39:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:09,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:09,547 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:09,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:39:09,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash -823536340, now seen corresponding path program 1 times [2022-12-13 17:39:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:09,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603648612] [2022-12-13 17:39:09,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:09,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:39:09,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:09,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603648612] [2022-12-13 17:39:09,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603648612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:09,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:09,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:39:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636050893] [2022-12-13 17:39:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:09,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:39:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:09,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:39:09,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:09,654 INFO L87 Difference]: Start difference. First operand 12725 states and 18512 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:11,720 INFO L93 Difference]: Finished difference Result 28548 states and 42518 transitions. [2022-12-13 17:39:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:39:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2022-12-13 17:39:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:11,754 INFO L225 Difference]: With dead ends: 28548 [2022-12-13 17:39:11,755 INFO L226 Difference]: Without dead ends: 15835 [2022-12-13 17:39:11,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:39:11,773 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 222 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:11,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 636 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:39:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15835 states. [2022-12-13 17:39:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15835 to 12881. [2022-12-13 17:39:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12881 states, 11161 states have (on average 1.4193172654780037) internal successors, (15841), 11312 states have internal predecessors, (15841), 1007 states have call successors, (1007), 616 states have call predecessors, (1007), 712 states have return successors, (1768), 968 states have call predecessors, (1768), 1007 states have call successors, (1768) [2022-12-13 17:39:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12881 states to 12881 states and 18616 transitions. [2022-12-13 17:39:12,909 INFO L78 Accepts]: Start accepts. Automaton has 12881 states and 18616 transitions. Word has length 97 [2022-12-13 17:39:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:12,910 INFO L495 AbstractCegarLoop]: Abstraction has 12881 states and 18616 transitions. [2022-12-13 17:39:12,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12881 states and 18616 transitions. [2022-12-13 17:39:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:12,914 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:12,914 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:39:12,915 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1442844846, now seen corresponding path program 1 times [2022-12-13 17:39:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:12,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563793952] [2022-12-13 17:39:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:13,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:39:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:13,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563793952] [2022-12-13 17:39:13,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563793952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:13,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:13,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:39:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364283976] [2022-12-13 17:39:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:13,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:39:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:13,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:39:13,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:39:13,021 INFO L87 Difference]: Start difference. First operand 12881 states and 18616 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:17,117 INFO L93 Difference]: Finished difference Result 43294 states and 62971 transitions. [2022-12-13 17:39:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:39:17,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2022-12-13 17:39:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:17,187 INFO L225 Difference]: With dead ends: 43294 [2022-12-13 17:39:17,188 INFO L226 Difference]: Without dead ends: 30426 [2022-12-13 17:39:17,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:39:17,213 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 720 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:17,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 724 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:39:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30426 states. [2022-12-13 17:39:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30426 to 24791. [2022-12-13 17:39:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24791 states, 21405 states have (on average 1.4053258584442887) internal successors, (30081), 21788 states have internal predecessors, (30081), 1921 states have call successors, (1921), 1184 states have call predecessors, (1921), 1464 states have return successors, (3566), 1850 states have call predecessors, (3566), 1921 states have call successors, (3566) [2022-12-13 17:39:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24791 states to 24791 states and 35568 transitions. [2022-12-13 17:39:19,560 INFO L78 Accepts]: Start accepts. Automaton has 24791 states and 35568 transitions. Word has length 97 [2022-12-13 17:39:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:19,560 INFO L495 AbstractCegarLoop]: Abstraction has 24791 states and 35568 transitions. [2022-12-13 17:39:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 24791 states and 35568 transitions. [2022-12-13 17:39:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:19,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:19,570 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:19,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:39:19,570 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash -923849748, now seen corresponding path program 1 times [2022-12-13 17:39:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:19,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218653267] [2022-12-13 17:39:19,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:19,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:19,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:39:19,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:19,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218653267] [2022-12-13 17:39:19,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218653267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:19,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:19,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:39:19,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227940511] [2022-12-13 17:39:19,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:19,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:39:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:19,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:39:19,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:39:19,674 INFO L87 Difference]: Start difference. First operand 24791 states and 35568 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:22,275 INFO L93 Difference]: Finished difference Result 30360 states and 43543 transitions. [2022-12-13 17:39:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:39:22,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2022-12-13 17:39:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:22,308 INFO L225 Difference]: With dead ends: 30360 [2022-12-13 17:39:22,309 INFO L226 Difference]: Without dead ends: 17020 [2022-12-13 17:39:22,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:39:22,329 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 735 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:22,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 721 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:39:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17020 states. [2022-12-13 17:39:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17020 to 13265. [2022-12-13 17:39:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13265 states, 11442 states have (on average 1.3800034958923266) internal successors, (15790), 11633 states have internal predecessors, (15790), 1048 states have call successors, (1048), 640 states have call predecessors, (1048), 774 states have return successors, (1724), 1007 states have call predecessors, (1724), 1048 states have call successors, (1724) [2022-12-13 17:39:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13265 states to 13265 states and 18562 transitions. [2022-12-13 17:39:23,785 INFO L78 Accepts]: Start accepts. Automaton has 13265 states and 18562 transitions. Word has length 97 [2022-12-13 17:39:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:23,785 INFO L495 AbstractCegarLoop]: Abstraction has 13265 states and 18562 transitions. [2022-12-13 17:39:23,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13265 states and 18562 transitions. [2022-12-13 17:39:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:23,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:23,792 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:23,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:39:23,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:23,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash -30363410, now seen corresponding path program 1 times [2022-12-13 17:39:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:23,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455345590] [2022-12-13 17:39:23,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:23,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:23,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:39:23,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:23,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455345590] [2022-12-13 17:39:23,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455345590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:23,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:23,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:39:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073022060] [2022-12-13 17:39:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:23,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:39:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:39:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:39:23,919 INFO L87 Difference]: Start difference. First operand 13265 states and 18562 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:25,635 INFO L93 Difference]: Finished difference Result 16782 states and 23535 transitions. [2022-12-13 17:39:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:39:25,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2022-12-13 17:39:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:25,651 INFO L225 Difference]: With dead ends: 16782 [2022-12-13 17:39:25,651 INFO L226 Difference]: Without dead ends: 9172 [2022-12-13 17:39:25,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:39:25,665 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 727 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:25,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 724 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:39:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9172 states. [2022-12-13 17:39:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9172 to 7349. [2022-12-13 17:39:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7349 states, 6338 states have (on average 1.3628905017355633) internal successors, (8638), 6433 states have internal predecessors, (8638), 592 states have call successors, (592), 356 states have call predecessors, (592), 418 states have return successors, (890), 567 states have call predecessors, (890), 592 states have call successors, (890) [2022-12-13 17:39:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7349 states to 7349 states and 10120 transitions. [2022-12-13 17:39:26,334 INFO L78 Accepts]: Start accepts. Automaton has 7349 states and 10120 transitions. Word has length 97 [2022-12-13 17:39:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:26,334 INFO L495 AbstractCegarLoop]: Abstraction has 7349 states and 10120 transitions. [2022-12-13 17:39:26,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7349 states and 10120 transitions. [2022-12-13 17:39:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:26,337 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:26,337 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:26,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:39:26,337 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2079751252, now seen corresponding path program 1 times [2022-12-13 17:39:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:26,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791346474] [2022-12-13 17:39:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:39:26,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:26,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791346474] [2022-12-13 17:39:26,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791346474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:26,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:26,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:39:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244921809] [2022-12-13 17:39:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:26,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:39:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:39:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:39:26,435 INFO L87 Difference]: Start difference. First operand 7349 states and 10120 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:28,407 INFO L93 Difference]: Finished difference Result 14511 states and 19925 transitions. [2022-12-13 17:39:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 17:39:28,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2022-12-13 17:39:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:28,422 INFO L225 Difference]: With dead ends: 14511 [2022-12-13 17:39:28,422 INFO L226 Difference]: Without dead ends: 8997 [2022-12-13 17:39:28,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-12-13 17:39:28,429 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 717 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:28,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 725 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:39:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8997 states. [2022-12-13 17:39:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8997 to 5444. [2022-12-13 17:39:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5444 states, 4731 states have (on average 1.3472838723314309) internal successors, (6374), 4790 states have internal predecessors, (6374), 418 states have call successors, (418), 260 states have call predecessors, (418), 294 states have return successors, (552), 397 states have call predecessors, (552), 418 states have call successors, (552) [2022-12-13 17:39:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 7344 transitions. [2022-12-13 17:39:28,999 INFO L78 Accepts]: Start accepts. Automaton has 5444 states and 7344 transitions. Word has length 97 [2022-12-13 17:39:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:28,999 INFO L495 AbstractCegarLoop]: Abstraction has 5444 states and 7344 transitions. [2022-12-13 17:39:29,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5444 states and 7344 transitions. [2022-12-13 17:39:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:29,001 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:29,001 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:29,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:39:29,001 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:29,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1317822766, now seen corresponding path program 1 times [2022-12-13 17:39:29,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:29,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544932049] [2022-12-13 17:39:29,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:29,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:29,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:39:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:29,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544932049] [2022-12-13 17:39:29,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544932049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:29,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:29,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:39:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857841857] [2022-12-13 17:39:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:29,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:39:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:39:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:39:29,093 INFO L87 Difference]: Start difference. First operand 5444 states and 7344 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:30,800 INFO L93 Difference]: Finished difference Result 11742 states and 15872 transitions. [2022-12-13 17:39:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 17:39:30,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2022-12-13 17:39:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:30,813 INFO L225 Difference]: With dead ends: 11742 [2022-12-13 17:39:30,813 INFO L226 Difference]: Without dead ends: 7441 [2022-12-13 17:39:30,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-12-13 17:39:30,821 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 945 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:30,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 628 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:39:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states. [2022-12-13 17:39:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 5365. [2022-12-13 17:39:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4666 states have (on average 1.342477496785255) internal successors, (6264), 4711 states have internal predecessors, (6264), 418 states have call successors, (418), 260 states have call predecessors, (418), 280 states have return successors, (522), 395 states have call predecessors, (522), 418 states have call successors, (522) [2022-12-13 17:39:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 7204 transitions. [2022-12-13 17:39:31,411 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 7204 transitions. Word has length 97 [2022-12-13 17:39:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:31,412 INFO L495 AbstractCegarLoop]: Abstraction has 5365 states and 7204 transitions. [2022-12-13 17:39:31,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 7204 transitions. [2022-12-13 17:39:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:31,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:31,413 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:31,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 17:39:31,413 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1565969260, now seen corresponding path program 1 times [2022-12-13 17:39:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:31,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574223268] [2022-12-13 17:39:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:39:31,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:31,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574223268] [2022-12-13 17:39:31,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574223268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:31,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:31,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:39:31,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375374267] [2022-12-13 17:39:31,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:31,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:39:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:31,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:39:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:31,490 INFO L87 Difference]: Start difference. First operand 5365 states and 7204 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:33,178 INFO L93 Difference]: Finished difference Result 13848 states and 18568 transitions. [2022-12-13 17:39:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:39:33,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2022-12-13 17:39:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:33,193 INFO L225 Difference]: With dead ends: 13848 [2022-12-13 17:39:33,193 INFO L226 Difference]: Without dead ends: 8498 [2022-12-13 17:39:33,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:39:33,201 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 697 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:33,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 393 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:39:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8498 states. [2022-12-13 17:39:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8498 to 6336. [2022-12-13 17:39:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 5571 states have (on average 1.3055106803087417) internal successors, (7273), 5622 states have internal predecessors, (7273), 434 states have call successors, (434), 298 states have call predecessors, (434), 330 states have return successors, (598), 417 states have call predecessors, (598), 434 states have call successors, (598) [2022-12-13 17:39:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 8305 transitions. [2022-12-13 17:39:33,994 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 8305 transitions. Word has length 97 [2022-12-13 17:39:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:33,994 INFO L495 AbstractCegarLoop]: Abstraction has 6336 states and 8305 transitions. [2022-12-13 17:39:33,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:39:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 8305 transitions. [2022-12-13 17:39:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:39:33,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:33,995 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:39:33,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:39:33,995 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1989615982, now seen corresponding path program 1 times [2022-12-13 17:39:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:33,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248633230] [2022-12-13 17:39:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:39:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:39:34,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:34,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248633230] [2022-12-13 17:39:34,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248633230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:39:34,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083446294] [2022-12-13 17:39:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:34,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:39:34,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:39:34,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:39:34,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:39:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:34,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:39:34,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:39:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:39:34,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:39:34,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083446294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:34,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:39:34,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 17:39:34,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965967065] [2022-12-13 17:39:34,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:34,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:39:34,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:34,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:39:34,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:34,171 INFO L87 Difference]: Start difference. First operand 6336 states and 8305 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:39:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:35,624 INFO L93 Difference]: Finished difference Result 17959 states and 23682 transitions. [2022-12-13 17:39:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:39:35,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 97 [2022-12-13 17:39:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:35,643 INFO L225 Difference]: With dead ends: 17959 [2022-12-13 17:39:35,644 INFO L226 Difference]: Without dead ends: 11638 [2022-12-13 17:39:35,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:35,653 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 174 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:35,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 594 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:39:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11638 states. [2022-12-13 17:39:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11638 to 11638. [2022-12-13 17:39:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11638 states, 10216 states have (on average 1.293265465935787) internal successors, (13212), 10309 states have internal predecessors, (13212), 806 states have call successors, (806), 554 states have call predecessors, (806), 615 states have return successors, (1185), 778 states have call predecessors, (1185), 806 states have call successors, (1185) [2022-12-13 17:39:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11638 states to 11638 states and 15203 transitions. [2022-12-13 17:39:37,122 INFO L78 Accepts]: Start accepts. Automaton has 11638 states and 15203 transitions. Word has length 97 [2022-12-13 17:39:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:37,122 INFO L495 AbstractCegarLoop]: Abstraction has 11638 states and 15203 transitions. [2022-12-13 17:39:37,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:39:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 11638 states and 15203 transitions. [2022-12-13 17:39:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 17:39:37,125 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:37,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:39:37,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:39:37,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:39:37,327 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -487614150, now seen corresponding path program 1 times [2022-12-13 17:39:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084999279] [2022-12-13 17:39:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 17:39:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:39:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:39:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:37,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084999279] [2022-12-13 17:39:37,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084999279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:37,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:37,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:39:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941234025] [2022-12-13 17:39:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:37,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:39:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:39:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:37,501 INFO L87 Difference]: Start difference. First operand 11638 states and 15203 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:39:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:42,527 INFO L93 Difference]: Finished difference Result 40822 states and 53504 transitions. [2022-12-13 17:39:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:39:42,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 117 [2022-12-13 17:39:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:42,578 INFO L225 Difference]: With dead ends: 40822 [2022-12-13 17:39:42,578 INFO L226 Difference]: Without dead ends: 29205 [2022-12-13 17:39:42,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:39:42,593 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 775 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:42,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 567 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:39:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29205 states. [2022-12-13 17:39:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29205 to 25930. [2022-12-13 17:39:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25930 states, 22816 states have (on average 1.267093267882188) internal successors, (28910), 23200 states have internal predecessors, (28910), 1541 states have call successors, (1541), 1086 states have call predecessors, (1541), 1572 states have return successors, (3248), 1651 states have call predecessors, (3248), 1541 states have call successors, (3248) [2022-12-13 17:39:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25930 states to 25930 states and 33699 transitions. [2022-12-13 17:39:46,785 INFO L78 Accepts]: Start accepts. Automaton has 25930 states and 33699 transitions. Word has length 117 [2022-12-13 17:39:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:46,785 INFO L495 AbstractCegarLoop]: Abstraction has 25930 states and 33699 transitions. [2022-12-13 17:39:46,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:39:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 25930 states and 33699 transitions. [2022-12-13 17:39:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 17:39:46,790 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:46,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:39:46,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 17:39:46,791 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:46,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1526198724, now seen corresponding path program 1 times [2022-12-13 17:39:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:46,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817578005] [2022-12-13 17:39:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 17:39:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:39:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:39:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:46,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817578005] [2022-12-13 17:39:46,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817578005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:46,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:46,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:39:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318257066] [2022-12-13 17:39:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:46,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:39:46,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:46,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:39:46,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:39:46,848 INFO L87 Difference]: Start difference. First operand 25930 states and 33699 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:39:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:39:52,398 INFO L93 Difference]: Finished difference Result 57023 states and 74012 transitions. [2022-12-13 17:39:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:39:52,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 117 [2022-12-13 17:39:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:39:52,459 INFO L225 Difference]: With dead ends: 57023 [2022-12-13 17:39:52,459 INFO L226 Difference]: Without dead ends: 31110 [2022-12-13 17:39:52,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:39:52,493 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 437 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:39:52,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 281 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:39:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31110 states. [2022-12-13 17:39:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31110 to 25916. [2022-12-13 17:39:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25916 states, 22812 states have (on average 1.267008591969139) internal successors, (28903), 23194 states have internal predecessors, (28903), 1531 states have call successors, (1531), 1086 states have call predecessors, (1531), 1572 states have return successors, (3232), 1639 states have call predecessors, (3232), 1531 states have call successors, (3232) [2022-12-13 17:39:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25916 states to 25916 states and 33666 transitions. [2022-12-13 17:39:56,654 INFO L78 Accepts]: Start accepts. Automaton has 25916 states and 33666 transitions. Word has length 117 [2022-12-13 17:39:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:39:56,654 INFO L495 AbstractCegarLoop]: Abstraction has 25916 states and 33666 transitions. [2022-12-13 17:39:56,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:39:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25916 states and 33666 transitions. [2022-12-13 17:39:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 17:39:56,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:39:56,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:39:56,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 17:39:56,659 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:39:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:39:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1564913749, now seen corresponding path program 1 times [2022-12-13 17:39:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:39:56,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729068325] [2022-12-13 17:39:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:39:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:39:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:39:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:39:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:39:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:39:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:39:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 17:39:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:39:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:39:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:39:56,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:39:56,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729068325] [2022-12-13 17:39:56,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729068325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:39:56,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:39:56,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:39:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78933113] [2022-12-13 17:39:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:39:56,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:39:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:39:56,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:39:56,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:39:56,782 INFO L87 Difference]: Start difference. First operand 25916 states and 33666 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:40:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:05,873 INFO L93 Difference]: Finished difference Result 81211 states and 105672 transitions. [2022-12-13 17:40:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:40:05,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 118 [2022-12-13 17:40:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:05,990 INFO L225 Difference]: With dead ends: 81211 [2022-12-13 17:40:05,991 INFO L226 Difference]: Without dead ends: 55316 [2022-12-13 17:40:06,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:40:06,029 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 745 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:06,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 606 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:40:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55316 states. [2022-12-13 17:40:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55316 to 46265. [2022-12-13 17:40:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46265 states, 40435 states have (on average 1.25937925064919) internal successors, (50923), 41211 states have internal predecessors, (50923), 2885 states have call successors, (2885), 1996 states have call predecessors, (2885), 2944 states have return successors, (6455), 3065 states have call predecessors, (6455), 2885 states have call successors, (6455) [2022-12-13 17:40:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46265 states to 46265 states and 60263 transitions. [2022-12-13 17:40:13,413 INFO L78 Accepts]: Start accepts. Automaton has 46265 states and 60263 transitions. Word has length 118 [2022-12-13 17:40:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:13,413 INFO L495 AbstractCegarLoop]: Abstraction has 46265 states and 60263 transitions. [2022-12-13 17:40:13,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:40:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 46265 states and 60263 transitions. [2022-12-13 17:40:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 17:40:13,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:13,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:13,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 17:40:13,422 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash 526329175, now seen corresponding path program 1 times [2022-12-13 17:40:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:13,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883931945] [2022-12-13 17:40:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:40:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:40:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:40:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:40:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 17:40:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:40:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:40:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883931945] [2022-12-13 17:40:13,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883931945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:40:13,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:40:13,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:40:13,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583957472] [2022-12-13 17:40:13,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:40:13,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:40:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:40:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:40:13,475 INFO L87 Difference]: Start difference. First operand 46265 states and 60263 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:40:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:21,585 INFO L93 Difference]: Finished difference Result 95055 states and 123901 transitions. [2022-12-13 17:40:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:40:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 118 [2022-12-13 17:40:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:21,686 INFO L225 Difference]: With dead ends: 95055 [2022-12-13 17:40:21,686 INFO L226 Difference]: Without dead ends: 48811 [2022-12-13 17:40:21,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:40:21,744 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 435 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:21,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 279 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:40:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48811 states. [2022-12-13 17:40:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48811 to 41260. [2022-12-13 17:40:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41260 states, 36100 states have (on average 1.2642105263157895) internal successors, (45638), 36790 states have internal predecessors, (45638), 2527 states have call successors, (2527), 1750 states have call predecessors, (2527), 2632 states have return successors, (5888), 2723 states have call predecessors, (5888), 2527 states have call successors, (5888) [2022-12-13 17:40:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41260 states to 41260 states and 54053 transitions. [2022-12-13 17:40:29,237 INFO L78 Accepts]: Start accepts. Automaton has 41260 states and 54053 transitions. Word has length 118 [2022-12-13 17:40:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:29,237 INFO L495 AbstractCegarLoop]: Abstraction has 41260 states and 54053 transitions. [2022-12-13 17:40:29,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:40:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 41260 states and 54053 transitions. [2022-12-13 17:40:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 17:40:29,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:29,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:29,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 17:40:29,244 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1752203030, now seen corresponding path program 1 times [2022-12-13 17:40:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:29,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899372470] [2022-12-13 17:40:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:40:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:40:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:40:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:40:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 17:40:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:40:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:40:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899372470] [2022-12-13 17:40:29,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899372470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:40:29,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:40:29,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:40:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816391130] [2022-12-13 17:40:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:40:29,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:40:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:29,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:40:29,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:40:29,303 INFO L87 Difference]: Start difference. First operand 41260 states and 54053 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:40:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:41,713 INFO L93 Difference]: Finished difference Result 102970 states and 138769 transitions. [2022-12-13 17:40:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:40:41,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 119 [2022-12-13 17:40:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:41,833 INFO L225 Difference]: With dead ends: 102970 [2022-12-13 17:40:41,833 INFO L226 Difference]: Without dead ends: 54357 [2022-12-13 17:40:41,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:40:41,897 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 584 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:41,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 383 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:40:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54357 states. [2022-12-13 17:40:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54357 to 45558. [2022-12-13 17:40:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45558 states, 39809 states have (on average 1.2712200758622423) internal successors, (50606), 40534 states have internal predecessors, (50606), 2842 states have call successors, (2842), 1944 states have call predecessors, (2842), 2906 states have return successors, (6856), 3081 states have call predecessors, (6856), 2842 states have call successors, (6856) [2022-12-13 17:40:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45558 states to 45558 states and 60304 transitions. [2022-12-13 17:40:49,021 INFO L78 Accepts]: Start accepts. Automaton has 45558 states and 60304 transitions. Word has length 119 [2022-12-13 17:40:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:49,022 INFO L495 AbstractCegarLoop]: Abstraction has 45558 states and 60304 transitions. [2022-12-13 17:40:49,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:40:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 45558 states and 60304 transitions. [2022-12-13 17:40:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-13 17:40:49,032 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:49,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:40:49,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 17:40:49,032 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:49,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 201964135, now seen corresponding path program 1 times [2022-12-13 17:40:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:49,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461827620] [2022-12-13 17:40:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:40:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:40:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:40:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:40:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 17:40:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 17:40:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:40:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 17:40:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461827620] [2022-12-13 17:40:49,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461827620] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:40:49,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296357086] [2022-12-13 17:40:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:40:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:40:49,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:40:49,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:40:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:49,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:40:49,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:40:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:40:49,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:40:49,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296357086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:40:49,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:40:49,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 17:40:49,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976804172] [2022-12-13 17:40:49,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:40:49,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:40:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:40:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:40:49,208 INFO L87 Difference]: Start difference. First operand 45558 states and 60304 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:40:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:56,403 INFO L93 Difference]: Finished difference Result 88678 states and 117157 transitions. [2022-12-13 17:40:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:40:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 142 [2022-12-13 17:40:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:56,507 INFO L225 Difference]: With dead ends: 88678 [2022-12-13 17:40:56,507 INFO L226 Difference]: Without dead ends: 46545 [2022-12-13 17:40:56,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:40:56,570 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 157 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 577 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 [2022-12-13 17:40:56,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 577 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:40:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46545 states. [2022-12-13 17:41:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46545 to 37428. [2022-12-13 17:41:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37428 states, 32875 states have (on average 1.2608973384030417) internal successors, (41452), 33478 states have internal predecessors, (41452), 2158 states have call successors, (2158), 1512 states have call predecessors, (2158), 2394 states have return successors, (4595), 2439 states have call predecessors, (4595), 2158 states have call successors, (4595) [2022-12-13 17:41:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37428 states to 37428 states and 48205 transitions. [2022-12-13 17:41:03,054 INFO L78 Accepts]: Start accepts. Automaton has 37428 states and 48205 transitions. Word has length 142 [2022-12-13 17:41:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:03,055 INFO L495 AbstractCegarLoop]: Abstraction has 37428 states and 48205 transitions. [2022-12-13 17:41:03,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:41:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37428 states and 48205 transitions. [2022-12-13 17:41:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-13 17:41:03,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:03,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:41:03,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:41:03,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 17:41:03,279 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:03,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:03,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2134888564, now seen corresponding path program 1 times [2022-12-13 17:41:03,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:03,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205867170] [2022-12-13 17:41:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:41:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:41:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:41:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:41:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:41:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 17:41:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:41:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 17:41:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 17:41:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:41:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 17:41:03,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205867170] [2022-12-13 17:41:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205867170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:03,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:03,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:41:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245902305] [2022-12-13 17:41:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:03,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:41:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:41:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:03,371 INFO L87 Difference]: Start difference. First operand 37428 states and 48205 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:41:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:16,334 INFO L93 Difference]: Finished difference Result 104404 states and 135301 transitions. [2022-12-13 17:41:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:41:16,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 176 [2022-12-13 17:41:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:16,482 INFO L225 Difference]: With dead ends: 104404 [2022-12-13 17:41:16,483 INFO L226 Difference]: Without dead ends: 66927 [2022-12-13 17:41:16,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:41:16,538 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 1733 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:16,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 826 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:41:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66927 states. [2022-12-13 17:41:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66927 to 56587. [2022-12-13 17:41:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56587 states, 49753 states have (on average 1.248145840451832) internal successors, (62099), 50639 states have internal predecessors, (62099), 3263 states have call successors, (3263), 2292 states have call predecessors, (3263), 3570 states have return successors, (6709), 3659 states have call predecessors, (6709), 3263 states have call successors, (6709) [2022-12-13 17:41:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56587 states to 56587 states and 72071 transitions. [2022-12-13 17:41:26,792 INFO L78 Accepts]: Start accepts. Automaton has 56587 states and 72071 transitions. Word has length 176 [2022-12-13 17:41:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:26,792 INFO L495 AbstractCegarLoop]: Abstraction has 56587 states and 72071 transitions. [2022-12-13 17:41:26,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:41:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 56587 states and 72071 transitions. [2022-12-13 17:41:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-13 17:41:26,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:26,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:41:26,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 17:41:26,818 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1848086432, now seen corresponding path program 1 times [2022-12-13 17:41:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:26,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579573064] [2022-12-13 17:41:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:41:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:41:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:41:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:41:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:41:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 17:41:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:41:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:41:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 17:41:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:41:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 17:41:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579573064] [2022-12-13 17:41:26,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579573064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:41:26,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595219146] [2022-12-13 17:41:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:26,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:26,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:26,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:26,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:41:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:26,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:41:26,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 17:41:27,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:41:27,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595219146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:27,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:41:27,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-12-13 17:41:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127444286] [2022-12-13 17:41:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:27,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:41:27,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:27,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:41:27,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:27,031 INFO L87 Difference]: Start difference. First operand 56587 states and 72071 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:41:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:37,803 INFO L93 Difference]: Finished difference Result 95960 states and 123798 transitions. [2022-12-13 17:41:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:41:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 177 [2022-12-13 17:41:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:37,936 INFO L225 Difference]: With dead ends: 95960 [2022-12-13 17:41:37,937 INFO L226 Difference]: Without dead ends: 64225 [2022-12-13 17:41:37,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:37,984 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 92 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:37,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 442 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64225 states. [2022-12-13 17:41:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64225 to 63901. [2022-12-13 17:41:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63901 states, 56121 states have (on average 1.2497460843534505) internal successors, (70137), 57059 states have internal predecessors, (70137), 3787 states have call successors, (3787), 2640 states have call predecessors, (3787), 3992 states have return successors, (7549), 4205 states have call predecessors, (7549), 3787 states have call successors, (7549) [2022-12-13 17:41:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63901 states to 63901 states and 81473 transitions. [2022-12-13 17:41:49,065 INFO L78 Accepts]: Start accepts. Automaton has 63901 states and 81473 transitions. Word has length 177 [2022-12-13 17:41:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:49,066 INFO L495 AbstractCegarLoop]: Abstraction has 63901 states and 81473 transitions. [2022-12-13 17:41:49,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:41:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 63901 states and 81473 transitions. [2022-12-13 17:41:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-12-13 17:41:49,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:49,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:41:49,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:41:49,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 17:41:49,294 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:49,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1189040602, now seen corresponding path program 1 times [2022-12-13 17:41:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:49,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561088673] [2022-12-13 17:41:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:41:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:41:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:41:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:41:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:41:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 17:41:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 17:41:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:41:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 17:41:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:41:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 17:41:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:49,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561088673] [2022-12-13 17:41:49,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561088673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:49,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:49,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:41:49,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413096064] [2022-12-13 17:41:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:49,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:49,390 INFO L87 Difference]: Start difference. First operand 63901 states and 81473 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:42:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:06,819 INFO L93 Difference]: Finished difference Result 161443 states and 206348 transitions. [2022-12-13 17:42:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:42:06,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 181 [2022-12-13 17:42:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:07,028 INFO L225 Difference]: With dead ends: 161443 [2022-12-13 17:42:07,028 INFO L226 Difference]: Without dead ends: 97370 [2022-12-13 17:42:07,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:42:07,121 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 536 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:07,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 385 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:42:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97370 states. [2022-12-13 17:42:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97370 to 82255. [2022-12-13 17:42:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82255 states, 72143 states have (on average 1.2470787186560026) internal successors, (89968), 73260 states have internal predecessors, (89968), 5019 states have call successors, (5019), 3512 states have call predecessors, (5019), 5092 states have return successors, (9346), 5486 states have call predecessors, (9346), 5019 states have call successors, (9346) [2022-12-13 17:42:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82255 states to 82255 states and 104333 transitions. [2022-12-13 17:42:21,457 INFO L78 Accepts]: Start accepts. Automaton has 82255 states and 104333 transitions. Word has length 181 [2022-12-13 17:42:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:21,457 INFO L495 AbstractCegarLoop]: Abstraction has 82255 states and 104333 transitions. [2022-12-13 17:42:21,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:42:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 82255 states and 104333 transitions. [2022-12-13 17:42:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-12-13 17:42:21,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:21,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:42:21,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 17:42:21,484 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:42:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1274685974, now seen corresponding path program 1 times [2022-12-13 17:42:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:21,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458510389] [2022-12-13 17:42:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:42:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:42:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:42:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:42:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 17:42:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 17:42:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:42:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 17:42:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:42:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 17:42:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458510389] [2022-12-13 17:42:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458510389] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687298370] [2022-12-13 17:42:21,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:21,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:21,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:21,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:21,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:42:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:42:21,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 17:42:21,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:42:21,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687298370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:21,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:42:21,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2022-12-13 17:42:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399687705] [2022-12-13 17:42:21,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:21,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:42:21,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:21,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:42:21,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:42:21,750 INFO L87 Difference]: Start difference. First operand 82255 states and 104333 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 17:42:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:36,176 INFO L93 Difference]: Finished difference Result 161436 states and 209481 transitions. [2022-12-13 17:42:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:42:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 181 [2022-12-13 17:42:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:36,368 INFO L225 Difference]: With dead ends: 161436 [2022-12-13 17:42:36,368 INFO L226 Difference]: Without dead ends: 84493 [2022-12-13 17:42:36,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:42:36,480 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 154 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:36,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 275 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:42:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84493 states. [2022-12-13 17:42:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84493 to 84081. [2022-12-13 17:42:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84081 states, 74151 states have (on average 1.2356003290582729) internal successors, (91621), 75244 states have internal predecessors, (91621), 4923 states have call successors, (4923), 3626 states have call predecessors, (4923), 5006 states have return successors, (9779), 5214 states have call predecessors, (9779), 4923 states have call successors, (9779) [2022-12-13 17:42:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84081 states to 84081 states and 106323 transitions. [2022-12-13 17:42:51,161 INFO L78 Accepts]: Start accepts. Automaton has 84081 states and 106323 transitions. Word has length 181 [2022-12-13 17:42:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:51,162 INFO L495 AbstractCegarLoop]: Abstraction has 84081 states and 106323 transitions. [2022-12-13 17:42:51,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 17:42:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 84081 states and 106323 transitions. [2022-12-13 17:42:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 17:42:51,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:51,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:42:51,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 17:42:51,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 17:42:51,388 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:42:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1628249200, now seen corresponding path program 1 times [2022-12-13 17:42:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:51,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665497418] [2022-12-13 17:42:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:42:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:42:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:42:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:42:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:42:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:42:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:42:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 17:42:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:42:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 17:42:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:51,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665497418] [2022-12-13 17:42:51,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665497418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:51,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:51,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:42:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872879833] [2022-12-13 17:42:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:51,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:42:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:42:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:42:51,484 INFO L87 Difference]: Start difference. First operand 84081 states and 106323 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:43:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:10,261 INFO L93 Difference]: Finished difference Result 166874 states and 212045 transitions. [2022-12-13 17:43:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:43:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 185 [2022-12-13 17:43:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:10,483 INFO L225 Difference]: With dead ends: 166874 [2022-12-13 17:43:10,483 INFO L226 Difference]: Without dead ends: 99896 [2022-12-13 17:43:10,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:43:10,574 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 948 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:10,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 708 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:43:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99896 states. [2022-12-13 17:43:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99896 to 84187. [2022-12-13 17:43:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84187 states, 74220 states have (on average 1.2315009431420103) internal successors, (91402), 75345 states have internal predecessors, (91402), 4923 states have call successors, (4923), 3626 states have call predecessors, (4923), 5043 states have return successors, (9480), 5219 states have call predecessors, (9480), 4923 states have call successors, (9480) [2022-12-13 17:43:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84187 states to 84187 states and 105805 transitions. [2022-12-13 17:43:25,518 INFO L78 Accepts]: Start accepts. Automaton has 84187 states and 105805 transitions. Word has length 185 [2022-12-13 17:43:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:25,518 INFO L495 AbstractCegarLoop]: Abstraction has 84187 states and 105805 transitions. [2022-12-13 17:43:25,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:43:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 84187 states and 105805 transitions. [2022-12-13 17:43:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-12-13 17:43:25,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:25,542 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:25,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 17:43:25,542 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:43:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash 417238553, now seen corresponding path program 1 times [2022-12-13 17:43:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:25,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998484814] [2022-12-13 17:43:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:43:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:43:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:43:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:43:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:43:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:43:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:43:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 17:43:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:43:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-12-13 17:43:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:43:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 33 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 17:43:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998484814] [2022-12-13 17:43:25,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998484814] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:43:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086809776] [2022-12-13 17:43:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:25,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:43:25,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:25,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:43:25,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:43:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:43:25,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 17:43:25,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:43:25,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086809776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:25,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:43:25,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 17:43:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875324958] [2022-12-13 17:43:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:25,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:43:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:43:25,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:25,743 INFO L87 Difference]: Start difference. First operand 84187 states and 105805 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 17:43:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:39,244 INFO L93 Difference]: Finished difference Result 142974 states and 183719 transitions. [2022-12-13 17:43:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:43:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 222 [2022-12-13 17:43:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:39,419 INFO L225 Difference]: With dead ends: 142974 [2022-12-13 17:43:39,420 INFO L226 Difference]: Without dead ends: 81615 [2022-12-13 17:43:39,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:39,513 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 152 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:39,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 555 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:43:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81615 states. [2022-12-13 17:43:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81615 to 80675. [2022-12-13 17:43:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80675 states, 70884 states have (on average 1.2195417865808926) internal successors, (86446), 71921 states have internal predecessors, (86446), 4923 states have call successors, (4923), 3626 states have call predecessors, (4923), 4867 states have return successors, (9260), 5131 states have call predecessors, (9260), 4923 states have call successors, (9260) [2022-12-13 17:43:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80675 states to 80675 states and 100629 transitions. [2022-12-13 17:43:53,216 INFO L78 Accepts]: Start accepts. Automaton has 80675 states and 100629 transitions. Word has length 222 [2022-12-13 17:43:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:53,217 INFO L495 AbstractCegarLoop]: Abstraction has 80675 states and 100629 transitions. [2022-12-13 17:43:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 17:43:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80675 states and 100629 transitions. [2022-12-13 17:43:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-13 17:43:53,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:53,243 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:53,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 17:43:53,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 17:43:53,445 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:43:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1059063945, now seen corresponding path program 1 times [2022-12-13 17:43:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:53,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971374992] [2022-12-13 17:43:53,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:43:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:43:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:43:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:43:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:43:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:43:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:43:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 17:43:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:43:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-12-13 17:43:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:43:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-12-13 17:43:53,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:53,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971374992] [2022-12-13 17:43:53,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971374992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:43:53,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138711227] [2022-12-13 17:43:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:53,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:43:53,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:53,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:43:53,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:43:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:53,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:43:53,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 17:43:53,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:43:53,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138711227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:53,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:43:53,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 17:43:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993178150] [2022-12-13 17:43:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:53,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:43:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:43:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:53,686 INFO L87 Difference]: Start difference. First operand 80675 states and 100629 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 17:44:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:07,156 INFO L93 Difference]: Finished difference Result 126807 states and 161559 transitions. [2022-12-13 17:44:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:44:07,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 224 [2022-12-13 17:44:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:07,351 INFO L225 Difference]: With dead ends: 126807 [2022-12-13 17:44:07,351 INFO L226 Difference]: Without dead ends: 80599 [2022-12-13 17:44:07,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:44:07,421 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 150 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:07,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 579 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:44:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80599 states. [2022-12-13 17:44:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80599 to 80441. [2022-12-13 17:44:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80441 states, 70650 states have (on average 1.20482661004954) internal successors, (85121), 71687 states have internal predecessors, (85121), 4923 states have call successors, (4923), 3626 states have call predecessors, (4923), 4867 states have return successors, (9260), 5131 states have call predecessors, (9260), 4923 states have call successors, (9260) [2022-12-13 17:44:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80441 states to 80441 states and 99304 transitions. [2022-12-13 17:44:20,924 INFO L78 Accepts]: Start accepts. Automaton has 80441 states and 99304 transitions. Word has length 224 [2022-12-13 17:44:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:44:20,925 INFO L495 AbstractCegarLoop]: Abstraction has 80441 states and 99304 transitions. [2022-12-13 17:44:20,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 17:44:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 80441 states and 99304 transitions. [2022-12-13 17:44:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-13 17:44:20,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:44:20,952 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:44:20,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 17:44:21,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 17:44:21,154 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:44:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash -529385757, now seen corresponding path program 1 times [2022-12-13 17:44:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:21,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316257031] [2022-12-13 17:44:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:44:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:44:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:44:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:44:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:44:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:44:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:44:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 17:44:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 17:44:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 64 proven. 26 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-12-13 17:44:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:44:21,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316257031] [2022-12-13 17:44:21,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316257031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:44:21,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659603710] [2022-12-13 17:44:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:21,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:44:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:21,258 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:44:21,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 17:44:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:21,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:44:21,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-13 17:44:21,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:44:21,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659603710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:44:21,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:44:21,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 17:44:21,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173002868] [2022-12-13 17:44:21,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:44:21,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:44:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:44:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:44:21,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:44:21,345 INFO L87 Difference]: Start difference. First operand 80441 states and 99304 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 17:44:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:31,740 INFO L93 Difference]: Finished difference Result 110451 states and 137832 transitions. [2022-12-13 17:44:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:44:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 226 [2022-12-13 17:44:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:31,867 INFO L225 Difference]: With dead ends: 110451 [2022-12-13 17:44:31,867 INFO L226 Difference]: Without dead ends: 64896 [2022-12-13 17:44:31,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:44:31,933 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 173 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:31,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 560 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:44:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64896 states. [2022-12-13 17:44:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64896 to 64795. [2022-12-13 17:44:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64795 states, 57052 states have (on average 1.1953305756152282) internal successors, (68196), 57885 states have internal predecessors, (68196), 3851 states have call successors, (3851), 2864 states have call predecessors, (3851), 3891 states have return successors, (6428), 4049 states have call predecessors, (6428), 3851 states have call successors, (6428) [2022-12-13 17:44:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64795 states to 64795 states and 78475 transitions. [2022-12-13 17:44:42,517 INFO L78 Accepts]: Start accepts. Automaton has 64795 states and 78475 transitions. Word has length 226 [2022-12-13 17:44:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:44:42,518 INFO L495 AbstractCegarLoop]: Abstraction has 64795 states and 78475 transitions. [2022-12-13 17:44:42,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 17:44:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 64795 states and 78475 transitions. [2022-12-13 17:44:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-13 17:44:42,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:44:42,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:44:42,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 17:44:42,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 17:44:42,741 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:44:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2060416461, now seen corresponding path program 1 times [2022-12-13 17:44:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:42,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030128375] [2022-12-13 17:44:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:44:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:44:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:44:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:44:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:44:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:44:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:44:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 17:44:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 17:44:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 55 proven. 60 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-13 17:44:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:44:42,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030128375] [2022-12-13 17:44:42,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030128375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:44:42,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410966378] [2022-12-13 17:44:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:42,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:44:42,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:42,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:44:42,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 17:44:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:42,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:44:42,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 17:44:42,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:44:42,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410966378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:44:42,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:44:42,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 17:44:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988817404] [2022-12-13 17:44:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:44:42,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:44:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:44:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:44:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:44:42,965 INFO L87 Difference]: Start difference. First operand 64795 states and 78475 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 17:44:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:53,531 INFO L93 Difference]: Finished difference Result 116360 states and 142623 transitions. [2022-12-13 17:44:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:44:53,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 228 [2022-12-13 17:44:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:53,658 INFO L225 Difference]: With dead ends: 116360 [2022-12-13 17:44:53,658 INFO L226 Difference]: Without dead ends: 64928 [2022-12-13 17:44:53,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:44:53,721 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 116 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:53,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 509 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:44:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64928 states. [2022-12-13 17:45:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64928 to 64747. [2022-12-13 17:45:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64747 states, 57004 states have (on average 1.1790225247351063) internal successors, (67209), 57837 states have internal predecessors, (67209), 3851 states have call successors, (3851), 2864 states have call predecessors, (3851), 3891 states have return successors, (6428), 4049 states have call predecessors, (6428), 3851 states have call successors, (6428) [2022-12-13 17:45:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64747 states to 64747 states and 77488 transitions. [2022-12-13 17:45:04,366 INFO L78 Accepts]: Start accepts. Automaton has 64747 states and 77488 transitions. Word has length 228 [2022-12-13 17:45:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:45:04,366 INFO L495 AbstractCegarLoop]: Abstraction has 64747 states and 77488 transitions. [2022-12-13 17:45:04,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 17:45:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 64747 states and 77488 transitions. [2022-12-13 17:45:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-13 17:45:04,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:45:04,388 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:45:04,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 17:45:04,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:45:04,591 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:45:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:45:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 185687443, now seen corresponding path program 2 times [2022-12-13 17:45:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:45:04,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164899014] [2022-12-13 17:45:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:45:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:45:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:45:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:45:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:45:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:45:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:45:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:45:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:45:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:45:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 17:45:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:45:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 17:45:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:45:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:45:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 19 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-12-13 17:45:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:45:04,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164899014] [2022-12-13 17:45:04,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164899014] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:45:04,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809833026] [2022-12-13 17:45:04,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:45:04,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:45:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:45:04,706 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:45:04,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 17:45:04,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:45:04,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:45:04,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:45:04,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:45:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-13 17:45:04,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:45:04,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809833026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:45:04,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:45:04,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 17:45:04,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365547335] [2022-12-13 17:45:04,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:45:04,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:45:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:45:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:45:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:45:04,864 INFO L87 Difference]: Start difference. First operand 64747 states and 77488 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 17:45:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:45:10,679 INFO L93 Difference]: Finished difference Result 100758 states and 123600 transitions. [2022-12-13 17:45:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:45:10,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 228 [2022-12-13 17:45:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:45:10,754 INFO L225 Difference]: With dead ends: 100758 [2022-12-13 17:45:10,754 INFO L226 Difference]: Without dead ends: 37799 [2022-12-13 17:45:10,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:45:10,824 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 150 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:45:10,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 246 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:45:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37799 states. [2022-12-13 17:45:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37799 to 37796. [2022-12-13 17:45:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37796 states, 33268 states have (on average 1.1631297342791873) internal successors, (38695), 33535 states have internal predecessors, (38695), 2375 states have call successors, (2375), 1780 states have call predecessors, (2375), 2152 states have return successors, (3367), 2484 states have call predecessors, (3367), 2375 states have call successors, (3367) [2022-12-13 17:45:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37796 states to 37796 states and 44437 transitions. [2022-12-13 17:45:16,572 INFO L78 Accepts]: Start accepts. Automaton has 37796 states and 44437 transitions. Word has length 228 [2022-12-13 17:45:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:45:16,572 INFO L495 AbstractCegarLoop]: Abstraction has 37796 states and 44437 transitions. [2022-12-13 17:45:16,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 17:45:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 37796 states and 44437 transitions. [2022-12-13 17:45:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-12-13 17:45:16,584 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:45:16,584 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:45:16,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 17:45:16,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 17:45:16,786 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:45:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:45:16,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1990942215, now seen corresponding path program 1 times [2022-12-13 17:45:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:45:16,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367558094] [2022-12-13 17:45:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:45:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:45:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:45:16,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:45:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:45:16,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:45:16,859 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:45:16,860 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 17:45:16,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 17:45:16,864 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2022-12-13 17:45:16,866 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:45:16,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:45:16 BoogieIcfgContainer [2022-12-13 17:45:16,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:45:16,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:45:16,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:45:16,965 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:45:16,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:38:51" (3/4) ... [2022-12-13 17:45:16,966 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:45:17,064 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:45:17,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:45:17,065 INFO L158 Benchmark]: Toolchain (without parser) took 386376.16ms. Allocated memory was 209.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 149.4MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-12-13 17:45:17,065 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:45:17,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.05ms. Allocated memory is still 209.7MB. Free memory was 149.2MB in the beginning and 135.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 17:45:17,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.49ms. Allocated memory is still 209.7MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:45:17,066 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 209.7MB. Free memory was 132.7MB in the beginning and 130.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:45:17,066 INFO L158 Benchmark]: RCFGBuilder took 427.76ms. Allocated memory is still 209.7MB. Free memory was 130.6MB in the beginning and 163.2MB in the end (delta: -32.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-12-13 17:45:17,066 INFO L158 Benchmark]: TraceAbstraction took 385480.21ms. Allocated memory was 209.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 162.6MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-12-13 17:45:17,066 INFO L158 Benchmark]: Witness Printer took 100.27ms. Allocated memory is still 4.3GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 17:45:17,068 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.11ms. Allocated memory is still 104.9MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.05ms. Allocated memory is still 209.7MB. Free memory was 149.2MB in the beginning and 135.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.49ms. Allocated memory is still 209.7MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 209.7MB. Free memory was 132.7MB in the beginning and 130.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 427.76ms. Allocated memory is still 209.7MB. Free memory was 130.6MB in the beginning and 163.2MB in the end (delta: -32.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * TraceAbstraction took 385480.21ms. Allocated memory was 209.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 162.6MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 100.27ms. Allocated memory is still 4.3GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0] [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L645] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] RET init_threads() [L647] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L418] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L423] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L428] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L433] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L438] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L443] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L448] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L647] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L648] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0] [L648] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L461] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L466] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L471] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L476] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L481] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L486] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L491] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L332] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L177] t3_pc = 1 [L178] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L399] RET transmit3() [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L332] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp_ndt_1) [L356] m_st = 1 [L357] CALL master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L67] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0] [L548] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET master() [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L113] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0] [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L148] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L149] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1] [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L149] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 385.3s, OverallIterations: 36, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 209.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19477 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19196 mSDsluCounter, 21091 SdHoareTripleChecker+Invalid, 12.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13735 mSDsCounter, 2226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22363 IncrementalHoareTripleChecker+Invalid, 24589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2226 mSolverCounterUnsat, 7356 mSDtfsCounter, 22363 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2752 GetRequests, 2350 SyntacticMatches, 0 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84187occurred in iteration=30, InterpolantAutomatonStates: 379, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 168.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 118201 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 6359 NumberOfCodeBlocks, 6359 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 6085 ConstructedInterpolants, 0 QuantifiedInterpolants, 12901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5415 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 44 InterpolantComputations, 35 PerfectInterpolantSequences, 2711/2905 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 17:45:17,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0ada446-4c32-4c6e-a299-a5fbab982a80/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE