./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 454b29c5fe5071d16700d38fede778ad07010669479cf8e19070acab5fe681c9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:56:59,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:56:59,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:56:59,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:56:59,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:56:59,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:56:59,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:56:59,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:56:59,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:56:59,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:56:59,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:56:59,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:56:59,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:56:59,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:56:59,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:56:59,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:56:59,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:56:59,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:56:59,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:56:59,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:56:59,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:56:59,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:56:59,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:56:59,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:56:59,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:56:59,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:56:59,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:56:59,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:56:59,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:56:59,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:56:59,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:56:59,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:56:59,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:56:59,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:56:59,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:56:59,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:56:59,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:56:59,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:56:59,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:56:59,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:56:59,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:56:59,350 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:56:59,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:56:59,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:56:59,369 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:56:59,369 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:56:59,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:56:59,370 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:56:59,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:56:59,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:56:59,371 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:56:59,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:56:59,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:56:59,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:56:59,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:56:59,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:56:59,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:56:59,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:56:59,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:56:59,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:56:59,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:56:59,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:56:59,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:56:59,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:56:59,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:56:59,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:56:59,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:56:59,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:56:59,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:56:59,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:56:59,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:56:59,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:56:59,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:56:59,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:56:59,381 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:56:59,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:56:59,381 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:56:59,381 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 454b29c5fe5071d16700d38fede778ad07010669479cf8e19070acab5fe681c9 [2022-12-13 13:56:59,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:56:59,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:56:59,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:56:59,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:56:59,587 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:56:59,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c [2022-12-13 13:57:02,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:57:02,575 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:57:02,575 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c [2022-12-13 13:57:02,607 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/data/82f566ed0/3e4cf1ab132445a3b036ccb6b4fb3cd7/FLAG3c9021e29 [2022-12-13 13:57:02,617 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/data/82f566ed0/3e4cf1ab132445a3b036ccb6b4fb3cd7 [2022-12-13 13:57:02,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:57:02,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:57:02,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:57:02,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:57:02,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:57:02,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:02" (1/1) ... [2022-12-13 13:57:02,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10204005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:02, skipping insertion in model container [2022-12-13 13:57:02,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:02" (1/1) ... [2022-12-13 13:57:02,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:57:02,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:57:04,144 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c[380593,380606] [2022-12-13 13:57:04,166 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c[383339,383352] [2022-12-13 13:57:04,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:57:04,289 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:57:05,077 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c[380593,380606] [2022-12-13 13:57:05,080 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-2.c[383339,383352] [2022-12-13 13:57:05,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:57:05,133 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:57:05,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05 WrapperNode [2022-12-13 13:57:05,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:57:05,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:57:05,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:57:05,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:57:05,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,449 INFO L138 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12624 [2022-12-13 13:57:05,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:57:05,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:57:05,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:57:05,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:57:05,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,738 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:57:05,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:57:05,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:57:05,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:57:05,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (1/1) ... [2022-12-13 13:57:05,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:57:05,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:05,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:57:05,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:57:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:57:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 13:57:05,847 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 13:57:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 13:57:05,848 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 13:57:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 13:57:05,848 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 13:57:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 13:57:05,848 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 13:57:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 13:57:05,848 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 13:57:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 13:57:05,848 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 13:57:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:57:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 13:57:05,849 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 13:57:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:57:05,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:57:05,933 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:57:05,935 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:57:11,374 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:57:11,396 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:57:11,396 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 13:57:11,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:11 BoogieIcfgContainer [2022-12-13 13:57:11,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:57:11,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:57:11,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:57:11,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:57:11,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:57:02" (1/3) ... [2022-12-13 13:57:11,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acba07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:11, skipping insertion in model container [2022-12-13 13:57:11,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:05" (2/3) ... [2022-12-13 13:57:11,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acba07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:11, skipping insertion in model container [2022-12-13 13:57:11,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:11" (3/3) ... [2022-12-13 13:57:11,408 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.02.cil-2.c [2022-12-13 13:57:11,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:57:11,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:57:11,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:57:11,514 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@638a87b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:57:11,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 13:57:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-13 13:57:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:57:11,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:11,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:11,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2062992276, now seen corresponding path program 1 times [2022-12-13 13:57:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:11,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701979500] [2022-12-13 13:57:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:11,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:11,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701979500] [2022-12-13 13:57:11,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701979500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:11,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:11,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:57:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819428941] [2022-12-13 13:57:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:11,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:57:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:57:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:57:11,851 INFO L87 Difference]: Start difference. First operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-12-13 13:57:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:12,703 INFO L93 Difference]: Finished difference Result 4824 states and 8887 transitions. [2022-12-13 13:57:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:57:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2022-12-13 13:57:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:12,723 INFO L225 Difference]: With dead ends: 4824 [2022-12-13 13:57:12,724 INFO L226 Difference]: Without dead ends: 2441 [2022-12-13 13:57:12,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:57:12,732 INFO L413 NwaCegarLoop]: 4168 mSDtfsCounter, 4452 mSDsluCounter, 12443 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4461 SdHoareTripleChecker+Valid, 16611 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:12,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4461 Valid, 16611 Invalid, 717 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:57:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2022-12-13 13:57:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2376. [2022-12-13 13:57:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-12-13 13:57:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4336 transitions. [2022-12-13 13:57:12,820 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4336 transitions. Word has length 69 [2022-12-13 13:57:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:12,821 INFO L495 AbstractCegarLoop]: Abstraction has 2376 states and 4336 transitions. [2022-12-13 13:57:12,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-12-13 13:57:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4336 transitions. [2022-12-13 13:57:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:57:12,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:12,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:12,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:57:12,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1960277912, now seen corresponding path program 1 times [2022-12-13 13:57:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:12,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500854266] [2022-12-13 13:57:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:12,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500854266] [2022-12-13 13:57:12,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500854266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:12,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:12,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:57:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483302251] [2022-12-13 13:57:12,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:12,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:57:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:57:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:57:12,985 INFO L87 Difference]: Start difference. First operand 2376 states and 4336 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:13,745 INFO L93 Difference]: Finished difference Result 2838 states and 5030 transitions. [2022-12-13 13:57:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:57:13,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-12-13 13:57:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:13,753 INFO L225 Difference]: With dead ends: 2838 [2022-12-13 13:57:13,754 INFO L226 Difference]: Without dead ends: 2593 [2022-12-13 13:57:13,755 INFO L412 NwaCegarLoop]: 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 [2022-12-13 13:57:13,756 INFO L413 NwaCegarLoop]: 4172 mSDtfsCounter, 4378 mSDsluCounter, 16510 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 20682 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:13,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 20682 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:57:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-12-13 13:57:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2490. [2022-12-13 13:57:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 13:57:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4502 transitions. [2022-12-13 13:57:13,806 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4502 transitions. Word has length 69 [2022-12-13 13:57:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:13,806 INFO L495 AbstractCegarLoop]: Abstraction has 2490 states and 4502 transitions. [2022-12-13 13:57:13,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4502 transitions. [2022-12-13 13:57:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:57:13,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:13,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:57:13,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -573492502, now seen corresponding path program 1 times [2022-12-13 13:57:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:13,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029793964] [2022-12-13 13:57:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:13,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:13,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029793964] [2022-12-13 13:57:13,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029793964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:13,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:13,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:57:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410022956] [2022-12-13 13:57:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:13,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:57:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:57:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:57:13,907 INFO L87 Difference]: Start difference. First operand 2490 states and 4502 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:14,662 INFO L93 Difference]: Finished difference Result 3239 states and 5624 transitions. [2022-12-13 13:57:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:57:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-12-13 13:57:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:14,674 INFO L225 Difference]: With dead ends: 3239 [2022-12-13 13:57:14,674 INFO L226 Difference]: Without dead ends: 2880 [2022-12-13 13:57:14,676 INFO L412 NwaCegarLoop]: 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 [2022-12-13 13:57:14,677 INFO L413 NwaCegarLoop]: 4103 mSDtfsCounter, 4418 mSDsluCounter, 16296 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 20399 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:14,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 20399 Invalid, 919 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:57:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2022-12-13 13:57:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2719. [2022-12-13 13:57:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2621 states have (on average 1.794734834032812) internal successors, (4704), 2628 states have internal predecessors, (4704), 62 states have call successors, (62), 31 states have call predecessors, (62), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-12-13 13:57:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4839 transitions. [2022-12-13 13:57:14,770 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4839 transitions. Word has length 69 [2022-12-13 13:57:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:14,770 INFO L495 AbstractCegarLoop]: Abstraction has 2719 states and 4839 transitions. [2022-12-13 13:57:14,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4839 transitions. [2022-12-13 13:57:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:57:14,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:14,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:14,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:57:14,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash 302526504, now seen corresponding path program 1 times [2022-12-13 13:57:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:14,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411754734] [2022-12-13 13:57:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411754734] [2022-12-13 13:57:14,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411754734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:14,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:14,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:57:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348403162] [2022-12-13 13:57:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:14,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:57:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:57:14,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:57:14,890 INFO L87 Difference]: Start difference. First operand 2719 states and 4839 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:15,607 INFO L93 Difference]: Finished difference Result 4113 states and 6915 transitions. [2022-12-13 13:57:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:57:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-12-13 13:57:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:15,616 INFO L225 Difference]: With dead ends: 4113 [2022-12-13 13:57:15,616 INFO L226 Difference]: Without dead ends: 3525 [2022-12-13 13:57:15,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:57:15,619 INFO L413 NwaCegarLoop]: 4167 mSDtfsCounter, 4388 mSDsluCounter, 16499 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:15,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4396 Valid, 20666 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:57:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-12-13 13:57:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3131. [2022-12-13 13:57:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 2965 states have (on average 1.7551433389544688) internal successors, (5204), 2976 states have internal predecessors, (5204), 102 states have call successors, (102), 55 states have call predecessors, (102), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2022-12-13 13:57:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 5441 transitions. [2022-12-13 13:57:15,720 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 5441 transitions. Word has length 69 [2022-12-13 13:57:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:15,721 INFO L495 AbstractCegarLoop]: Abstraction has 3131 states and 5441 transitions. [2022-12-13 13:57:15,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 5441 transitions. [2022-12-13 13:57:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:57:15,722 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:15,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:15,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:57:15,723 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1840866534, now seen corresponding path program 1 times [2022-12-13 13:57:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:15,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630049657] [2022-12-13 13:57:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:15,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:15,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630049657] [2022-12-13 13:57:15,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630049657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:15,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:15,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:57:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755984364] [2022-12-13 13:57:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:15,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:57:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:57:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:57:15,830 INFO L87 Difference]: Start difference. First operand 3131 states and 5441 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:16,607 INFO L93 Difference]: Finished difference Result 5511 states and 8955 transitions. [2022-12-13 13:57:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:57:16,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-12-13 13:57:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:16,622 INFO L225 Difference]: With dead ends: 5511 [2022-12-13 13:57:16,622 INFO L226 Difference]: Without dead ends: 4511 [2022-12-13 13:57:16,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:57:16,626 INFO L413 NwaCegarLoop]: 4168 mSDtfsCounter, 4390 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 20670 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:16,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 20670 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:57:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2022-12-13 13:57:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 3988. [2022-12-13 13:57:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3690 states have (on average 1.7002710027100272) internal successors, (6274), 3709 states have internal predecessors, (6274), 178 states have call successors, (178), 103 states have call predecessors, (178), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 13:57:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 6725 transitions. [2022-12-13 13:57:16,741 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 6725 transitions. Word has length 69 [2022-12-13 13:57:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:16,742 INFO L495 AbstractCegarLoop]: Abstraction has 3988 states and 6725 transitions. [2022-12-13 13:57:16,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-12-13 13:57:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 6725 transitions. [2022-12-13 13:57:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:57:16,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:16,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:16,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:57:16,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -187719576, now seen corresponding path program 1 times [2022-12-13 13:57:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364478374] [2022-12-13 13:57:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:16,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:16,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364478374] [2022-12-13 13:57:16,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364478374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:16,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:16,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:57:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704185582] [2022-12-13 13:57:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:16,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:57:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:57:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:57:16,813 INFO L87 Difference]: Start difference. First operand 3988 states and 6725 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-12-13 13:57:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:17,415 INFO L93 Difference]: Finished difference Result 7372 states and 11760 transitions. [2022-12-13 13:57:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:57:17,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2022-12-13 13:57:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:17,428 INFO L225 Difference]: With dead ends: 7372 [2022-12-13 13:57:17,428 INFO L226 Difference]: Without dead ends: 5516 [2022-12-13 13:57:17,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:57:17,433 INFO L413 NwaCegarLoop]: 4183 mSDtfsCounter, 4517 mSDsluCounter, 12269 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 16452 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:17,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 16452 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 13:57:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2022-12-13 13:57:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 4929. [2022-12-13 13:57:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4929 states, 4473 states have (on average 1.6492287055667338) internal successors, (7377), 4509 states have internal predecessors, (7377), 274 states have call successors, (274), 157 states have call predecessors, (274), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 13:57:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8048 transitions. [2022-12-13 13:57:17,575 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8048 transitions. Word has length 69 [2022-12-13 13:57:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:17,575 INFO L495 AbstractCegarLoop]: Abstraction has 4929 states and 8048 transitions. [2022-12-13 13:57:17,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-12-13 13:57:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8048 transitions. [2022-12-13 13:57:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 13:57:17,579 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:17,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:17,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:57:17,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 770021099, now seen corresponding path program 1 times [2022-12-13 13:57:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181442101] [2022-12-13 13:57:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:57:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 13:57:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 13:57:17,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:17,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181442101] [2022-12-13 13:57:17,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181442101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:17,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184231375] [2022-12-13 13:57:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:17,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:17,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:17,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:17,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:57:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:17,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:57:17,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 13:57:17,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:17,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184231375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:17,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:17,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 13:57:17,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127586775] [2022-12-13 13:57:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:17,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:17,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:17,833 INFO L87 Difference]: Start difference. First operand 4929 states and 8048 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:57:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:18,093 INFO L93 Difference]: Finished difference Result 10380 states and 16066 transitions. [2022-12-13 13:57:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:18,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2022-12-13 13:57:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:18,113 INFO L225 Difference]: With dead ends: 10380 [2022-12-13 13:57:18,113 INFO L226 Difference]: Without dead ends: 7583 [2022-12-13 13:57:18,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:18,120 INFO L413 NwaCegarLoop]: 4162 mSDtfsCounter, 4110 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4110 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:18,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4110 Valid, 4333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2022-12-13 13:57:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 7527. [2022-12-13 13:57:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7527 states, 6657 states have (on average 1.5841970857743728) internal successors, (10546), 6726 states have internal predecessors, (10546), 512 states have call successors, (512), 309 states have call predecessors, (512), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2022-12-13 13:57:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7527 states to 7527 states and 11803 transitions. [2022-12-13 13:57:18,356 INFO L78 Accepts]: Start accepts. Automaton has 7527 states and 11803 transitions. Word has length 111 [2022-12-13 13:57:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:18,356 INFO L495 AbstractCegarLoop]: Abstraction has 7527 states and 11803 transitions. [2022-12-13 13:57:18,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:57:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7527 states and 11803 transitions. [2022-12-13 13:57:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 13:57:18,364 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:18,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:18,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:57:18,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:18,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -122535733, now seen corresponding path program 1 times [2022-12-13 13:57:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:18,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986411123] [2022-12-13 13:57:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:57:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 13:57:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 13:57:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:18,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986411123] [2022-12-13 13:57:18,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986411123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:18,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995541608] [2022-12-13 13:57:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:18,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:18,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:18,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:57:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:18,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:57:18,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 13:57:18,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:18,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995541608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:18,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:18,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93000985] [2022-12-13 13:57:18,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:18,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:18,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:18,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:18,782 INFO L87 Difference]: Start difference. First operand 7527 states and 11803 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-12-13 13:57:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:19,202 INFO L93 Difference]: Finished difference Result 17935 states and 27159 transitions. [2022-12-13 13:57:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 111 [2022-12-13 13:57:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:19,259 INFO L225 Difference]: With dead ends: 17935 [2022-12-13 13:57:19,259 INFO L226 Difference]: Without dead ends: 12541 [2022-12-13 13:57:19,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:19,275 INFO L413 NwaCegarLoop]: 4311 mSDtfsCounter, 154 mSDsluCounter, 4150 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 8461 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:19,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 8461 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12541 states. [2022-12-13 13:57:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12541 to 12541. [2022-12-13 13:57:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12541 states, 10858 states have (on average 1.5209983422361393) internal successors, (16515), 10976 states have internal predecessors, (16515), 977 states have call successors, (977), 609 states have call predecessors, (977), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2022-12-13 13:57:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12541 states to 12541 states and 19088 transitions. [2022-12-13 13:57:19,929 INFO L78 Accepts]: Start accepts. Automaton has 12541 states and 19088 transitions. Word has length 111 [2022-12-13 13:57:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:19,929 INFO L495 AbstractCegarLoop]: Abstraction has 12541 states and 19088 transitions. [2022-12-13 13:57:19,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-12-13 13:57:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 12541 states and 19088 transitions. [2022-12-13 13:57:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 13:57:19,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:19,946 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 13:57:19,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:57:20,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:20,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:20,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:20,147 INFO L85 PathProgramCache]: Analyzing trace with hash 327119452, now seen corresponding path program 1 times [2022-12-13 13:57:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:20,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228790003] [2022-12-13 13:57:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:20,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:57:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 13:57:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 13:57:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 13:57:20,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:20,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228790003] [2022-12-13 13:57:20,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228790003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:20,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169625670] [2022-12-13 13:57:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:20,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:20,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:20,250 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:20,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:57:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:20,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:57:20,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 13:57:20,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:20,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169625670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:20,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:20,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 13:57:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468255608] [2022-12-13 13:57:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:20,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:20,430 INFO L87 Difference]: Start difference. First operand 12541 states and 19088 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2022-12-13 13:57:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:21,186 INFO L93 Difference]: Finished difference Result 32917 states and 49009 transitions. [2022-12-13 13:57:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:21,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2022-12-13 13:57:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:21,235 INFO L225 Difference]: With dead ends: 32917 [2022-12-13 13:57:21,236 INFO L226 Difference]: Without dead ends: 22513 [2022-12-13 13:57:21,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:21,258 INFO L413 NwaCegarLoop]: 4183 mSDtfsCounter, 4068 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4068 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:21,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4068 Valid, 4354 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22513 states. [2022-12-13 13:57:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22513 to 22301. [2022-12-13 13:57:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22301 states, 19038 states have (on average 1.4810904506775922) internal successors, (28197), 19270 states have internal predecessors, (28197), 1871 states have call successors, (1871), 1199 states have call predecessors, (1871), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2022-12-13 13:57:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22301 states to 22301 states and 33106 transitions. [2022-12-13 13:57:22,208 INFO L78 Accepts]: Start accepts. Automaton has 22301 states and 33106 transitions. Word has length 143 [2022-12-13 13:57:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:22,208 INFO L495 AbstractCegarLoop]: Abstraction has 22301 states and 33106 transitions. [2022-12-13 13:57:22,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2022-12-13 13:57:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 22301 states and 33106 transitions. [2022-12-13 13:57:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 13:57:22,239 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:22,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-12-13 13:57:22,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:57:22,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 13:57:22,440 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:22,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 382011958, now seen corresponding path program 1 times [2022-12-13 13:57:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:22,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273078011] [2022-12-13 13:57:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 13:57:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 13:57:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 13:57:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 13:57:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 13:57:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:22,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273078011] [2022-12-13 13:57:22,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273078011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:22,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640188492] [2022-12-13 13:57:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:22,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:22,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:22,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:57:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:22,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:57:22,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:57:22,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:22,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640188492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:22,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:22,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408282972] [2022-12-13 13:57:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:22,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:22,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:22,708 INFO L87 Difference]: Start difference. First operand 22301 states and 33106 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:57:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:23,654 INFO L93 Difference]: Finished difference Result 44821 states and 66508 transitions. [2022-12-13 13:57:23,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:23,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-12-13 13:57:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:23,706 INFO L225 Difference]: With dead ends: 44821 [2022-12-13 13:57:23,707 INFO L226 Difference]: Without dead ends: 24655 [2022-12-13 13:57:23,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:23,740 INFO L413 NwaCegarLoop]: 4149 mSDtfsCounter, 4087 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:23,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4087 Valid, 4183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24655 states. [2022-12-13 13:57:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24655 to 24655. [2022-12-13 13:57:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24655 states, 21180 states have (on average 1.4241265344664777) internal successors, (30163), 21412 states have internal predecessors, (30163), 1925 states have call successors, (1925), 1357 states have call predecessors, (1925), 1548 states have return successors, (3106), 1917 states have call predecessors, (3106), 1923 states have call successors, (3106) [2022-12-13 13:57:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24655 states to 24655 states and 35194 transitions. [2022-12-13 13:57:24,975 INFO L78 Accepts]: Start accepts. Automaton has 24655 states and 35194 transitions. Word has length 160 [2022-12-13 13:57:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:24,976 INFO L495 AbstractCegarLoop]: Abstraction has 24655 states and 35194 transitions. [2022-12-13 13:57:24,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:57:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24655 states and 35194 transitions. [2022-12-13 13:57:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 13:57:25,016 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:25,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 13:57:25,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:57:25,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 13:57:25,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:25,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 228383827, now seen corresponding path program 1 times [2022-12-13 13:57:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:25,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958463338] [2022-12-13 13:57:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 13:57:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 13:57:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 13:57:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 13:57:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 13:57:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:25,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958463338] [2022-12-13 13:57:25,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958463338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:25,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316022040] [2022-12-13 13:57:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:25,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:25,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:25,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:57:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:25,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:57:25,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-13 13:57:25,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:25,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316022040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:25,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:25,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137333064] [2022-12-13 13:57:25,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:25,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:25,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:25,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:25,476 INFO L87 Difference]: Start difference. First operand 24655 states and 35194 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 13:57:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:26,463 INFO L93 Difference]: Finished difference Result 41688 states and 58732 transitions. [2022-12-13 13:57:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2022-12-13 13:57:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:26,556 INFO L225 Difference]: With dead ends: 41688 [2022-12-13 13:57:26,557 INFO L226 Difference]: Without dead ends: 26195 [2022-12-13 13:57:26,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:26,582 INFO L413 NwaCegarLoop]: 4171 mSDtfsCounter, 4088 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4088 SdHoareTripleChecker+Valid, 4349 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:26,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4088 Valid, 4349 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26195 states. [2022-12-13 13:57:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26195 to 26055. [2022-12-13 13:57:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26055 states, 22468 states have (on average 1.3989229125867901) internal successors, (31431), 22700 states have internal predecessors, (31431), 1945 states have call successors, (1945), 1449 states have call predecessors, (1945), 1640 states have return successors, (3218), 1937 states have call predecessors, (3218), 1943 states have call successors, (3218) [2022-12-13 13:57:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26055 states to 26055 states and 36594 transitions. [2022-12-13 13:57:27,689 INFO L78 Accepts]: Start accepts. Automaton has 26055 states and 36594 transitions. Word has length 160 [2022-12-13 13:57:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:27,689 INFO L495 AbstractCegarLoop]: Abstraction has 26055 states and 36594 transitions. [2022-12-13 13:57:27,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 13:57:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 26055 states and 36594 transitions. [2022-12-13 13:57:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:57:27,715 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:27,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-12-13 13:57:27,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:57:27,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:27,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1570525413, now seen corresponding path program 1 times [2022-12-13 13:57:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:27,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703691296] [2022-12-13 13:57:27,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:27,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:57:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 13:57:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 13:57:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:57:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 13:57:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:28,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703691296] [2022-12-13 13:57:28,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703691296] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:28,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517767855] [2022-12-13 13:57:28,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:28,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:28,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:28,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:57:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:28,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:57:28,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 13:57:28,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:28,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517767855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:28,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:28,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119229514] [2022-12-13 13:57:28,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:28,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:28,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:28,197 INFO L87 Difference]: Start difference. First operand 26055 states and 36594 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:57:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:30,419 INFO L93 Difference]: Finished difference Result 72665 states and 101108 transitions. [2022-12-13 13:57:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-12-13 13:57:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:30,521 INFO L225 Difference]: With dead ends: 72665 [2022-12-13 13:57:30,521 INFO L226 Difference]: Without dead ends: 48749 [2022-12-13 13:57:30,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:30,562 INFO L413 NwaCegarLoop]: 4320 mSDtfsCounter, 163 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 8467 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:30,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 8467 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48749 states. [2022-12-13 13:57:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48749 to 48705. [2022-12-13 13:57:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48705 states, 41704 states have (on average 1.3657442931133703) internal successors, (56957), 42166 states have internal predecessors, (56957), 3775 states have call successors, (3775), 2841 states have call predecessors, (3775), 3224 states have return successors, (7134), 3761 states have call predecessors, (7134), 3773 states have call successors, (7134) [2022-12-13 13:57:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48705 states to 48705 states and 67866 transitions. [2022-12-13 13:57:32,918 INFO L78 Accepts]: Start accepts. Automaton has 48705 states and 67866 transitions. Word has length 161 [2022-12-13 13:57:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:32,918 INFO L495 AbstractCegarLoop]: Abstraction has 48705 states and 67866 transitions. [2022-12-13 13:57:32,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:57:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48705 states and 67866 transitions. [2022-12-13 13:57:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:57:32,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:32,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:32,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:57:33,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 13:57:33,194 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash -948353227, now seen corresponding path program 1 times [2022-12-13 13:57:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:33,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216245798] [2022-12-13 13:57:33,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:57:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 13:57:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:57:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:57:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 13:57:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:33,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216245798] [2022-12-13 13:57:33,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216245798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:33,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242410977] [2022-12-13 13:57:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:33,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:33,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:33,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:57:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:33,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:57:33,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 13:57:33,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:33,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242410977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:33,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:33,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117479030] [2022-12-13 13:57:33,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:33,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:33,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:33,528 INFO L87 Difference]: Start difference. First operand 48705 states and 67866 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:57:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:35,694 INFO L93 Difference]: Finished difference Result 79069 states and 111521 transitions. [2022-12-13 13:57:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:35,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 161 [2022-12-13 13:57:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:35,794 INFO L225 Difference]: With dead ends: 79069 [2022-12-13 13:57:35,794 INFO L226 Difference]: Without dead ends: 41521 [2022-12-13 13:57:35,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:35,843 INFO L413 NwaCegarLoop]: 4148 mSDtfsCounter, 4082 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:35,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4082 Valid, 4181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41521 states. [2022-12-13 13:57:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41521 to 30305. [2022-12-13 13:57:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30305 states, 26128 states have (on average 1.3429654011022658) internal successors, (35089), 26370 states have internal predecessors, (35089), 2255 states have call successors, (2255), 1729 states have call predecessors, (2255), 1920 states have return successors, (3778), 2237 states have call predecessors, (3778), 2253 states have call successors, (3778) [2022-12-13 13:57:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30305 states to 30305 states and 41122 transitions. [2022-12-13 13:57:37,492 INFO L78 Accepts]: Start accepts. Automaton has 30305 states and 41122 transitions. Word has length 161 [2022-12-13 13:57:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:37,492 INFO L495 AbstractCegarLoop]: Abstraction has 30305 states and 41122 transitions. [2022-12-13 13:57:37,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:57:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 30305 states and 41122 transitions. [2022-12-13 13:57:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:57:37,518 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:37,518 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 13:57:37,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 13:57:37,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:37,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash -192882952, now seen corresponding path program 1 times [2022-12-13 13:57:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478978291] [2022-12-13 13:57:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:57:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 13:57:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:57:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:57:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 13:57:37,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:37,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478978291] [2022-12-13 13:57:37,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478978291] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:37,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358305510] [2022-12-13 13:57:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:37,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:37,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:57:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:57:37,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 13:57:37,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:37,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358305510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:37,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:37,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:37,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536065458] [2022-12-13 13:57:37,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:37,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:37,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:37,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:37,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:37,945 INFO L87 Difference]: Start difference. First operand 30305 states and 41122 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:57:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:40,661 INFO L93 Difference]: Finished difference Result 82213 states and 110894 transitions. [2022-12-13 13:57:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-12-13 13:57:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:40,800 INFO L225 Difference]: With dead ends: 82213 [2022-12-13 13:57:40,800 INFO L226 Difference]: Without dead ends: 54057 [2022-12-13 13:57:40,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:40,848 INFO L413 NwaCegarLoop]: 4314 mSDtfsCounter, 150 mSDsluCounter, 4144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 8458 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:40,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 8458 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54057 states. [2022-12-13 13:57:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54057 to 54053. [2022-12-13 13:57:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54053 states, 46184 states have (on average 1.3125974363415902) internal successors, (60621), 46666 states have internal predecessors, (60621), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 13:57:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54053 states to 54053 states and 73088 transitions. [2022-12-13 13:57:43,756 INFO L78 Accepts]: Start accepts. Automaton has 54053 states and 73088 transitions. Word has length 161 [2022-12-13 13:57:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:43,756 INFO L495 AbstractCegarLoop]: Abstraction has 54053 states and 73088 transitions. [2022-12-13 13:57:43,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:57:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 54053 states and 73088 transitions. [2022-12-13 13:57:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:57:43,801 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:43,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:43,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:57:44,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:57:44,005 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:44,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:44,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1491732838, now seen corresponding path program 1 times [2022-12-13 13:57:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:44,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334603299] [2022-12-13 13:57:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 13:57:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:57:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 13:57:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:57:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-13 13:57:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334603299] [2022-12-13 13:57:44,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334603299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465828647] [2022-12-13 13:57:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:44,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:44,127 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:44,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:57:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:44,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:57:44,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 13:57:44,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:44,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465828647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:44,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:44,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:44,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757157654] [2022-12-13 13:57:44,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:44,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:44,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:44,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:44,235 INFO L87 Difference]: Start difference. First operand 54053 states and 73088 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 13:57:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:46,817 INFO L93 Difference]: Finished difference Result 95015 states and 127828 transitions. [2022-12-13 13:57:46,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:46,818 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 13:57:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:46,940 INFO L225 Difference]: With dead ends: 95015 [2022-12-13 13:57:46,940 INFO L226 Difference]: Without dead ends: 54897 [2022-12-13 13:57:46,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:46,995 INFO L413 NwaCegarLoop]: 4186 mSDtfsCounter, 4108 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4108 SdHoareTripleChecker+Valid, 4357 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:46,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4108 Valid, 4357 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54897 states. [2022-12-13 13:57:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54897 to 54053. [2022-12-13 13:57:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54053 states, 46184 states have (on average 1.3048025290143772) internal successors, (60261), 46666 states have internal predecessors, (60261), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 13:57:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54053 states to 54053 states and 72728 transitions. [2022-12-13 13:57:50,197 INFO L78 Accepts]: Start accepts. Automaton has 54053 states and 72728 transitions. Word has length 161 [2022-12-13 13:57:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:50,198 INFO L495 AbstractCegarLoop]: Abstraction has 54053 states and 72728 transitions. [2022-12-13 13:57:50,198 INFO L496 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 13:57:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 54053 states and 72728 transitions. [2022-12-13 13:57:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:57:50,242 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:50,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-12-13 13:57:50,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:57:50,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:50,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash -251057197, now seen corresponding path program 1 times [2022-12-13 13:57:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:50,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220188914] [2022-12-13 13:57:50,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 13:57:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:57:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:57:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:57:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 13:57:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:50,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220188914] [2022-12-13 13:57:50,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220188914] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:50,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345775231] [2022-12-13 13:57:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:50,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:50,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:50,598 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:50,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:57:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:50,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:57:50,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 13:57:50,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:57:50,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345775231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:50,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:57:50,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:57:50,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526057840] [2022-12-13 13:57:50,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:50,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:57:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:50,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:57:50,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:50,717 INFO L87 Difference]: Start difference. First operand 54053 states and 72728 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 13:57:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:53,374 INFO L93 Difference]: Finished difference Result 94725 states and 126938 transitions. [2022-12-13 13:57:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 13:57:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:53,495 INFO L225 Difference]: With dead ends: 94725 [2022-12-13 13:57:53,496 INFO L226 Difference]: Without dead ends: 55449 [2022-12-13 13:57:53,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:53,548 INFO L413 NwaCegarLoop]: 4200 mSDtfsCounter, 4107 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:53,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 4373 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55449 states. [2022-12-13 13:57:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55449 to 53933. [2022-12-13 13:57:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53933 states, 46064 states have (on average 1.2977813476901703) internal successors, (59781), 46546 states have internal predecessors, (59781), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 13:57:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53933 states to 53933 states and 72248 transitions. [2022-12-13 13:57:56,435 INFO L78 Accepts]: Start accepts. Automaton has 53933 states and 72248 transitions. Word has length 161 [2022-12-13 13:57:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:56,435 INFO L495 AbstractCegarLoop]: Abstraction has 53933 states and 72248 transitions. [2022-12-13 13:57:56,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 13:57:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 53933 states and 72248 transitions. [2022-12-13 13:57:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:57:56,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:56,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:56,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:57:56,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 13:57:56,749 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2084105626, now seen corresponding path program 1 times [2022-12-13 13:57:56,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:56,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224538682] [2022-12-13 13:57:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:56,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:57:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:57:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:57:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:57:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:57:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 13:57:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:57:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 13:57:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:57:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:57:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 13:57:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:56,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224538682] [2022-12-13 13:57:56,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224538682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:56,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:56,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:57:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950814569] [2022-12-13 13:57:56,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:56,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:57:56,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:57:56,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:57:56,847 INFO L87 Difference]: Start difference. First operand 53933 states and 72248 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:57:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:59,850 INFO L93 Difference]: Finished difference Result 103313 states and 136251 transitions. [2022-12-13 13:57:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:57:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 13:57:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:59,961 INFO L225 Difference]: With dead ends: 103313 [2022-12-13 13:57:59,961 INFO L226 Difference]: Without dead ends: 51525 [2022-12-13 13:58:00,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:00,021 INFO L413 NwaCegarLoop]: 4087 mSDtfsCounter, 304 mSDsluCounter, 12019 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 16106 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:00,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 16106 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:58:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51525 states. [2022-12-13 13:58:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51525 to 48807. [2022-12-13 13:58:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48807 states, 42022 states have (on average 1.3009138070534483) internal successors, (54667), 42916 states have internal predecessors, (54667), 3255 states have call successors, (3255), 2473 states have call predecessors, (3255), 3528 states have return successors, (6773), 3449 states have call predecessors, (6773), 3253 states have call successors, (6773) [2022-12-13 13:58:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48807 states to 48807 states and 64695 transitions. [2022-12-13 13:58:03,009 INFO L78 Accepts]: Start accepts. Automaton has 48807 states and 64695 transitions. Word has length 161 [2022-12-13 13:58:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:03,009 INFO L495 AbstractCegarLoop]: Abstraction has 48807 states and 64695 transitions. [2022-12-13 13:58:03,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:58:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 48807 states and 64695 transitions. [2022-12-13 13:58:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:58:03,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:03,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-12-13 13:58:03,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:58:03,041 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 641108433, now seen corresponding path program 1 times [2022-12-13 13:58:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094975550] [2022-12-13 13:58:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 13:58:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:58:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:58:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:58:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 13:58:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094975550] [2022-12-13 13:58:03,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094975550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:03,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:58:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:58:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136988474] [2022-12-13 13:58:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:03,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:58:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:58:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:58:03,100 INFO L87 Difference]: Start difference. First operand 48807 states and 64695 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:58:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:05,890 INFO L93 Difference]: Finished difference Result 86589 states and 113654 transitions. [2022-12-13 13:58:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:58:05,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 13:58:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:05,976 INFO L225 Difference]: With dead ends: 86589 [2022-12-13 13:58:05,976 INFO L226 Difference]: Without dead ends: 39919 [2022-12-13 13:58:06,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:06,039 INFO L413 NwaCegarLoop]: 4086 mSDtfsCounter, 304 mSDsluCounter, 12018 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 16104 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:06,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 16104 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:58:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39919 states. [2022-12-13 13:58:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39919 to 37269. [2022-12-13 13:58:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37269 states, 32230 states have (on average 1.3190505739993794) internal successors, (42513), 32868 states have internal predecessors, (42513), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2022-12-13 13:58:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37269 states to 37269 states and 49741 transitions. [2022-12-13 13:58:08,429 INFO L78 Accepts]: Start accepts. Automaton has 37269 states and 49741 transitions. Word has length 161 [2022-12-13 13:58:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:08,429 INFO L495 AbstractCegarLoop]: Abstraction has 37269 states and 49741 transitions. [2022-12-13 13:58:08,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:58:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 37269 states and 49741 transitions. [2022-12-13 13:58:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 13:58:08,506 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:08,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 13:58:08,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:58:08,506 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash -22034244, now seen corresponding path program 1 times [2022-12-13 13:58:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:08,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762109609] [2022-12-13 13:58:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:58:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 13:58:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 13:58:08,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:08,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762109609] [2022-12-13 13:58:08,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762109609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:08,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974841723] [2022-12-13 13:58:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:08,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:08,599 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:08,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:58:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:08,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:58:08,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 13:58:08,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:08,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974841723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:08,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:08,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:58:08,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499277549] [2022-12-13 13:58:08,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:08,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:58:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:08,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:58:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:08,709 INFO L87 Difference]: Start difference. First operand 37269 states and 49741 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:58:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:10,845 INFO L93 Difference]: Finished difference Result 61331 states and 83325 transitions. [2022-12-13 13:58:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:58:10,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 13:58:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:10,924 INFO L225 Difference]: With dead ends: 61331 [2022-12-13 13:58:10,924 INFO L226 Difference]: Without dead ends: 37441 [2022-12-13 13:58:11,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:11,015 INFO L413 NwaCegarLoop]: 4252 mSDtfsCounter, 142 mSDsluCounter, 4127 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 8379 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:11,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 8379 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:58:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37441 states. [2022-12-13 13:58:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37441 to 37269. [2022-12-13 13:58:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37269 states, 32230 states have (on average 1.2976419484951909) internal successors, (41823), 32868 states have internal predecessors, (41823), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2022-12-13 13:58:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37269 states to 37269 states and 49051 transitions. [2022-12-13 13:58:13,342 INFO L78 Accepts]: Start accepts. Automaton has 37269 states and 49051 transitions. Word has length 163 [2022-12-13 13:58:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:13,342 INFO L495 AbstractCegarLoop]: Abstraction has 37269 states and 49051 transitions. [2022-12-13 13:58:13,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:58:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 37269 states and 49051 transitions. [2022-12-13 13:58:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 13:58:13,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:13,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-12-13 13:58:13,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 13:58:13,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:13,564 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1309860060, now seen corresponding path program 1 times [2022-12-13 13:58:13,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:13,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256281742] [2022-12-13 13:58:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:13,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:58:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 13:58:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 13:58:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:13,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256281742] [2022-12-13 13:58:13,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256281742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:13,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846127217] [2022-12-13 13:58:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:13,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:13,696 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:13,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:58:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:13,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:58:13,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 13:58:13,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:13,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846127217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:13,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:13,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:58:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341474712] [2022-12-13 13:58:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:13,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:58:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:58:13,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:13,790 INFO L87 Difference]: Start difference. First operand 37269 states and 49051 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2022-12-13 13:58:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:15,708 INFO L93 Difference]: Finished difference Result 64497 states and 85583 transitions. [2022-12-13 13:58:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:58:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 163 [2022-12-13 13:58:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:15,775 INFO L225 Difference]: With dead ends: 64497 [2022-12-13 13:58:15,775 INFO L226 Difference]: Without dead ends: 31829 [2022-12-13 13:58:15,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:15,829 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 4122 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4122 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:15,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4122 Valid, 4179 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:58:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31829 states. [2022-12-13 13:58:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31829 to 30585. [2022-12-13 13:58:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30585 states, 26586 states have (on average 1.274467764989092) internal successors, (33883), 27081 states have internal predecessors, (33883), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 13:58:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30585 states to 30585 states and 39353 transitions. [2022-12-13 13:58:17,819 INFO L78 Accepts]: Start accepts. Automaton has 30585 states and 39353 transitions. Word has length 163 [2022-12-13 13:58:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:17,819 INFO L495 AbstractCegarLoop]: Abstraction has 30585 states and 39353 transitions. [2022-12-13 13:58:17,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2022-12-13 13:58:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 30585 states and 39353 transitions. [2022-12-13 13:58:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 13:58:17,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:17,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-12-13 13:58:17,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 13:58:18,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:18,036 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1003109181, now seen corresponding path program 1 times [2022-12-13 13:58:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:18,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446527015] [2022-12-13 13:58:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 13:58:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 13:58:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 13:58:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446527015] [2022-12-13 13:58:18,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446527015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478757297] [2022-12-13 13:58:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:18,143 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:18,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:58:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:18,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:58:18,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 13:58:18,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:18,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478757297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:18,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:18,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:58:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045954224] [2022-12-13 13:58:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:18,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:58:18,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:18,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:58:18,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:18,252 INFO L87 Difference]: Start difference. First operand 30585 states and 39353 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:58:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:20,166 INFO L93 Difference]: Finished difference Result 50905 states and 66323 transitions. [2022-12-13 13:58:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:58:20,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 13:58:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:20,226 INFO L225 Difference]: With dead ends: 50905 [2022-12-13 13:58:20,226 INFO L226 Difference]: Without dead ends: 30725 [2022-12-13 13:58:20,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:20,259 INFO L413 NwaCegarLoop]: 4295 mSDtfsCounter, 135 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8421 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:20,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8421 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:58:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2022-12-13 13:58:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 30585. [2022-12-13 13:58:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30585 states, 26586 states have (on average 1.2492665312570526) internal successors, (33213), 27081 states have internal predecessors, (33213), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 13:58:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30585 states to 30585 states and 38683 transitions. [2022-12-13 13:58:22,259 INFO L78 Accepts]: Start accepts. Automaton has 30585 states and 38683 transitions. Word has length 163 [2022-12-13 13:58:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:22,259 INFO L495 AbstractCegarLoop]: Abstraction has 30585 states and 38683 transitions. [2022-12-13 13:58:22,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:58:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 30585 states and 38683 transitions. [2022-12-13 13:58:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 13:58:22,274 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:22,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-12-13 13:58:22,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 13:58:22,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:22,476 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1504083699, now seen corresponding path program 1 times [2022-12-13 13:58:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:22,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570131381] [2022-12-13 13:58:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:58:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-12-13 13:58:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 13:58:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570131381] [2022-12-13 13:58:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570131381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853973878] [2022-12-13 13:58:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:22,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:22,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:22,602 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:22,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 13:58:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:22,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:58:22,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 13:58:22,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:22,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853973878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:22,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:22,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:58:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442097652] [2022-12-13 13:58:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:22,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:58:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:58:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:22,686 INFO L87 Difference]: Start difference. First operand 30585 states and 38683 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2022-12-13 13:58:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:24,571 INFO L93 Difference]: Finished difference Result 44454 states and 56755 transitions. [2022-12-13 13:58:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:58:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 164 [2022-12-13 13:58:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:24,623 INFO L225 Difference]: With dead ends: 44454 [2022-12-13 13:58:24,624 INFO L226 Difference]: Without dead ends: 30633 [2022-12-13 13:58:24,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:58:24,648 INFO L413 NwaCegarLoop]: 4275 mSDtfsCounter, 156 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 8393 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:24,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 8393 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:58:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30633 states. [2022-12-13 13:58:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30633 to 30585. [2022-12-13 13:58:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30585 states, 26586 states have (on average 1.2397126307078914) internal successors, (32959), 27081 states have internal predecessors, (32959), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 13:58:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30585 states to 30585 states and 38429 transitions. [2022-12-13 13:58:26,665 INFO L78 Accepts]: Start accepts. Automaton has 30585 states and 38429 transitions. Word has length 164 [2022-12-13 13:58:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:26,665 INFO L495 AbstractCegarLoop]: Abstraction has 30585 states and 38429 transitions. [2022-12-13 13:58:26,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2022-12-13 13:58:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 30585 states and 38429 transitions. [2022-12-13 13:58:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:58:26,680 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:26,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-12-13 13:58:26,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 13:58:26,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:26,881 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash -465623340, now seen corresponding path program 1 times [2022-12-13 13:58:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:26,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949706849] [2022-12-13 13:58:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:58:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:27,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:58:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 13:58:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:27,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949706849] [2022-12-13 13:58:27,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949706849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:27,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678055391] [2022-12-13 13:58:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:27,006 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:27,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 13:58:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:27,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:58:27,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 13:58:27,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:27,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678055391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:27,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:27,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 13:58:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245954931] [2022-12-13 13:58:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:27,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:58:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:58:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:58:27,149 INFO L87 Difference]: Start difference. First operand 30585 states and 38429 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-12-13 13:58:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:28,759 INFO L93 Difference]: Finished difference Result 41137 states and 51548 transitions. [2022-12-13 13:58:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:58:28,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2022-12-13 13:58:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:28,799 INFO L225 Difference]: With dead ends: 41137 [2022-12-13 13:58:28,799 INFO L226 Difference]: Without dead ends: 22531 [2022-12-13 13:58:28,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:58:28,826 INFO L413 NwaCegarLoop]: 4077 mSDtfsCounter, 4145 mSDsluCounter, 8103 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 12180 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:28,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 12180 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:58:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22531 states. [2022-12-13 13:58:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22531 to 22471. [2022-12-13 13:58:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22471 states, 19632 states have (on average 1.2434290953545233) internal successors, (24411), 19960 states have internal predecessors, (24411), 1389 states have call successors, (1389), 1057 states have call predecessors, (1389), 1448 states have return successors, (2451), 1457 states have call predecessors, (2451), 1387 states have call successors, (2451) [2022-12-13 13:58:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22471 states to 22471 states and 28251 transitions. [2022-12-13 13:58:30,350 INFO L78 Accepts]: Start accepts. Automaton has 22471 states and 28251 transitions. Word has length 165 [2022-12-13 13:58:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:30,351 INFO L495 AbstractCegarLoop]: Abstraction has 22471 states and 28251 transitions. [2022-12-13 13:58:30,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-12-13 13:58:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 22471 states and 28251 transitions. [2022-12-13 13:58:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:58:30,358 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:30,358 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-12-13 13:58:30,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:30,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 13:58:30,560 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:30,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash 22423766, now seen corresponding path program 1 times [2022-12-13 13:58:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:30,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492650986] [2022-12-13 13:58:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:58:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:58:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 13:58:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:30,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492650986] [2022-12-13 13:58:30,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492650986] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:30,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534389402] [2022-12-13 13:58:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:30,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:30,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:30,695 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:30,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 13:58:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:30,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:58:30,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-12-13 13:58:30,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:30,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534389402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:30,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:30,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 13:58:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546274582] [2022-12-13 13:58:30,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:30,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:58:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:58:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:58:30,813 INFO L87 Difference]: Start difference. First operand 22471 states and 28251 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2022-12-13 13:58:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:32,292 INFO L93 Difference]: Finished difference Result 36580 states and 45544 transitions. [2022-12-13 13:58:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:58:32,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 165 [2022-12-13 13:58:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:32,316 INFO L225 Difference]: With dead ends: 36580 [2022-12-13 13:58:32,316 INFO L226 Difference]: Without dead ends: 16241 [2022-12-13 13:58:32,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:58:32,335 INFO L413 NwaCegarLoop]: 4137 mSDtfsCounter, 87 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 16572 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 [2022-12-13 13:58:32,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 16572 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:58:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16241 states. [2022-12-13 13:58:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16241 to 15449. [2022-12-13 13:58:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15449 states, 13501 states have (on average 1.2605732908673433) internal successors, (17019), 13712 states have internal predecessors, (17019), 958 states have call successors, (958), 737 states have call predecessors, (958), 988 states have return successors, (1535), 1001 states have call predecessors, (1535), 956 states have call successors, (1535) [2022-12-13 13:58:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15449 states to 15449 states and 19512 transitions. [2022-12-13 13:58:33,356 INFO L78 Accepts]: Start accepts. Automaton has 15449 states and 19512 transitions. Word has length 165 [2022-12-13 13:58:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:33,357 INFO L495 AbstractCegarLoop]: Abstraction has 15449 states and 19512 transitions. [2022-12-13 13:58:33,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2022-12-13 13:58:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15449 states and 19512 transitions. [2022-12-13 13:58:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:58:33,361 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:33,361 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:33,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 13:58:33,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 13:58:33,563 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1805871025, now seen corresponding path program 1 times [2022-12-13 13:58:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:33,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748169200] [2022-12-13 13:58:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 13:58:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:58:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 13:58:33,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:33,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748169200] [2022-12-13 13:58:33,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748169200] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:33,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372901963] [2022-12-13 13:58:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:33,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:33,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:33,667 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:33,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:58:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:33,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:58:33,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 13:58:33,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:33,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372901963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:33,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:33,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 13:58:33,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814121859] [2022-12-13 13:58:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:33,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:58:33,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:33,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:58:33,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:58:33,773 INFO L87 Difference]: Start difference. First operand 15449 states and 19512 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-12-13 13:58:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:34,674 INFO L93 Difference]: Finished difference Result 26714 states and 33036 transitions. [2022-12-13 13:58:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:58:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 165 [2022-12-13 13:58:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:34,696 INFO L225 Difference]: With dead ends: 26714 [2022-12-13 13:58:34,696 INFO L226 Difference]: Without dead ends: 13397 [2022-12-13 13:58:34,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:58:34,713 INFO L413 NwaCegarLoop]: 4136 mSDtfsCounter, 49 mSDsluCounter, 12422 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16558 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 [2022-12-13 13:58:34,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 16558 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:58:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13397 states. [2022-12-13 13:58:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13397 to 13101. [2022-12-13 13:58:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13101 states, 11462 states have (on average 1.265834932821497) internal successors, (14509), 11623 states have internal predecessors, (14509), 815 states have call successors, (815), 621 states have call predecessors, (815), 822 states have return successors, (1201), 858 states have call predecessors, (1201), 813 states have call successors, (1201) [2022-12-13 13:58:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13101 states to 13101 states and 16525 transitions. [2022-12-13 13:58:35,602 INFO L78 Accepts]: Start accepts. Automaton has 13101 states and 16525 transitions. Word has length 165 [2022-12-13 13:58:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:35,602 INFO L495 AbstractCegarLoop]: Abstraction has 13101 states and 16525 transitions. [2022-12-13 13:58:35,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-12-13 13:58:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13101 states and 16525 transitions. [2022-12-13 13:58:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:58:35,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:35,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:35,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 13:58:35,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 13:58:35,807 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:35,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1637482603, now seen corresponding path program 1 times [2022-12-13 13:58:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:35,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637937242] [2022-12-13 13:58:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:58:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:58:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 13:58:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:58:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-13 13:58:35,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:35,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637937242] [2022-12-13 13:58:35,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637937242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:35,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649373025] [2022-12-13 13:58:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:35,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:35,911 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:35,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:58:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:35,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:58:35,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 13:58:36,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:36,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649373025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:36,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:36,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 13:58:36,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122760374] [2022-12-13 13:58:36,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:36,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:58:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:36,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:58:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:58:36,020 INFO L87 Difference]: Start difference. First operand 13101 states and 16525 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2022-12-13 13:58:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:36,494 INFO L93 Difference]: Finished difference Result 18414 states and 22680 transitions. [2022-12-13 13:58:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:58:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 165 [2022-12-13 13:58:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:36,502 INFO L225 Difference]: With dead ends: 18414 [2022-12-13 13:58:36,502 INFO L226 Difference]: Without dead ends: 5409 [2022-12-13 13:58:36,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:58:36,513 INFO L413 NwaCegarLoop]: 4136 mSDtfsCounter, 10 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16543 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 [2022-12-13 13:58:36,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16543 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:58:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2022-12-13 13:58:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5409. [2022-12-13 13:58:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 4913 states have (on average 1.431915326684307) internal successors, (7035), 4936 states have internal predecessors, (7035), 278 states have call successors, (278), 201 states have call predecessors, (278), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 13:58:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7614 transitions. [2022-12-13 13:58:36,772 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7614 transitions. Word has length 165 [2022-12-13 13:58:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:36,773 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7614 transitions. [2022-12-13 13:58:36,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2022-12-13 13:58:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7614 transitions. [2022-12-13 13:58:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-13 13:58:36,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:36,776 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:36,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:36,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 13:58:36,977 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1365063130, now seen corresponding path program 1 times [2022-12-13 13:58:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:36,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896132328] [2022-12-13 13:58:36,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:36,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 13:58:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 13:58:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 13:58:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 13:58:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 13:58:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-13 13:58:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:37,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896132328] [2022-12-13 13:58:37,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896132328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:37,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:58:37,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:58:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825979986] [2022-12-13 13:58:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:37,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:58:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:37,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:58:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:58:37,163 INFO L87 Difference]: Start difference. First operand 5409 states and 7614 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 13:58:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:38,200 INFO L93 Difference]: Finished difference Result 5627 states and 7839 transitions. [2022-12-13 13:58:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:58:38,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-12-13 13:58:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:38,208 INFO L225 Difference]: With dead ends: 5627 [2022-12-13 13:58:38,208 INFO L226 Difference]: Without dead ends: 5624 [2022-12-13 13:58:38,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:58:38,210 INFO L413 NwaCegarLoop]: 4181 mSDtfsCounter, 4658 mSDsluCounter, 16403 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 20584 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:38,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 20584 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:58:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2022-12-13 13:58:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 5408. [2022-12-13 13:58:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5408 states, 4913 states have (on average 1.4311011601872583) internal successors, (7031), 4935 states have internal predecessors, (7031), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 13:58:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 7609 transitions. [2022-12-13 13:58:38,496 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 7609 transitions. Word has length 203 [2022-12-13 13:58:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:38,497 INFO L495 AbstractCegarLoop]: Abstraction has 5408 states and 7609 transitions. [2022-12-13 13:58:38,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 13:58:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 7609 transitions. [2022-12-13 13:58:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-13 13:58:38,499 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:38,500 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:38,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 13:58:38,500 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash -575528242, now seen corresponding path program 1 times [2022-12-13 13:58:38,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:38,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266047490] [2022-12-13 13:58:38,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:38,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:58:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:58:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:58:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:58:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:58:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 13:58:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 13:58:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 13:58:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 13:58:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:58:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 13:58:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-12-13 13:58:38,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:38,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266047490] [2022-12-13 13:58:38,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266047490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:38,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:58:38,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:58:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183502088] [2022-12-13 13:58:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:38,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:58:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:38,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:58:38,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:58:38,574 INFO L87 Difference]: Start difference. First operand 5408 states and 7609 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:58:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:39,304 INFO L93 Difference]: Finished difference Result 7451 states and 9980 transitions. [2022-12-13 13:58:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:58:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-12-13 13:58:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:39,313 INFO L225 Difference]: With dead ends: 7451 [2022-12-13 13:58:39,313 INFO L226 Difference]: Without dead ends: 6072 [2022-12-13 13:58:39,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:58:39,316 INFO L413 NwaCegarLoop]: 4155 mSDtfsCounter, 199 mSDsluCounter, 12202 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 16357 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:39,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 16357 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:58:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2022-12-13 13:58:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 5412. [2022-12-13 13:58:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 4917 states have (on average 1.4307504575960952) internal successors, (7035), 4939 states have internal predecessors, (7035), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 13:58:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 7613 transitions. [2022-12-13 13:58:39,605 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 7613 transitions. Word has length 207 [2022-12-13 13:58:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:39,605 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 7613 transitions. [2022-12-13 13:58:39,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:58:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 7613 transitions. [2022-12-13 13:58:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-13 13:58:39,608 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:39,608 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:39,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 13:58:39,608 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:39,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash 567683991, now seen corresponding path program 1 times [2022-12-13 13:58:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:39,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920056370] [2022-12-13 13:58:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:39,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:39,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:39,677 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:58:39,678 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 13:58:39,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 13:58:39,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 13:58:39,681 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:39,684 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:58:39,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:58:39 BoogieIcfgContainer [2022-12-13 13:58:39,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:58:39,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:58:39,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:58:39,773 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:58:39,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:11" (3/4) ... [2022-12-13 13:58:39,775 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:58:39,851 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:58:39,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:58:39,852 INFO L158 Benchmark]: Toolchain (without parser) took 97231.63ms. Allocated memory was 136.3MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 62.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-12-13 13:58:39,852 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:58:39,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2511.81ms. Allocated memory was 136.3MB in the beginning and 224.4MB in the end (delta: 88.1MB). Free memory was 62.0MB in the beginning and 124.3MB in the end (delta: -62.4MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2022-12-13 13:58:39,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 316.14ms. Allocated memory is still 224.4MB. Free memory was 124.3MB in the beginning and 80.6MB in the end (delta: 43.7MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2022-12-13 13:58:39,853 INFO L158 Benchmark]: Boogie Preprocessor took 342.87ms. Allocated memory is still 224.4MB. Free memory was 80.6MB in the beginning and 63.5MB in the end (delta: 17.1MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2022-12-13 13:58:39,853 INFO L158 Benchmark]: RCFGBuilder took 5607.10ms. Allocated memory was 224.4MB in the beginning and 574.6MB in the end (delta: 350.2MB). Free memory was 63.5MB in the beginning and 309.6MB in the end (delta: -246.1MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. [2022-12-13 13:58:39,853 INFO L158 Benchmark]: TraceAbstraction took 88369.84ms. Allocated memory was 574.6MB in the beginning and 4.8GB in the end (delta: 4.3GB). Free memory was 309.6MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-12-13 13:58:39,853 INFO L158 Benchmark]: Witness Printer took 78.87ms. Allocated memory is still 4.8GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 13:58:39,854 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 136.3MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2511.81ms. Allocated memory was 136.3MB in the beginning and 224.4MB in the end (delta: 88.1MB). Free memory was 62.0MB in the beginning and 124.3MB in the end (delta: -62.4MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 316.14ms. Allocated memory is still 224.4MB. Free memory was 124.3MB in the beginning and 80.6MB in the end (delta: 43.7MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 342.87ms. Allocated memory is still 224.4MB. Free memory was 80.6MB in the beginning and 63.5MB in the end (delta: 17.1MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * RCFGBuilder took 5607.10ms. Allocated memory was 224.4MB in the beginning and 574.6MB in the end (delta: 350.2MB). Free memory was 63.5MB in the beginning and 309.6MB in the end (delta: -246.1MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. * TraceAbstraction took 88369.84ms. Allocated memory was 574.6MB in the beginning and 4.8GB in the end (delta: 4.3GB). Free memory was 309.6MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 78.87ms. Allocated memory is still 4.8GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND TRUE t2_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET transmit2() [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11449] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11214] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11220] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11462] RET master() [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11278] token += 1 [L11279] E_2 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND FALSE !(t2_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11314] token += 1 [L11315] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET transmit2() [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1, token=2] [L11449] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11449] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1, token=2] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11206] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11228] COND FALSE !(token != local + 2) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11242] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 11094]: 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 8 procedures, 2323 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 88.2s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 42.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70130 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69971 mSDsluCounter, 331372 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214303 mSDsCounter, 611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7190 IncrementalHoareTripleChecker+Invalid, 7801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 611 mSolverCounterUnsat, 117069 mSDtfsCounter, 7190 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3579 GetRequests, 3352 SyntacticMatches, 6 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54053occurred in iteration=14, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 24861 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 6960 NumberOfCodeBlocks, 6960 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6706 ConstructedInterpolants, 0 QuantifiedInterpolants, 10861 SizeOfPredicates, 9 NumberOfNonLiveVariables, 9564 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 3368/3904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:58:39,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ba01b46-93a3-43da-9214-2963480d01e3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE