./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa --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 d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:43:44,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:43:44,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:43:44,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:43:44,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:43:44,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:43:44,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:43:44,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:43:44,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:43:44,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:43:44,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:43:44,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:43:44,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:43:44,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:43:44,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:43:44,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:43:44,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:43:44,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:43:44,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:43:44,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:43:44,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:43:44,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:43:44,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:43:44,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:43:44,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:43:44,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:43:44,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:43:44,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:43:44,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:43:44,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:43:44,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:43:44,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:43:44,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:43:44,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:43:44,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:43:44,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:43:44,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:43:44,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:43:44,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:43:44,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:43:44,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:43:44,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:43:44,731 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:43:44,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:43:44,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:43:44,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:43:44,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:43:44,732 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:43:44,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:43:44,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:43:44,733 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:43:44,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:43:44,733 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:43:44,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:43:44,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:43:44,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:43:44,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:43:44,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:43:44,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:43:44,734 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:43:44,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:43:44,734 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:43:44,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:43:44,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:43:44,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:43:44,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:43:44,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:43:44,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:43:44,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:43:44,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:43:44,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:43:44,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:43:44,736 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:43:44,736 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:43:44,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:43:44,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:43:44,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/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_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2021-12-06 17:43:44,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:43:44,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:43:44,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:43:44,945 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:43:44,946 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:43:44,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-06 17:43:44,997 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/data/c26cba377/2fbc1a958b004fdb87e13df1f1bca58a/FLAGc648e5b90 [2021-12-06 17:43:45,377 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:43:45,378 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-06 17:43:45,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/data/c26cba377/2fbc1a958b004fdb87e13df1f1bca58a/FLAGc648e5b90 [2021-12-06 17:43:45,396 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/data/c26cba377/2fbc1a958b004fdb87e13df1f1bca58a [2021-12-06 17:43:45,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:43:45,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:43:45,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:43:45,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:43:45,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:43:45,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c81a50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45, skipping insertion in model container [2021-12-06 17:43:45,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:43:45,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:43:45,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2021-12-06 17:43:45,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2021-12-06 17:43:45,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:43:45,625 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:43:45,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2021-12-06 17:43:45,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2021-12-06 17:43:45,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:43:45,677 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:43:45,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45 WrapperNode [2021-12-06 17:43:45,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:43:45,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:43:45,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:43:45,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:43:45,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,727 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2021-12-06 17:43:45,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:43:45,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:43:45,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:43:45,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:43:45,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:43:45,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:43:45,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:43:45,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:43:45,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (1/1) ... [2021-12-06 17:43:45,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:43:45,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:45,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:45,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:43:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:43:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 17:43:45,815 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 17:43:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 17:43:45,816 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 17:43:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 17:43:45,816 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 17:43:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 17:43:45,816 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 17:43:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 17:43:45,816 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 17:43:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 17:43:45,816 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 17:43:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 17:43:45,817 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 17:43:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 17:43:45,817 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 17:43:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 17:43:45,817 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 17:43:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 17:43:45,817 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 17:43:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 17:43:45,817 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 17:43:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:43:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 17:43:45,818 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 17:43:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 17:43:45,818 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 17:43:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:43:45,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:43:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 17:43:45,818 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 17:43:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-06 17:43:45,818 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-06 17:43:45,883 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:43:45,885 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:43:46,194 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:43:46,203 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:43:46,203 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-06 17:43:46,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:43:46 BoogieIcfgContainer [2021-12-06 17:43:46,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:43:46,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:43:46,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:43:46,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:43:46,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:43:45" (1/3) ... [2021-12-06 17:43:46,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ccf092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:43:46, skipping insertion in model container [2021-12-06 17:43:46,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:45" (2/3) ... [2021-12-06 17:43:46,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ccf092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:43:46, skipping insertion in model container [2021-12-06 17:43:46,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:43:46" (3/3) ... [2021-12-06 17:43:46,214 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-06 17:43:46,219 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:43:46,219 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 17:43:46,257 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:43:46,262 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:43:46,262 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 17:43:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-06 17:43:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:43:46,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:46,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:46,287 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:46,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2021-12-06 17:43:46,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:46,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235323991] [2021-12-06 17:43:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:46,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:46,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:43:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:46,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:43:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:43:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:43:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:46,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:46,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235323991] [2021-12-06 17:43:46,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235323991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:46,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:46,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:43:46,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648313729] [2021-12-06 17:43:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:46,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:43:46,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:43:46,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:43:46,536 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:47,044 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2021-12-06 17:43:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:43:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-06 17:43:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:47,056 INFO L225 Difference]: With dead ends: 552 [2021-12-06 17:43:47,056 INFO L226 Difference]: Without dead ends: 343 [2021-12-06 17:43:47,060 INFO L932 BasicCegarLoop]: 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 [2021-12-06 17:43:47,063 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 535 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:47,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 823 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:43:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-06 17:43:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2021-12-06 17:43:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2021-12-06 17:43:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2021-12-06 17:43:47,117 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2021-12-06 17:43:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:47,118 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2021-12-06 17:43:47,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2021-12-06 17:43:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:43:47,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:47,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:47,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:43:47,121 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2021-12-06 17:43:47,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:47,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763696929] [2021-12-06 17:43:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:47,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:43:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:43:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:43:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:43:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:47,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763696929] [2021-12-06 17:43:47,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763696929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:47,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:47,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:43:47,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993764976] [2021-12-06 17:43:47,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:47,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:43:47,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:47,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:43:47,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:43:47,214 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:47,655 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2021-12-06 17:43:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:43:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-06 17:43:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:47,659 INFO L225 Difference]: With dead ends: 651 [2021-12-06 17:43:47,659 INFO L226 Difference]: Without dead ends: 456 [2021-12-06 17:43:47,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:43:47,661 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 527 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:47,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 946 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:43:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-12-06 17:43:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2021-12-06 17:43:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-06 17:43:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2021-12-06 17:43:47,692 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2021-12-06 17:43:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:47,692 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2021-12-06 17:43:47,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2021-12-06 17:43:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:43:47,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:47,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:47,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:43:47,695 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2021-12-06 17:43:47,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919226605] [2021-12-06 17:43:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:47,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:43:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:43:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:43:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:43:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:47,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919226605] [2021-12-06 17:43:47,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919226605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:47,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:47,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:43:47,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402386681] [2021-12-06 17:43:47,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:47,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:43:47,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:47,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:43:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:43:47,767 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:48,036 INFO L93 Difference]: Finished difference Result 737 states and 1061 transitions. [2021-12-06 17:43:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:43:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-06 17:43:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:48,040 INFO L225 Difference]: With dead ends: 737 [2021-12-06 17:43:48,040 INFO L226 Difference]: Without dead ends: 452 [2021-12-06 17:43:48,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:43:48,044 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 541 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:48,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 619 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:43:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-12-06 17:43:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 390. [2021-12-06 17:43:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4419354838709677) internal successors, (447), 317 states have internal predecessors, (447), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-06 17:43:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 550 transitions. [2021-12-06 17:43:48,083 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 550 transitions. Word has length 58 [2021-12-06 17:43:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:48,084 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 550 transitions. [2021-12-06 17:43:48,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 550 transitions. [2021-12-06 17:43:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:43:48,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:48,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:48,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:43:48,087 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2021-12-06 17:43:48,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:48,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266461733] [2021-12-06 17:43:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:48,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:43:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:43:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:43:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:43:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:48,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:48,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266461733] [2021-12-06 17:43:48,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266461733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:48,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:48,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:43:48,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155099718] [2021-12-06 17:43:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:48,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:43:48,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:43:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:43:48,171 INFO L87 Difference]: Start difference. First operand 390 states and 550 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:48,534 INFO L93 Difference]: Finished difference Result 773 states and 1118 transitions. [2021-12-06 17:43:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:43:48,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-06 17:43:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:48,537 INFO L225 Difference]: With dead ends: 773 [2021-12-06 17:43:48,537 INFO L226 Difference]: Without dead ends: 489 [2021-12-06 17:43:48,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 17:43:48,539 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 270 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:48,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 1086 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:43:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-12-06 17:43:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 399. [2021-12-06 17:43:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 319 states have (on average 1.4294670846394983) internal successors, (456), 326 states have internal predecessors, (456), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-06 17:43:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 559 transitions. [2021-12-06 17:43:48,563 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 559 transitions. Word has length 58 [2021-12-06 17:43:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:48,563 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 559 transitions. [2021-12-06 17:43:48,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 559 transitions. [2021-12-06 17:43:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:43:48,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:48,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:48,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:43:48,565 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2021-12-06 17:43:48,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:48,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065236228] [2021-12-06 17:43:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:48,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:43:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:43:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:43:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:43:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:48,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:48,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065236228] [2021-12-06 17:43:48,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065236228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:48,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:48,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:43:48,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131714366] [2021-12-06 17:43:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:48,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:43:48,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:43:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:43:48,644 INFO L87 Difference]: Start difference. First operand 399 states and 559 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:49,332 INFO L93 Difference]: Finished difference Result 1571 states and 2284 transitions. [2021-12-06 17:43:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:43:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-06 17:43:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:49,342 INFO L225 Difference]: With dead ends: 1571 [2021-12-06 17:43:49,342 INFO L226 Difference]: Without dead ends: 1278 [2021-12-06 17:43:49,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-06 17:43:49,345 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 1038 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:49,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 1001 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:43:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2021-12-06 17:43:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1107. [2021-12-06 17:43:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 880 states have (on average 1.384090909090909) internal successors, (1218), 902 states have internal predecessors, (1218), 138 states have call successors, (138), 81 states have call predecessors, (138), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2021-12-06 17:43:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1543 transitions. [2021-12-06 17:43:49,416 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1543 transitions. Word has length 58 [2021-12-06 17:43:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:49,416 INFO L470 AbstractCegarLoop]: Abstraction has 1107 states and 1543 transitions. [2021-12-06 17:43:49,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:43:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1543 transitions. [2021-12-06 17:43:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:43:49,417 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:49,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:49,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:43:49,418 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2021-12-06 17:43:49,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:49,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546313471] [2021-12-06 17:43:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:49,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:49,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:49,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546313471] [2021-12-06 17:43:49,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546313471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:49,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:49,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:43:49,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738486508] [2021-12-06 17:43:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:49,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:43:49,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:43:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:43:49,494 INFO L87 Difference]: Start difference. First operand 1107 states and 1543 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:49,912 INFO L93 Difference]: Finished difference Result 1330 states and 1858 transitions. [2021-12-06 17:43:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:43:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 17:43:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:49,919 INFO L225 Difference]: With dead ends: 1330 [2021-12-06 17:43:49,919 INFO L226 Difference]: Without dead ends: 1242 [2021-12-06 17:43:49,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:43:49,921 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 531 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:49,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [536 Valid, 868 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:43:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2021-12-06 17:43:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1203. [2021-12-06 17:43:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 956 states have (on average 1.3838912133891212) internal successors, (1323), 980 states have internal predecessors, (1323), 149 states have call successors, (149), 88 states have call predecessors, (149), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2021-12-06 17:43:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1675 transitions. [2021-12-06 17:43:49,986 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1675 transitions. Word has length 65 [2021-12-06 17:43:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:49,986 INFO L470 AbstractCegarLoop]: Abstraction has 1203 states and 1675 transitions. [2021-12-06 17:43:49,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1675 transitions. [2021-12-06 17:43:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:43:49,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:49,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:49,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:43:49,988 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2021-12-06 17:43:49,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:49,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238802785] [2021-12-06 17:43:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:49,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:50,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:50,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238802785] [2021-12-06 17:43:50,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238802785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:50,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:50,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:43:50,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816152996] [2021-12-06 17:43:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:50,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:43:50,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:50,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:43:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:43:50,067 INFO L87 Difference]: Start difference. First operand 1203 states and 1675 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:50,583 INFO L93 Difference]: Finished difference Result 1550 states and 2152 transitions. [2021-12-06 17:43:50,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:43:50,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 17:43:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:50,591 INFO L225 Difference]: With dead ends: 1550 [2021-12-06 17:43:50,592 INFO L226 Difference]: Without dead ends: 1373 [2021-12-06 17:43:50,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:43:50,594 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 678 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:50,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 1141 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:43:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-12-06 17:43:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1299. [2021-12-06 17:43:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1032 states have (on average 1.3827519379844961) internal successors, (1427), 1058 states have internal predecessors, (1427), 160 states have call successors, (160), 95 states have call predecessors, (160), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2021-12-06 17:43:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1809 transitions. [2021-12-06 17:43:50,657 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1809 transitions. Word has length 65 [2021-12-06 17:43:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:50,657 INFO L470 AbstractCegarLoop]: Abstraction has 1299 states and 1809 transitions. [2021-12-06 17:43:50,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1809 transitions. [2021-12-06 17:43:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:43:50,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:50,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:50,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:43:50,659 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2021-12-06 17:43:50,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738120877] [2021-12-06 17:43:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:50,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:50,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:50,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738120877] [2021-12-06 17:43:50,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738120877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:50,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:50,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:43:50,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222415654] [2021-12-06 17:43:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:50,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:43:50,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:43:50,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:43:50,748 INFO L87 Difference]: Start difference. First operand 1299 states and 1809 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:43:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:51,114 INFO L93 Difference]: Finished difference Result 1600 states and 2223 transitions. [2021-12-06 17:43:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:43:51,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-06 17:43:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:51,123 INFO L225 Difference]: With dead ends: 1600 [2021-12-06 17:43:51,123 INFO L226 Difference]: Without dead ends: 1333 [2021-12-06 17:43:51,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:43:51,125 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 210 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:51,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1414 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:43:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2021-12-06 17:43:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1304. [2021-12-06 17:43:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1036 states have (on average 1.3793436293436294) internal successors, (1429), 1062 states have internal predecessors, (1429), 160 states have call successors, (160), 95 states have call predecessors, (160), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2021-12-06 17:43:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1812 transitions. [2021-12-06 17:43:51,203 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1812 transitions. Word has length 65 [2021-12-06 17:43:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:51,204 INFO L470 AbstractCegarLoop]: Abstraction has 1304 states and 1812 transitions. [2021-12-06 17:43:51,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:43:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1812 transitions. [2021-12-06 17:43:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:43:51,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:51,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:51,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 17:43:51,205 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2021-12-06 17:43:51,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:51,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293554679] [2021-12-06 17:43:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:51,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:51,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:51,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293554679] [2021-12-06 17:43:51,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293554679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:51,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:51,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:43:51,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835074829] [2021-12-06 17:43:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:51,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:43:51,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:43:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:43:51,306 INFO L87 Difference]: Start difference. First operand 1304 states and 1812 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 17:43:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:52,301 INFO L93 Difference]: Finished difference Result 2966 states and 4084 transitions. [2021-12-06 17:43:52,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 17:43:52,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-12-06 17:43:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:52,312 INFO L225 Difference]: With dead ends: 2966 [2021-12-06 17:43:52,312 INFO L226 Difference]: Without dead ends: 2694 [2021-12-06 17:43:52,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 17:43:52,314 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 1348 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:52,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1365 Valid, 1605 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 17:43:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2021-12-06 17:43:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2444. [2021-12-06 17:43:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1936 states have (on average 1.3481404958677685) internal successors, (2610), 1982 states have internal predecessors, (2610), 277 states have call successors, (277), 197 states have call predecessors, (277), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2021-12-06 17:43:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3296 transitions. [2021-12-06 17:43:52,444 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3296 transitions. Word has length 65 [2021-12-06 17:43:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:52,445 INFO L470 AbstractCegarLoop]: Abstraction has 2444 states and 3296 transitions. [2021-12-06 17:43:52,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 17:43:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3296 transitions. [2021-12-06 17:43:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:43:52,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:52,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:52,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 17:43:52,447 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2021-12-06 17:43:52,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:52,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955615328] [2021-12-06 17:43:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:52,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:52,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:52,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955615328] [2021-12-06 17:43:52,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955615328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:52,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:52,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:43:52,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488626716] [2021-12-06 17:43:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:52,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:43:52,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:52,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:43:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:43:52,528 INFO L87 Difference]: Start difference. First operand 2444 states and 3296 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:43:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:52,958 INFO L93 Difference]: Finished difference Result 4045 states and 5420 transitions. [2021-12-06 17:43:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:43:52,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-06 17:43:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:52,969 INFO L225 Difference]: With dead ends: 4045 [2021-12-06 17:43:52,969 INFO L226 Difference]: Without dead ends: 2633 [2021-12-06 17:43:52,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:43:52,973 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 208 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:52,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1407 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:43:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2021-12-06 17:43:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2489. [2021-12-06 17:43:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 1972 states have (on average 1.3372210953346857) internal successors, (2637), 2018 states have internal predecessors, (2637), 277 states have call successors, (277), 197 states have call predecessors, (277), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2021-12-06 17:43:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3335 transitions. [2021-12-06 17:43:53,091 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3335 transitions. Word has length 65 [2021-12-06 17:43:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:53,091 INFO L470 AbstractCegarLoop]: Abstraction has 2489 states and 3335 transitions. [2021-12-06 17:43:53,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:43:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3335 transitions. [2021-12-06 17:43:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:43:53,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:53,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:53,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 17:43:53,093 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2021-12-06 17:43:53,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:53,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156990494] [2021-12-06 17:43:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:53,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:53,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:53,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156990494] [2021-12-06 17:43:53,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156990494] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:53,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:53,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:43:53,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539066849] [2021-12-06 17:43:53,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:53,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:43:53,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:43:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:43:53,156 INFO L87 Difference]: Start difference. First operand 2489 states and 3335 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:53,605 INFO L93 Difference]: Finished difference Result 3924 states and 5174 transitions. [2021-12-06 17:43:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:43:53,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 17:43:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:53,615 INFO L225 Difference]: With dead ends: 3924 [2021-12-06 17:43:53,616 INFO L226 Difference]: Without dead ends: 2687 [2021-12-06 17:43:53,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:43:53,618 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 568 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:53,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 1032 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:43:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2021-12-06 17:43:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2467. [2021-12-06 17:43:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 1958 states have (on average 1.3345250255362615) internal successors, (2613), 1998 states have internal predecessors, (2613), 277 states have call successors, (277), 197 states have call predecessors, (277), 230 states have return successors, (405), 276 states have call predecessors, (405), 273 states have call successors, (405) [2021-12-06 17:43:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3295 transitions. [2021-12-06 17:43:53,753 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3295 transitions. Word has length 65 [2021-12-06 17:43:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:53,754 INFO L470 AbstractCegarLoop]: Abstraction has 2467 states and 3295 transitions. [2021-12-06 17:43:53,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3295 transitions. [2021-12-06 17:43:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:43:53,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:53,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:53,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 17:43:53,756 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2021-12-06 17:43:53,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573330699] [2021-12-06 17:43:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:53,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:53,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:53,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573330699] [2021-12-06 17:43:53,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573330699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:53,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:53,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:43:53,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523970379] [2021-12-06 17:43:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:53,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:43:53,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:53,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:43:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:43:53,824 INFO L87 Difference]: Start difference. First operand 2467 states and 3295 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:54,209 INFO L93 Difference]: Finished difference Result 5542 states and 7274 transitions. [2021-12-06 17:43:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:43:54,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 17:43:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:54,225 INFO L225 Difference]: With dead ends: 5542 [2021-12-06 17:43:54,225 INFO L226 Difference]: Without dead ends: 4110 [2021-12-06 17:43:54,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:43:54,229 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 668 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:54,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 702 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:43:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2021-12-06 17:43:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3838. [2021-12-06 17:43:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3024 states have (on average 1.2996031746031746) internal successors, (3930), 3085 states have internal predecessors, (3930), 429 states have call successors, (429), 320 states have call predecessors, (429), 383 states have return successors, (677), 440 states have call predecessors, (677), 425 states have call successors, (677) [2021-12-06 17:43:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 5036 transitions. [2021-12-06 17:43:54,437 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 5036 transitions. Word has length 65 [2021-12-06 17:43:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:54,437 INFO L470 AbstractCegarLoop]: Abstraction has 3838 states and 5036 transitions. [2021-12-06 17:43:54,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:43:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 5036 transitions. [2021-12-06 17:43:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 17:43:54,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:54,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:54,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 17:43:54,440 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2021-12-06 17:43:54,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:54,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503117692] [2021-12-06 17:43:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:54,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:54,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:54,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503117692] [2021-12-06 17:43:54,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503117692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:54,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:54,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:43:54,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089384119] [2021-12-06 17:43:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:54,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:43:54,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:43:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:43:54,495 INFO L87 Difference]: Start difference. First operand 3838 states and 5036 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:43:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:54,950 INFO L93 Difference]: Finished difference Result 8856 states and 11550 transitions. [2021-12-06 17:43:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:43:54,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-06 17:43:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:54,983 INFO L225 Difference]: With dead ends: 8856 [2021-12-06 17:43:54,983 INFO L226 Difference]: Without dead ends: 6032 [2021-12-06 17:43:54,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:43:54,990 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 511 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:54,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 711 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:43:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2021-12-06 17:43:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 5516. [2021-12-06 17:43:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5516 states, 4309 states have (on average 1.2833604084474357) internal successors, (5530), 4377 states have internal predecessors, (5530), 623 states have call successors, (623), 494 states have call predecessors, (623), 582 states have return successors, (998), 652 states have call predecessors, (998), 619 states have call successors, (998) [2021-12-06 17:43:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5516 states to 5516 states and 7151 transitions. [2021-12-06 17:43:55,258 INFO L78 Accepts]: Start accepts. Automaton has 5516 states and 7151 transitions. Word has length 66 [2021-12-06 17:43:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:55,258 INFO L470 AbstractCegarLoop]: Abstraction has 5516 states and 7151 transitions. [2021-12-06 17:43:55,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:43:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5516 states and 7151 transitions. [2021-12-06 17:43:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 17:43:55,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:55,260 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:55,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 17:43:55,261 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2021-12-06 17:43:55,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:55,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894302053] [2021-12-06 17:43:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:55,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:55,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894302053] [2021-12-06 17:43:55,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894302053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:55,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:55,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:43:55,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801025497] [2021-12-06 17:43:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:55,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:43:55,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:43:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:43:55,313 INFO L87 Difference]: Start difference. First operand 5516 states and 7151 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 17:43:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:55,778 INFO L93 Difference]: Finished difference Result 7146 states and 9153 transitions. [2021-12-06 17:43:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:43:55,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2021-12-06 17:43:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:55,813 INFO L225 Difference]: With dead ends: 7146 [2021-12-06 17:43:55,813 INFO L226 Difference]: Without dead ends: 7143 [2021-12-06 17:43:55,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:43:55,816 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 941 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:55,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 587 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:43:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7143 states. [2021-12-06 17:43:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7143 to 6570. [2021-12-06 17:43:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5112 states have (on average 1.2715179968701096) internal successors, (6500), 5189 states have internal predecessors, (6500), 749 states have call successors, (749), 608 states have call predecessors, (749), 707 states have return successors, (1191), 780 states have call predecessors, (1191), 746 states have call successors, (1191) [2021-12-06 17:43:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8440 transitions. [2021-12-06 17:43:56,171 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8440 transitions. Word has length 73 [2021-12-06 17:43:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:56,171 INFO L470 AbstractCegarLoop]: Abstraction has 6570 states and 8440 transitions. [2021-12-06 17:43:56,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 17:43:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8440 transitions. [2021-12-06 17:43:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 17:43:56,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:56,173 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:56,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 17:43:56,173 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2021-12-06 17:43:56,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:56,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686588365] [2021-12-06 17:43:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:56,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:56,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:56,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686588365] [2021-12-06 17:43:56,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686588365] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:43:56,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712157320] [2021-12-06 17:43:56,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:56,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:43:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:56,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:43:56,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 17:43:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:56,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:43:56,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:56,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:56,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712157320] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:56,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:43:56,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-06 17:43:56,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974633004] [2021-12-06 17:43:56,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:56,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:43:56,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:43:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:56,808 INFO L87 Difference]: Start difference. First operand 6570 states and 8440 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 17:43:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:58,084 INFO L93 Difference]: Finished difference Result 14216 states and 17968 transitions. [2021-12-06 17:43:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 17:43:58,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2021-12-06 17:43:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:58,121 INFO L225 Difference]: With dead ends: 14216 [2021-12-06 17:43:58,121 INFO L226 Difference]: Without dead ends: 14213 [2021-12-06 17:43:58,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-06 17:43:58,126 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1305 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:58,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 1279 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:43:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14213 states. [2021-12-06 17:43:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14213 to 11828. [2021-12-06 17:43:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11828 states, 9204 states have (on average 1.2612994350282485) internal successors, (11609), 9333 states have internal predecessors, (11609), 1315 states have call successors, (1315), 1098 states have call predecessors, (1315), 1307 states have return successors, (2130), 1404 states have call predecessors, (2130), 1312 states have call successors, (2130) [2021-12-06 17:43:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11828 states to 11828 states and 15054 transitions. [2021-12-06 17:43:58,724 INFO L78 Accepts]: Start accepts. Automaton has 11828 states and 15054 transitions. Word has length 74 [2021-12-06 17:43:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:58,724 INFO L470 AbstractCegarLoop]: Abstraction has 11828 states and 15054 transitions. [2021-12-06 17:43:58,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 17:43:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 11828 states and 15054 transitions. [2021-12-06 17:43:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-06 17:43:58,727 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:58,727 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:58,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:58,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 17:43:58,929 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2021-12-06 17:43:58,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:58,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633673965] [2021-12-06 17:43:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:58,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:43:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:43:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:43:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:43:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:43:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:43:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:43:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:58,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633673965] [2021-12-06 17:43:58,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633673965] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:58,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:58,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:43:58,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101866592] [2021-12-06 17:43:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:58,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:43:58,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:58,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:43:58,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:43:58,998 INFO L87 Difference]: Start difference. First operand 11828 states and 15054 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 17:43:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:59,552 INFO L93 Difference]: Finished difference Result 18371 states and 23396 transitions. [2021-12-06 17:43:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:43:59,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2021-12-06 17:43:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:59,573 INFO L225 Difference]: With dead ends: 18371 [2021-12-06 17:43:59,573 INFO L226 Difference]: Without dead ends: 8433 [2021-12-06 17:43:59,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:59,593 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 538 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:59,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 691 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:43:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8433 states. [2021-12-06 17:44:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8433 to 7881. [2021-12-06 17:44:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7881 states, 6151 states have (on average 1.2435376361567225) internal successors, (7649), 6236 states have internal predecessors, (7649), 882 states have call successors, (882), 722 states have call predecessors, (882), 846 states have return successors, (1349), 930 states have call predecessors, (1349), 879 states have call successors, (1349) [2021-12-06 17:44:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 9880 transitions. [2021-12-06 17:44:00,054 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 9880 transitions. Word has length 77 [2021-12-06 17:44:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:00,054 INFO L470 AbstractCegarLoop]: Abstraction has 7881 states and 9880 transitions. [2021-12-06 17:44:00,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 17:44:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 9880 transitions. [2021-12-06 17:44:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 17:44:00,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:00,057 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 17:44:00,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:44:00,057 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2021-12-06 17:44:00,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:00,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944423528] [2021-12-06 17:44:00,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:00,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:44:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:44:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:44:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:44:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:44:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:44:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 17:44:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 17:44:00,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:00,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944423528] [2021-12-06 17:44:00,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944423528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:00,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:44:00,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:44:00,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035566303] [2021-12-06 17:44:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:00,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:44:00,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:00,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:44:00,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:00,115 INFO L87 Difference]: Start difference. First operand 7881 states and 9880 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:44:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:01,220 INFO L93 Difference]: Finished difference Result 21755 states and 27097 transitions. [2021-12-06 17:44:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:44:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2021-12-06 17:44:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:01,255 INFO L225 Difference]: With dead ends: 21755 [2021-12-06 17:44:01,255 INFO L226 Difference]: Without dead ends: 14912 [2021-12-06 17:44:01,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-06 17:44:01,267 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 762 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:01,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 971 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:44:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14912 states. [2021-12-06 17:44:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14912 to 14053. [2021-12-06 17:44:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14053 states, 10827 states have (on average 1.2132631384501709) internal successors, (13136), 11018 states have internal predecessors, (13136), 1598 states have call successors, (1598), 1326 states have call predecessors, (1598), 1626 states have return successors, (2752), 1722 states have call predecessors, (2752), 1595 states have call successors, (2752) [2021-12-06 17:44:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14053 states to 14053 states and 17486 transitions. [2021-12-06 17:44:01,935 INFO L78 Accepts]: Start accepts. Automaton has 14053 states and 17486 transitions. Word has length 84 [2021-12-06 17:44:01,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:01,935 INFO L470 AbstractCegarLoop]: Abstraction has 14053 states and 17486 transitions. [2021-12-06 17:44:01,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:44:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 14053 states and 17486 transitions. [2021-12-06 17:44:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-06 17:44:01,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:01,940 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:01,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 17:44:01,940 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash -559065813, now seen corresponding path program 1 times [2021-12-06 17:44:01,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:01,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369377974] [2021-12-06 17:44:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:01,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 17:44:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 17:44:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:44:02,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:02,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369377974] [2021-12-06 17:44:02,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369377974] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:02,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877729387] [2021-12-06 17:44:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:02,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:02,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:02,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 17:44:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:44:02,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:44:02,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:02,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877729387] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:02,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:02,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:44:02,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598547491] [2021-12-06 17:44:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:02,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:44:02,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:02,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:44:02,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:02,183 INFO L87 Difference]: Start difference. First operand 14053 states and 17486 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:02,843 INFO L93 Difference]: Finished difference Result 15946 states and 20145 transitions. [2021-12-06 17:44:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:44:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-06 17:44:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:02,885 INFO L225 Difference]: With dead ends: 15946 [2021-12-06 17:44:02,885 INFO L226 Difference]: Without dead ends: 14299 [2021-12-06 17:44:02,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:02,891 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 648 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 [2021-12-06 17:44:02,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 648 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2021-12-06 17:44:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 14299. [2021-12-06 17:44:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14299 states, 11025 states have (on average 1.215419501133787) internal successors, (13400), 11218 states have internal predecessors, (13400), 1626 states have call successors, (1626), 1344 states have call predecessors, (1626), 1646 states have return successors, (2794), 1750 states have call predecessors, (2794), 1623 states have call successors, (2794) [2021-12-06 17:44:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14299 states to 14299 states and 17820 transitions. [2021-12-06 17:44:03,554 INFO L78 Accepts]: Start accepts. Automaton has 14299 states and 17820 transitions. Word has length 93 [2021-12-06 17:44:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:03,555 INFO L470 AbstractCegarLoop]: Abstraction has 14299 states and 17820 transitions. [2021-12-06 17:44:03,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 14299 states and 17820 transitions. [2021-12-06 17:44:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-06 17:44:03,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:03,559 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-06 17:44:03,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 17:44:03,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 17:44:03,761 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2021-12-06 17:44:03,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:03,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166496393] [2021-12-06 17:44:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:03,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:44:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:44:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:44:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:44:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:44:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:44:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 17:44:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:44:03,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:03,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166496393] [2021-12-06 17:44:03,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166496393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:03,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:44:03,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:44:03,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524355410] [2021-12-06 17:44:03,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:03,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:44:03,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:03,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:44:03,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:44:03,850 INFO L87 Difference]: Start difference. First operand 14299 states and 17820 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:44:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:04,954 INFO L93 Difference]: Finished difference Result 25173 states and 31139 transitions. [2021-12-06 17:44:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 17:44:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2021-12-06 17:44:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:04,980 INFO L225 Difference]: With dead ends: 25173 [2021-12-06 17:44:04,980 INFO L226 Difference]: Without dead ends: 12774 [2021-12-06 17:44:04,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-06 17:44:04,998 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 1337 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:04,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1372 Valid, 1140 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:44:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12774 states. [2021-12-06 17:44:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12774 to 11874. [2021-12-06 17:44:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11874 states, 9191 states have (on average 1.2089000108802088) internal successors, (11111), 9351 states have internal predecessors, (11111), 1327 states have call successors, (1327), 1093 states have call predecessors, (1327), 1354 states have return successors, (2126), 1440 states have call predecessors, (2126), 1324 states have call successors, (2126) [2021-12-06 17:44:05,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11874 states to 11874 states and 14564 transitions. [2021-12-06 17:44:05,664 INFO L78 Accepts]: Start accepts. Automaton has 11874 states and 14564 transitions. Word has length 93 [2021-12-06 17:44:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:05,664 INFO L470 AbstractCegarLoop]: Abstraction has 11874 states and 14564 transitions. [2021-12-06 17:44:05,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:44:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 11874 states and 14564 transitions. [2021-12-06 17:44:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-06 17:44:05,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:05,671 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 17:44:05,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 17:44:05,671 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:05,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1056840823, now seen corresponding path program 1 times [2021-12-06 17:44:05,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:05,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908416950] [2021-12-06 17:44:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:05,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 17:44:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 17:44:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-06 17:44:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-06 17:44:05,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:05,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908416950] [2021-12-06 17:44:05,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908416950] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:05,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783864899] [2021-12-06 17:44:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:05,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:05,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:05,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:05,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 17:44:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:05,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:44:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:44:05,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:05,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783864899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:05,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:05,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 17:44:05,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341824807] [2021-12-06 17:44:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:05,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:44:05,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:44:05,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:05,935 INFO L87 Difference]: Start difference. First operand 11874 states and 14564 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 17:44:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:06,510 INFO L93 Difference]: Finished difference Result 13625 states and 17039 transitions. [2021-12-06 17:44:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:44:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-06 17:44:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:06,535 INFO L225 Difference]: With dead ends: 13625 [2021-12-06 17:44:06,535 INFO L226 Difference]: Without dead ends: 12610 [2021-12-06 17:44:06,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:06,540 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 208 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 441 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 [2021-12-06 17:44:06,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 441 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12610 states. [2021-12-06 17:44:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12610 to 12582. [2021-12-06 17:44:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12582 states, 9764 states have (on average 1.218455551003687) internal successors, (11897), 9933 states have internal predecessors, (11897), 1405 states have call successors, (1405), 1144 states have call predecessors, (1405), 1411 states have return successors, (2230), 1515 states have call predecessors, (2230), 1402 states have call successors, (2230) [2021-12-06 17:44:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12582 states to 12582 states and 15532 transitions. [2021-12-06 17:44:07,121 INFO L78 Accepts]: Start accepts. Automaton has 12582 states and 15532 transitions. Word has length 119 [2021-12-06 17:44:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:07,121 INFO L470 AbstractCegarLoop]: Abstraction has 12582 states and 15532 transitions. [2021-12-06 17:44:07,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 17:44:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12582 states and 15532 transitions. [2021-12-06 17:44:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-06 17:44:07,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:07,129 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:07,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 17:44:07,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:07,330 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 131680678, now seen corresponding path program 1 times [2021-12-06 17:44:07,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:07,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100822893] [2021-12-06 17:44:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:07,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-06 17:44:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:44:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 17:44:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 17:44:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 17:44:07,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:07,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100822893] [2021-12-06 17:44:07,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100822893] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:07,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448852611] [2021-12-06 17:44:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:07,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:07,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:07,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:07,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 17:44:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:07,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:44:07,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 17:44:07,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:07,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448852611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:07,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:07,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:44:07,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149073825] [2021-12-06 17:44:07,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:07,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:44:07,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:44:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:07,582 INFO L87 Difference]: Start difference. First operand 12582 states and 15532 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:44:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:08,121 INFO L93 Difference]: Finished difference Result 14844 states and 18704 transitions. [2021-12-06 17:44:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:44:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2021-12-06 17:44:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:08,148 INFO L225 Difference]: With dead ends: 14844 [2021-12-06 17:44:08,148 INFO L226 Difference]: Without dead ends: 12888 [2021-12-06 17:44:08,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:08,156 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 259 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 306 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 [2021-12-06 17:44:08,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 306 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12888 states. [2021-12-06 17:44:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12888 to 12822. [2021-12-06 17:44:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12822 states, 9983 states have (on average 1.208955223880597) internal successors, (12069), 10149 states have internal predecessors, (12069), 1405 states have call successors, (1405), 1162 states have call predecessors, (1405), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2021-12-06 17:44:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12822 states to 12822 states and 15698 transitions. [2021-12-06 17:44:08,786 INFO L78 Accepts]: Start accepts. Automaton has 12822 states and 15698 transitions. Word has length 135 [2021-12-06 17:44:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:08,786 INFO L470 AbstractCegarLoop]: Abstraction has 12822 states and 15698 transitions. [2021-12-06 17:44:08,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:44:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 12822 states and 15698 transitions. [2021-12-06 17:44:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-06 17:44:08,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:08,794 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:08,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 17:44:08,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:08,995 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1548570021, now seen corresponding path program 1 times [2021-12-06 17:44:08,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:08,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115380840] [2021-12-06 17:44:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:08,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-06 17:44:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:44:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 17:44:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 17:44:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 17:44:09,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:09,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115380840] [2021-12-06 17:44:09,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115380840] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:09,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18503409] [2021-12-06 17:44:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:09,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:09,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:09,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:09,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 17:44:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:44:09,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 17:44:09,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:09,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18503409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:09,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:09,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:44:09,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930142115] [2021-12-06 17:44:09,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:09,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:44:09,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:09,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:44:09,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:09,253 INFO L87 Difference]: Start difference. First operand 12822 states and 15698 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:44:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:09,846 INFO L93 Difference]: Finished difference Result 15067 states and 18659 transitions. [2021-12-06 17:44:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:44:09,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2021-12-06 17:44:09,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:09,871 INFO L225 Difference]: With dead ends: 15067 [2021-12-06 17:44:09,871 INFO L226 Difference]: Without dead ends: 12873 [2021-12-06 17:44:09,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:09,877 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 247 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 429 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 [2021-12-06 17:44:09,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 429 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12873 states. [2021-12-06 17:44:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12873 to 12804. [2021-12-06 17:44:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12804 states, 9965 states have (on average 1.2039136979427998) internal successors, (11997), 10131 states have internal predecessors, (11997), 1405 states have call successors, (1405), 1162 states have call predecessors, (1405), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2021-12-06 17:44:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12804 states to 12804 states and 15626 transitions. [2021-12-06 17:44:10,562 INFO L78 Accepts]: Start accepts. Automaton has 12804 states and 15626 transitions. Word has length 135 [2021-12-06 17:44:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:10,562 INFO L470 AbstractCegarLoop]: Abstraction has 12804 states and 15626 transitions. [2021-12-06 17:44:10,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:44:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 12804 states and 15626 transitions. [2021-12-06 17:44:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-06 17:44:10,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:10,570 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-12-06 17:44:10,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 17:44:10,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:10,771 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 367339351, now seen corresponding path program 1 times [2021-12-06 17:44:10,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:10,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988544285] [2021-12-06 17:44:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:10,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 17:44:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:44:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 17:44:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 17:44:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 17:44:10,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988544285] [2021-12-06 17:44:10,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988544285] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174508125] [2021-12-06 17:44:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:10,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:10,842 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:10,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 17:44:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:10,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:44:10,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 17:44:10,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:10,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174508125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:10,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:10,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:44:10,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651895353] [2021-12-06 17:44:10,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:10,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:44:10,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:44:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:10,992 INFO L87 Difference]: Start difference. First operand 12804 states and 15626 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) [2021-12-06 17:44:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:11,521 INFO L93 Difference]: Finished difference Result 13748 states and 16914 transitions. [2021-12-06 17:44:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:44:11,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 136 [2021-12-06 17:44:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:11,545 INFO L225 Difference]: With dead ends: 13748 [2021-12-06 17:44:11,545 INFO L226 Difference]: Without dead ends: 12640 [2021-12-06 17:44:11,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:11,550 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 87 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 647 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 [2021-12-06 17:44:11,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 647 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12640 states. [2021-12-06 17:44:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12640 to 12600. [2021-12-06 17:44:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12600 states, 9803 states have (on average 1.199632765479955) internal successors, (11760), 9967 states have internal predecessors, (11760), 1383 states have call successors, (1383), 1147 states have call predecessors, (1383), 1412 states have return successors, (2184), 1496 states have call predecessors, (2184), 1380 states have call successors, (2184) [2021-12-06 17:44:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 15327 transitions. [2021-12-06 17:44:12,182 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 15327 transitions. Word has length 136 [2021-12-06 17:44:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:12,182 INFO L470 AbstractCegarLoop]: Abstraction has 12600 states and 15327 transitions. [2021-12-06 17:44:12,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) [2021-12-06 17:44:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 15327 transitions. [2021-12-06 17:44:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-06 17:44:12,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:12,190 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-12-06 17:44:12,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 17:44:12,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-06 17:44:12,392 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2008230337, now seen corresponding path program 1 times [2021-12-06 17:44:12,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:12,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211888390] [2021-12-06 17:44:12,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:12,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 17:44:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:44:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 17:44:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 17:44:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-06 17:44:12,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211888390] [2021-12-06 17:44:12,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211888390] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004668272] [2021-12-06 17:44:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:12,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:12,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:12,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:12,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 17:44:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:44:12,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-06 17:44:12,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:12,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004668272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:12,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:12,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 17:44:12,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871490678] [2021-12-06 17:44:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:12,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:44:12,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:44:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:44:12,673 INFO L87 Difference]: Start difference. First operand 12600 states and 15327 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:13,359 INFO L93 Difference]: Finished difference Result 14185 states and 17330 transitions. [2021-12-06 17:44:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:44:13,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-06 17:44:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:13,382 INFO L225 Difference]: With dead ends: 14185 [2021-12-06 17:44:13,383 INFO L226 Difference]: Without dead ends: 12213 [2021-12-06 17:44:13,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:44:13,390 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 339 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:13,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 525 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:44:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2021-12-06 17:44:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 12180. [2021-12-06 17:44:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12180 states, 9470 states have (on average 1.1893347412882789) internal successors, (11263), 9627 states have internal predecessors, (11263), 1327 states have call successors, (1327), 1114 states have call predecessors, (1327), 1381 states have return successors, (2108), 1449 states have call predecessors, (2108), 1324 states have call successors, (2108) [2021-12-06 17:44:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12180 states to 12180 states and 14698 transitions. [2021-12-06 17:44:14,026 INFO L78 Accepts]: Start accepts. Automaton has 12180 states and 14698 transitions. Word has length 137 [2021-12-06 17:44:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:14,026 INFO L470 AbstractCegarLoop]: Abstraction has 12180 states and 14698 transitions. [2021-12-06 17:44:14,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12180 states and 14698 transitions. [2021-12-06 17:44:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-06 17:44:14,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:14,034 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-12-06 17:44:14,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 17:44:14,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 17:44:14,236 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash 979594561, now seen corresponding path program 1 times [2021-12-06 17:44:14,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:14,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504243675] [2021-12-06 17:44:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:14,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 17:44:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:44:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 17:44:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 17:44:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-06 17:44:14,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:14,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504243675] [2021-12-06 17:44:14,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504243675] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835097992] [2021-12-06 17:44:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:14,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:14,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:14,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:14,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 17:44:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:14,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:44:14,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-06 17:44:14,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:14,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835097992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:14,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:14,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 17:44:14,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814999765] [2021-12-06 17:44:14,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:14,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:44:14,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:14,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:44:14,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:44:14,458 INFO L87 Difference]: Start difference. First operand 12180 states and 14698 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:15,046 INFO L93 Difference]: Finished difference Result 13775 states and 16702 transitions. [2021-12-06 17:44:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:44:15,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-06 17:44:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:15,065 INFO L225 Difference]: With dead ends: 13775 [2021-12-06 17:44:15,065 INFO L226 Difference]: Without dead ends: 12222 [2021-12-06 17:44:15,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:44:15,069 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:15,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1103 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12222 states. [2021-12-06 17:44:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12222 to 12198. [2021-12-06 17:44:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12198 states, 9488 states have (on average 1.1858136593591906) internal successors, (11251), 9645 states have internal predecessors, (11251), 1327 states have call successors, (1327), 1114 states have call predecessors, (1327), 1381 states have return successors, (2108), 1449 states have call predecessors, (2108), 1324 states have call successors, (2108) [2021-12-06 17:44:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12198 states to 12198 states and 14686 transitions. [2021-12-06 17:44:15,678 INFO L78 Accepts]: Start accepts. Automaton has 12198 states and 14686 transitions. Word has length 137 [2021-12-06 17:44:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:15,679 INFO L470 AbstractCegarLoop]: Abstraction has 12198 states and 14686 transitions. [2021-12-06 17:44:15,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 12198 states and 14686 transitions. [2021-12-06 17:44:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-06 17:44:15,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:15,686 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:15,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 17:44:15,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 17:44:15,888 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2021-12-06 17:44:15,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:15,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607352738] [2021-12-06 17:44:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:15,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 17:44:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:44:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 17:44:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 17:44:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-06 17:44:15,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:15,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607352738] [2021-12-06 17:44:15,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607352738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:15,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:44:15,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:44:15,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760450699] [2021-12-06 17:44:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:15,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:44:15,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:44:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:44:15,957 INFO L87 Difference]: Start difference. First operand 12198 states and 14686 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 17:44:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:16,958 INFO L93 Difference]: Finished difference Result 13695 states and 16415 transitions. [2021-12-06 17:44:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:44:16,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-06 17:44:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:16,981 INFO L225 Difference]: With dead ends: 13695 [2021-12-06 17:44:16,981 INFO L226 Difference]: Without dead ends: 13692 [2021-12-06 17:44:16,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-06 17:44:16,985 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 718 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:16,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 836 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:44:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2021-12-06 17:44:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 13236. [2021-12-06 17:44:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13236 states, 10340 states have (on average 1.1831721470019343) internal successors, (12234), 10508 states have internal predecessors, (12234), 1427 states have call successors, (1427), 1186 states have call predecessors, (1427), 1467 states have return successors, (2234), 1552 states have call predecessors, (2234), 1424 states have call successors, (2234) [2021-12-06 17:44:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13236 states to 13236 states and 15895 transitions. [2021-12-06 17:44:17,762 INFO L78 Accepts]: Start accepts. Automaton has 13236 states and 15895 transitions. Word has length 137 [2021-12-06 17:44:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:17,762 INFO L470 AbstractCegarLoop]: Abstraction has 13236 states and 15895 transitions. [2021-12-06 17:44:17,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 17:44:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13236 states and 15895 transitions. [2021-12-06 17:44:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-06 17:44:17,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:17,773 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2021-12-06 17:44:17,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 17:44:17,773 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2021-12-06 17:44:17,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:17,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619164110] [2021-12-06 17:44:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:17,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:44:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:44:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:44:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:44:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:44:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:44:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 17:44:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:44:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 17:44:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 17:44:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:44:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:44:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 17:44:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 17:44:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-06 17:44:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 17:44:17,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:17,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619164110] [2021-12-06 17:44:17,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619164110] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855961347] [2021-12-06 17:44:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:17,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:17,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:17,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:17,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 17:44:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:17,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:44:17,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 17:44:18,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:18,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855961347] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:18,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:18,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-06 17:44:18,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433921116] [2021-12-06 17:44:18,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:18,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:44:18,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:18,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:44:18,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:44:18,043 INFO L87 Difference]: Start difference. First operand 13236 states and 15895 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 17:44:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:18,498 INFO L93 Difference]: Finished difference Result 18384 states and 22115 transitions. [2021-12-06 17:44:18,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:44:18,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2021-12-06 17:44:18,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:18,520 INFO L225 Difference]: With dead ends: 18384 [2021-12-06 17:44:18,520 INFO L226 Difference]: Without dead ends: 7802 [2021-12-06 17:44:18,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-06 17:44:18,534 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 34 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:18,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1358 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7802 states. [2021-12-06 17:44:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7802 to 7360. [2021-12-06 17:44:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7360 states, 5905 states have (on average 1.168501270110076) internal successors, (6900), 5971 states have internal predecessors, (6900), 729 states have call successors, (729), 580 states have call predecessors, (729), 724 states have return successors, (1074), 810 states have call predecessors, (1074), 726 states have call successors, (1074) [2021-12-06 17:44:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7360 states to 7360 states and 8703 transitions. [2021-12-06 17:44:18,937 INFO L78 Accepts]: Start accepts. Automaton has 7360 states and 8703 transitions. Word has length 145 [2021-12-06 17:44:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:18,937 INFO L470 AbstractCegarLoop]: Abstraction has 7360 states and 8703 transitions. [2021-12-06 17:44:18,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 17:44:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7360 states and 8703 transitions. [2021-12-06 17:44:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-06 17:44:18,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:18,943 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:18,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 17:44:19,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 17:44:19,145 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2021-12-06 17:44:19,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:19,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964584436] [2021-12-06 17:44:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:19,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:44:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 17:44:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 17:44:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 17:44:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 17:44:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:44:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 17:44:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:44:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 17:44:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 17:44:19,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:19,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964584436] [2021-12-06 17:44:19,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964584436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:19,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:44:19,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:44:19,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572666731] [2021-12-06 17:44:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:19,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:44:19,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:19,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:44:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:44:19,210 INFO L87 Difference]: Start difference. First operand 7360 states and 8703 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:19,765 INFO L93 Difference]: Finished difference Result 9977 states and 12004 transitions. [2021-12-06 17:44:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:44:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-06 17:44:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:19,778 INFO L225 Difference]: With dead ends: 9977 [2021-12-06 17:44:19,779 INFO L226 Difference]: Without dead ends: 8149 [2021-12-06 17:44:19,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:44:19,783 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 247 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:19,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 804 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:44:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8149 states. [2021-12-06 17:44:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8149 to 7363. [2021-12-06 17:44:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7363 states, 5908 states have (on average 1.1684157075152335) internal successors, (6903), 5974 states have internal predecessors, (6903), 729 states have call successors, (729), 580 states have call predecessors, (729), 724 states have return successors, (1074), 810 states have call predecessors, (1074), 726 states have call successors, (1074) [2021-12-06 17:44:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 8706 transitions. [2021-12-06 17:44:20,179 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 8706 transitions. Word has length 141 [2021-12-06 17:44:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:20,179 INFO L470 AbstractCegarLoop]: Abstraction has 7363 states and 8706 transitions. [2021-12-06 17:44:20,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:44:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 8706 transitions. [2021-12-06 17:44:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-06 17:44:20,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:20,185 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:20,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 17:44:20,185 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2021-12-06 17:44:20,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:20,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976274977] [2021-12-06 17:44:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:20,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:44:20,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:44:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:44:20,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:44:20,244 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:44:20,244 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 17:44:20,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 17:44:20,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 17:44:20,248 INFO L732 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] [2021-12-06 17:44:20,250 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:44:20,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:44:20 BoogieIcfgContainer [2021-12-06 17:44:20,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:44:20,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:44:20,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:44:20,353 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:44:20,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:43:46" (3/4) ... [2021-12-06 17:44:20,354 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 17:44:20,453 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 17:44:20,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:44:20,454 INFO L158 Benchmark]: Toolchain (without parser) took 35055.01ms. Allocated memory was 88.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 51.7MB in the beginning and 888.2MB in the end (delta: -836.5MB). Peak memory consumption was 979.2MB. Max. memory is 16.1GB. [2021-12-06 17:44:20,454 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 88.1MB. Free memory was 68.3MB in the beginning and 68.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:44:20,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.25ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 51.4MB in the beginning and 88.7MB in the end (delta: -37.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:44:20,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.94ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 85.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:20,455 INFO L158 Benchmark]: Boogie Preprocessor took 27.43ms. Allocated memory is still 117.4MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:20,455 INFO L158 Benchmark]: RCFGBuilder took 450.19ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 60.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:20,456 INFO L158 Benchmark]: TraceAbstraction took 34144.57ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 59.9MB in the beginning and 910.2MB in the end (delta: -850.2MB). Peak memory consumption was 939.7MB. Max. memory is 16.1GB. [2021-12-06 17:44:20,456 INFO L158 Benchmark]: Witness Printer took 100.60ms. Allocated memory is still 1.9GB. Free memory was 910.2MB in the beginning and 888.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-06 17:44:20,457 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.13ms. Allocated memory is still 88.1MB. Free memory was 68.3MB in the beginning and 68.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.25ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 51.4MB in the beginning and 88.7MB in the end (delta: -37.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.94ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 85.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.43ms. Allocated memory is still 117.4MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.19ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 60.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 34144.57ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 59.9MB in the beginning and 910.2MB in the end (delta: -850.2MB). Peak memory consumption was 939.7MB. Max. memory is 16.1GB. * Witness Printer took 100.60ms. Allocated memory is still 1.9GB. Free memory was 910.2MB in the beginning and 888.2MB in the end (delta: 22.0MB). 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: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 216 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15159 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14778 mSDsluCounter, 25120 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16192 mSDsCounter, 3783 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11880 IncrementalHoareTripleChecker+Invalid, 15663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3783 mSolverCounterUnsat, 8928 mSDtfsCounter, 11880 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2117 GetRequests, 1753 SyntacticMatches, 5 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14299occurred in iteration=18, InterpolantAutomatonStates: 324, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 9189 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3780 NumberOfCodeBlocks, 3780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3674 ConstructedInterpolants, 0 QuantifiedInterpolants, 7219 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3759 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 1262/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 17:44:20,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b6d71f9-4eff-4870-b1d7-5bbd388fb43d/bin/uautomizer-DrprNOufMa/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