./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro --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 b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- 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-8393723 [2022-11-18 20:54:45,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:54:45,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:54:45,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:54:45,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:54:45,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:54:45,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:54:45,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:54:45,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:54:45,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:54:45,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:54:45,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:54:45,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:54:45,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:54:45,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:54:45,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:54:45,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:54:45,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:54:45,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:54:45,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:54:45,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:54:45,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:54:45,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:54:45,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:54:45,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:54:45,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:54:45,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:54:45,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:54:45,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:54:45,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:54:45,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:54:45,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:54:45,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:54:45,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:54:45,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:54:45,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:54:45,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:54:45,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:54:45,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:54:45,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:54:45,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:54:45,397 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:54:45,445 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:54:45,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:54:45,446 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:54:45,446 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:54:45,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:54:45,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:54:45,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:54:45,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:54:45,449 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:54:45,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:54:45,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:54:45,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:54:45,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:54:45,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:54:45,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:54:45,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:54:45,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:54:45,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:54:45,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:54:45,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:54:45,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:54:45,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:54:45,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:54:45,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:54:45,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:54:45,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:54:45,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:54:45,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:54:45,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:54:45,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:54:45,458 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:54:45,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:54:45,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:54:45,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/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_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro 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 -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2022-11-18 20:54:45,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:54:45,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:54:45,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:54:45,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:54:45,866 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:54:45,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-11-18 20:54:45,959 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/data/f48148d89/f27ce57d71c0417bba921b1e1132e6c3/FLAG3bba75b93 [2022-11-18 20:54:47,221 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:54:47,222 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-11-18 20:54:47,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/data/f48148d89/f27ce57d71c0417bba921b1e1132e6c3/FLAG3bba75b93 [2022-11-18 20:54:47,404 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/data/f48148d89/f27ce57d71c0417bba921b1e1132e6c3 [2022-11-18 20:54:47,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:54:47,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:54:47,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:54:47,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:54:47,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:54:47,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:54:47" (1/1) ... [2022-11-18 20:54:47,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc077a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:47, skipping insertion in model container [2022-11-18 20:54:47,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:54:47" (1/1) ... [2022-11-18 20:54:47,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:54:47,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:54:50,593 WARN L234 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_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-11-18 20:54:50,619 WARN L234 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_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-11-18 20:54:50,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:54:50,804 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:54:52,439 WARN L234 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_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-11-18 20:54:52,445 WARN L234 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_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-11-18 20:54:52,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:54:52,548 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:54:52,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52 WrapperNode [2022-11-18 20:54:52,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:54:52,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:54:52,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:54:52,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:54:52,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:52,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,088 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-11-18 20:54:53,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:54:53,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:54:53,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:54:53,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:54:53,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,739 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:54:53,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:54:53,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:54:53,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:54:53,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (1/1) ... [2022-11-18 20:54:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:54:53,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:54:53,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:54:53,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:54:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:54:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-18 20:54:54,034 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-18 20:54:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-18 20:54:54,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-18 20:54:54,035 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-18 20:54:54,035 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-18 20:54:54,035 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-18 20:54:54,036 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-18 20:54:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-18 20:54:54,036 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-18 20:54:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-18 20:54:54,037 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-18 20:54:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:54:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-18 20:54:54,037 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-18 20:54:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:54:54,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:54:54,217 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:54:54,220 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:55:04,788 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:55:04,825 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:55:04,825 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-18 20:55:04,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:04 BoogieIcfgContainer [2022-11-18 20:55:04,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:55:04,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:55:04,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:55:04,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:55:04,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:54:47" (1/3) ... [2022-11-18 20:55:04,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708c3065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:55:04, skipping insertion in model container [2022-11-18 20:55:04,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:52" (2/3) ... [2022-11-18 20:55:04,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708c3065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:55:04, skipping insertion in model container [2022-11-18 20:55:04,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:04" (3/3) ... [2022-11-18 20:55:04,925 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.c [2022-11-18 20:55:04,947 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:55:04,947 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:55:05,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:55:05,111 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;@205ee7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:55:05,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-18 20:55:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-18 20:55:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:55:05,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:05,144 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] [2022-11-18 20:55:05,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2022-11-18 20:55:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:05,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377354646] [2022-11-18 20:55:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:05,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:05,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:05,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377354646] [2022-11-18 20:55:05,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377354646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:05,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:05,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:55:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565666921] [2022-11-18 20:55:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:05,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:55:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:05,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:55:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:55:05,764 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:06,906 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2022-11-18 20:55:06,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:55:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-18 20:55:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:06,939 INFO L225 Difference]: With dead ends: 4727 [2022-11-18 20:55:06,939 INFO L226 Difference]: Without dead ends: 2368 [2022-11-18 20:55:06,948 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-11-18 20:55:06,952 INFO L413 NwaCegarLoop]: 4146 mSDtfsCounter, 4337 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4345 SdHoareTripleChecker+Valid, 16526 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:06,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4345 Valid, 16526 Invalid, 539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:55:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-11-18 20:55:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2022-11-18 20:55:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-18 20:55:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2022-11-18 20:55:07,154 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2022-11-18 20:55:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:07,155 INFO L495 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2022-11-18 20:55:07,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2022-11-18 20:55:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:55:07,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:07,168 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] [2022-11-18 20:55:07,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:55:07,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:07,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2022-11-18 20:55:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:07,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199910937] [2022-11-18 20:55:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:07,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:07,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199910937] [2022-11-18 20:55:07,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199910937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:07,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:07,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:55:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319808276] [2022-11-18 20:55:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:07,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:55:07,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:55:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:55:07,450 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:08,518 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2022-11-18 20:55:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:55:08,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-18 20:55:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:08,531 INFO L225 Difference]: With dead ends: 2676 [2022-11-18 20:55:08,531 INFO L226 Difference]: Without dead ends: 2481 [2022-11-18 20:55:08,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:55:08,535 INFO L413 NwaCegarLoop]: 4136 mSDtfsCounter, 4257 mSDsluCounter, 16382 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 20518 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:08,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 20518 Invalid, 758 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:55:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2022-11-18 20:55:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2022-11-18 20:55:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-18 20:55:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2022-11-18 20:55:08,628 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2022-11-18 20:55:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:08,629 INFO L495 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2022-11-18 20:55:08,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2022-11-18 20:55:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:55:08,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:08,631 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] [2022-11-18 20:55:08,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:55:08,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2022-11-18 20:55:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:08,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310120835] [2022-11-18 20:55:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:08,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:08,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310120835] [2022-11-18 20:55:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310120835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:08,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:08,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:55:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968645655] [2022-11-18 20:55:08,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:55:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:55:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:55:08,789 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:09,863 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions. [2022-11-18 20:55:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:55:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-18 20:55:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:09,877 INFO L225 Difference]: With dead ends: 3027 [2022-11-18 20:55:09,878 INFO L226 Difference]: Without dead ends: 2742 [2022-11-18 20:55:09,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:55:09,889 INFO L413 NwaCegarLoop]: 4132 mSDtfsCounter, 4312 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4322 SdHoareTripleChecker+Valid, 20506 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:09,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4322 Valid, 20506 Invalid, 754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:55:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-11-18 20:55:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590. [2022-11-18 20:55:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-18 20:55:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions. [2022-11-18 20:55:10,026 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58 [2022-11-18 20:55:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:10,026 INFO L495 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions. [2022-11-18 20:55:10,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions. [2022-11-18 20:55:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:55:10,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:10,029 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] [2022-11-18 20:55:10,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:55:10,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2022-11-18 20:55:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:10,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119567906] [2022-11-18 20:55:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:10,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:10,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:10,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119567906] [2022-11-18 20:55:10,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119567906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:10,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:10,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:55:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618498010] [2022-11-18 20:55:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:10,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:55:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:55:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:55:10,400 INFO L87 Difference]: Start difference. First operand 2590 states and 4630 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:11,589 INFO L93 Difference]: Finished difference Result 3579 states and 6048 transitions. [2022-11-18 20:55:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:55:11,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-18 20:55:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:11,612 INFO L225 Difference]: With dead ends: 3579 [2022-11-18 20:55:11,616 INFO L226 Difference]: Without dead ends: 3119 [2022-11-18 20:55:11,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:55:11,631 INFO L413 NwaCegarLoop]: 4124 mSDtfsCounter, 4252 mSDsluCounter, 16356 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 20480 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:11,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 20480 Invalid, 803 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:55:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2022-11-18 20:55:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2889. [2022-11-18 20:55:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2740 states have (on average 1.7682481751824817) internal successors, (4845), 2751 states have internal predecessors, (4845), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-11-18 20:55:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5052 transitions. [2022-11-18 20:55:11,835 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5052 transitions. Word has length 58 [2022-11-18 20:55:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:11,845 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 5052 transitions. [2022-11-18 20:55:11,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5052 transitions. [2022-11-18 20:55:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:55:11,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:11,851 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] [2022-11-18 20:55:11,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:55:11,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2022-11-18 20:55:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:11,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234643662] [2022-11-18 20:55:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:12,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:12,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:12,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234643662] [2022-11-18 20:55:12,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234643662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:12,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:12,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:55:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224539919] [2022-11-18 20:55:12,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:12,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:55:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:55:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:55:12,046 INFO L87 Difference]: Start difference. First operand 2889 states and 5052 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:13,152 INFO L93 Difference]: Finished difference Result 4253 states and 6998 transitions. [2022-11-18 20:55:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:55:13,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-18 20:55:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:13,182 INFO L225 Difference]: With dead ends: 4253 [2022-11-18 20:55:13,182 INFO L226 Difference]: Without dead ends: 3495 [2022-11-18 20:55:13,187 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-11-18 20:55:13,190 INFO L413 NwaCegarLoop]: 4141 mSDtfsCounter, 4370 mSDsluCounter, 12183 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4393 SdHoareTripleChecker+Valid, 16324 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:13,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4393 Valid, 16324 Invalid, 623 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:55:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-11-18 20:55:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3290. [2022-11-18 20:55:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3058 states have (on average 1.723675604970569) internal successors, (5271), 3078 states have internal predecessors, (5271), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-18 20:55:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5586 transitions. [2022-11-18 20:55:13,482 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5586 transitions. Word has length 58 [2022-11-18 20:55:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:13,483 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 5586 transitions. [2022-11-18 20:55:13,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:55:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5586 transitions. [2022-11-18 20:55:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-18 20:55:13,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:13,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:13,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:55:13,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:13,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2022-11-18 20:55:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:13,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547291554] [2022-11-18 20:55:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:55:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:55:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-18 20:55:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:13,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547291554] [2022-11-18 20:55:13,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547291554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:13,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222858039] [2022-11-18 20:55:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:13,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:13,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:13,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:55:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:13,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:55:13,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:55:13,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222858039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:13,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:13,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-18 20:55:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076106249] [2022-11-18 20:55:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:13,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:13,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:13,904 INFO L87 Difference]: Start difference. First operand 3290 states and 5586 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:55:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:14,190 INFO L93 Difference]: Finished difference Result 5496 states and 8712 transitions. [2022-11-18 20:55:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-11-18 20:55:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:14,217 INFO L225 Difference]: With dead ends: 5496 [2022-11-18 20:55:14,217 INFO L226 Difference]: Without dead ends: 4338 [2022-11-18 20:55:14,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:14,225 INFO L413 NwaCegarLoop]: 4229 mSDtfsCounter, 114 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 8337 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-11-18 20:55:14,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 8337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2022-11-18 20:55:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2022-11-18 20:55:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3897 states have (on average 1.6440851937387735) internal successors, (6407), 3930 states have internal predecessors, (6407), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2022-11-18 20:55:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7038 transitions. [2022-11-18 20:55:14,579 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7038 transitions. Word has length 93 [2022-11-18 20:55:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:14,580 INFO L495 AbstractCegarLoop]: Abstraction has 4338 states and 7038 transitions. [2022-11-18 20:55:14,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:55:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7038 transitions. [2022-11-18 20:55:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-18 20:55:14,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:14,589 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:55:14,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:55:14,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:55:14,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:14,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2022-11-18 20:55:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:14,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123416742] [2022-11-18 20:55:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:14,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:14,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:55:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:15,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-18 20:55:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:55:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-18 20:55:15,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:15,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123416742] [2022-11-18 20:55:15,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123416742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:15,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173867377] [2022-11-18 20:55:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:15,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:15,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:15,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:15,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:55:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:15,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:55:15,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:55:15,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:15,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173867377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:15,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:15,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-18 20:55:15,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800393620] [2022-11-18 20:55:15,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:15,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:15,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:15,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:15,348 INFO L87 Difference]: Start difference. First operand 4338 states and 7038 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-18 20:55:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:15,645 INFO L93 Difference]: Finished difference Result 8608 states and 13011 transitions. [2022-11-18 20:55:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-11-18 20:55:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:15,682 INFO L225 Difference]: With dead ends: 8608 [2022-11-18 20:55:15,682 INFO L226 Difference]: Without dead ends: 6405 [2022-11-18 20:55:15,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:15,693 INFO L413 NwaCegarLoop]: 4141 mSDtfsCounter, 4038 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4273 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-11-18 20:55:15,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4038 Valid, 4273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2022-11-18 20:55:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6345. [2022-11-18 20:55:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 5510 states have (on average 1.561705989110708) internal successors, (8605), 5572 states have internal predecessors, (8605), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2022-11-18 20:55:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 9768 transitions. [2022-11-18 20:55:16,060 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 9768 transitions. Word has length 119 [2022-11-18 20:55:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:16,061 INFO L495 AbstractCegarLoop]: Abstraction has 6345 states and 9768 transitions. [2022-11-18 20:55:16,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-18 20:55:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 9768 transitions. [2022-11-18 20:55:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-18 20:55:16,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:16,076 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, 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-11-18 20:55:16,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:16,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 20:55:16,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:16,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2022-11-18 20:55:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:16,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246821416] [2022-11-18 20:55:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:55:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:55:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-18 20:55:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-18 20:55:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-18 20:55:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:16,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246821416] [2022-11-18 20:55:16,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246821416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:16,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337610398] [2022-11-18 20:55:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:16,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:16,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:16,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:16,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:55:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:55:16,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-18 20:55:16,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:16,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337610398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:16,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:16,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-18 20:55:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834152401] [2022-11-18 20:55:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:16,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:16,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:16,673 INFO L87 Difference]: Start difference. First operand 6345 states and 9768 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-18 20:55:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:17,177 INFO L93 Difference]: Finished difference Result 9619 states and 14299 transitions. [2022-11-18 20:55:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 135 [2022-11-18 20:55:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:17,205 INFO L225 Difference]: With dead ends: 9619 [2022-11-18 20:55:17,205 INFO L226 Difference]: Without dead ends: 6673 [2022-11-18 20:55:17,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:17,216 INFO L413 NwaCegarLoop]: 4132 mSDtfsCounter, 4059 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4272 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-11-18 20:55:17,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 4272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2022-11-18 20:55:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6635. [2022-11-18 20:55:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 5768 states have (on average 1.535887656033287) internal successors, (8859), 5830 states have internal predecessors, (8859), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-11-18 20:55:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 10060 transitions. [2022-11-18 20:55:17,592 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 10060 transitions. Word has length 135 [2022-11-18 20:55:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:17,593 INFO L495 AbstractCegarLoop]: Abstraction has 6635 states and 10060 transitions. [2022-11-18 20:55:17,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-18 20:55:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 10060 transitions. [2022-11-18 20:55:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-18 20:55:17,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:17,607 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, 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-11-18 20:55:17,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:17,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:17,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2022-11-18 20:55:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:17,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099275529] [2022-11-18 20:55:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:55:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:55:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:18,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099275529] [2022-11-18 20:55:18,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099275529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:18,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211781455] [2022-11-18 20:55:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:18,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:18,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:18,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:55:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:18,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:55:18,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:55:18,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:18,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211781455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:18,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:18,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-18 20:55:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350415721] [2022-11-18 20:55:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:18,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:18,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:18,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:18,207 INFO L87 Difference]: Start difference. First operand 6635 states and 10060 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-18 20:55:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:18,553 INFO L93 Difference]: Finished difference Result 9031 states and 13439 transitions. [2022-11-18 20:55:18,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:18,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 136 [2022-11-18 20:55:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:18,584 INFO L225 Difference]: With dead ends: 9031 [2022-11-18 20:55:18,584 INFO L226 Difference]: Without dead ends: 6671 [2022-11-18 20:55:18,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:18,597 INFO L413 NwaCegarLoop]: 4217 mSDtfsCounter, 111 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8316 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-11-18 20:55:18,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8316 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2022-11-18 20:55:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6611. [2022-11-18 20:55:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6611 states, 5744 states have (on average 1.5217618384401115) internal successors, (8741), 5806 states have internal predecessors, (8741), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-11-18 20:55:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 9942 transitions. [2022-11-18 20:55:18,979 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 9942 transitions. Word has length 136 [2022-11-18 20:55:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:18,981 INFO L495 AbstractCegarLoop]: Abstraction has 6611 states and 9942 transitions. [2022-11-18 20:55:18,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-18 20:55:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 9942 transitions. [2022-11-18 20:55:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-18 20:55:18,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:18,995 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:19,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:19,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:19,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2022-11-18 20:55:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:19,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259993629] [2022-11-18 20:55:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:55:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:55:19,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:19,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259993629] [2022-11-18 20:55:19,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259993629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:19,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718773302] [2022-11-18 20:55:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:19,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:19,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:19,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:55:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:19,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:55:19,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:55:19,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:19,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718773302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:19,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:19,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-18 20:55:19,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452629906] [2022-11-18 20:55:19,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:19,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:19,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:19,597 INFO L87 Difference]: Start difference. First operand 6611 states and 9942 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-18 20:55:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:20,047 INFO L93 Difference]: Finished difference Result 9935 states and 14498 transitions. [2022-11-18 20:55:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:20,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2022-11-18 20:55:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:20,071 INFO L225 Difference]: With dead ends: 9935 [2022-11-18 20:55:20,071 INFO L226 Difference]: Without dead ends: 5993 [2022-11-18 20:55:20,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:55:20,086 INFO L413 NwaCegarLoop]: 4112 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4136 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-11-18 20:55:20,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2022-11-18 20:55:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5763. [2022-11-18 20:55:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5763 states, 5062 states have (on average 1.5205452390359542) internal successors, (7697), 5108 states have internal predecessors, (7697), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2022-11-18 20:55:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 8600 transitions. [2022-11-18 20:55:20,427 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 8600 transitions. Word has length 136 [2022-11-18 20:55:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:20,427 INFO L495 AbstractCegarLoop]: Abstraction has 5763 states and 8600 transitions. [2022-11-18 20:55:20,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-18 20:55:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 8600 transitions. [2022-11-18 20:55:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:55:20,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:20,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:20,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:20,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:20,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2022-11-18 20:55:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661284542] [2022-11-18 20:55:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:55:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:55:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:20,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661284542] [2022-11-18 20:55:20,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661284542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:20,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260217406] [2022-11-18 20:55:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:20,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:20,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:20,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:20,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:55:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:20,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:55:20,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-18 20:55:21,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:21,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260217406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:21,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:21,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-18 20:55:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076466275] [2022-11-18 20:55:21,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:21,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:55:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:55:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:55:21,153 INFO L87 Difference]: Start difference. First operand 5763 states and 8600 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-18 20:55:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:21,584 INFO L93 Difference]: Finished difference Result 7191 states and 10479 transitions. [2022-11-18 20:55:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:55:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-18 20:55:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:21,600 INFO L225 Difference]: With dead ends: 7191 [2022-11-18 20:55:21,600 INFO L226 Difference]: Without dead ends: 4833 [2022-11-18 20:55:21,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:55:21,609 INFO L413 NwaCegarLoop]: 4058 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12129 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:21,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4115 Valid, 12129 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:55:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2022-11-18 20:55:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4821. [2022-11-18 20:55:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 4302 states have (on average 1.5488145048814506) internal successors, (6663), 4330 states have internal predecessors, (6663), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-11-18 20:55:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7314 transitions. [2022-11-18 20:55:21,905 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7314 transitions. Word has length 137 [2022-11-18 20:55:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:21,905 INFO L495 AbstractCegarLoop]: Abstraction has 4821 states and 7314 transitions. [2022-11-18 20:55:21,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-18 20:55:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7314 transitions. [2022-11-18 20:55:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:55:21,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:21,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:21,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:22,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:22,118 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:22,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2022-11-18 20:55:22,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:22,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481063794] [2022-11-18 20:55:22,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:22,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:55:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:55:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:22,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481063794] [2022-11-18 20:55:22,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481063794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:22,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618187051] [2022-11-18 20:55:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:22,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:22,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:22,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:55:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:22,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:55:22,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-18 20:55:22,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618187051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:22,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:22,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-18 20:55:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484774602] [2022-11-18 20:55:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:22,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:55:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:55:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:55:22,583 INFO L87 Difference]: Start difference. First operand 4821 states and 7314 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-18 20:55:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:23,307 INFO L93 Difference]: Finished difference Result 7162 states and 10301 transitions. [2022-11-18 20:55:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:55:23,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-18 20:55:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:23,324 INFO L225 Difference]: With dead ends: 7162 [2022-11-18 20:55:23,324 INFO L226 Difference]: Without dead ends: 4769 [2022-11-18 20:55:23,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:55:23,335 INFO L413 NwaCegarLoop]: 4057 mSDtfsCounter, 4129 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4137 SdHoareTripleChecker+Valid, 12123 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:23,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4137 Valid, 12123 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:55:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2022-11-18 20:55:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3795. [2022-11-18 20:55:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-11-18 20:55:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2022-11-18 20:55:23,656 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2022-11-18 20:55:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:23,656 INFO L495 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2022-11-18 20:55:23,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-18 20:55:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2022-11-18 20:55:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:55:23,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:23,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:23,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:23,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:55:23,869 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2022-11-18 20:55:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:23,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807679643] [2022-11-18 20:55:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:23,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:23,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:55:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:55:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:24,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807679643] [2022-11-18 20:55:24,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807679643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:24,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048941986] [2022-11-18 20:55:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:24,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:24,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:24,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:24,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:55:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:55:24,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-18 20:55:24,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:24,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048941986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:24,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:24,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-18 20:55:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702748116] [2022-11-18 20:55:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:24,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:55:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:55:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:55:24,308 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-11-18 20:55:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:24,729 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2022-11-18 20:55:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:55:24,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-18 20:55:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:24,740 INFO L225 Difference]: With dead ends: 4934 [2022-11-18 20:55:24,740 INFO L226 Difference]: Without dead ends: 3270 [2022-11-18 20:55:24,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 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-11-18 20:55:24,747 INFO L413 NwaCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:24,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-11-18 20:55:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2022-11-18 20:55:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-18 20:55:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2022-11-18 20:55:24,998 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2022-11-18 20:55:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:24,998 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2022-11-18 20:55:24,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-11-18 20:55:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2022-11-18 20:55:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:55:25,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:25,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:55:25,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:25,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:55:25,210 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2022-11-18 20:55:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:25,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129305116] [2022-11-18 20:55:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:55:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-18 20:55:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:25,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129305116] [2022-11-18 20:55:25,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129305116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:25,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802678769] [2022-11-18 20:55:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:25,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:25,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:25,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:55:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:25,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:55:25,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 20:55:25,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:25,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802678769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:25,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:55:25,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-18 20:55:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356281553] [2022-11-18 20:55:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:25,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:55:25,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:25,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:55:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:55:25,595 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:55:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:25,868 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2022-11-18 20:55:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:55:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-18 20:55:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:25,879 INFO L225 Difference]: With dead ends: 4365 [2022-11-18 20:55:25,879 INFO L226 Difference]: Without dead ends: 3262 [2022-11-18 20:55:25,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 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-11-18 20:55:25,885 INFO L413 NwaCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 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-11-18 20:55:25,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-11-18 20:55:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2022-11-18 20:55:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-18 20:55:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2022-11-18 20:55:26,088 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2022-11-18 20:55:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:26,088 INFO L495 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2022-11-18 20:55:26,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:55:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2022-11-18 20:55:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:55:26,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:26,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:26,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:26,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:55:26,299 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2022-11-18 20:55:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:26,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070357128] [2022-11-18 20:55:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:26,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:55:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-18 20:55:26,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:26,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070357128] [2022-11-18 20:55:26,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070357128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:26,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:26,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:55:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114749395] [2022-11-18 20:55:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:26,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:55:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:26,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:55:26,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:55:26,482 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-18 20:55:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:27,473 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2022-11-18 20:55:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:55:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-11-18 20:55:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:27,487 INFO L225 Difference]: With dead ends: 4206 [2022-11-18 20:55:27,487 INFO L226 Difference]: Without dead ends: 4203 [2022-11-18 20:55:27,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:55:27,492 INFO L413 NwaCegarLoop]: 4124 mSDtfsCounter, 4454 mSDsluCounter, 12174 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 16298 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:27,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 16298 Invalid, 470 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [81 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:55:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2022-11-18 20:55:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2022-11-18 20:55:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-18 20:55:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2022-11-18 20:55:27,734 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2022-11-18 20:55:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:27,735 INFO L495 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2022-11-18 20:55:27,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-18 20:55:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2022-11-18 20:55:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-18 20:55:27,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:27,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:27,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:55:27,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2022-11-18 20:55:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817162926] [2022-11-18 20:55:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:27,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:55:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:55:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:55:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:55:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:55:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:55:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:55:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:55:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:55:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:55:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-18 20:55:27,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:27,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817162926] [2022-11-18 20:55:27,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817162926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:27,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:27,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:55:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104502657] [2022-11-18 20:55:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:55:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:55:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:55:27,862 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:55:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:28,400 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2022-11-18 20:55:28,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:55:28,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-11-18 20:55:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:28,413 INFO L225 Difference]: With dead ends: 4845 [2022-11-18 20:55:28,413 INFO L226 Difference]: Without dead ends: 3985 [2022-11-18 20:55:28,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:55:28,417 INFO L413 NwaCegarLoop]: 4124 mSDtfsCounter, 144 mSDsluCounter, 12149 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 16273 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:28,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 16273 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:55:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2022-11-18 20:55:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2022-11-18 20:55:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-18 20:55:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2022-11-18 20:55:28,660 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2022-11-18 20:55:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:28,661 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2022-11-18 20:55:28,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:55:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2022-11-18 20:55:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-18 20:55:28,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:28,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:55:28,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:55:28,666 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:55:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2022-11-18 20:55:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:28,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257190009] [2022-11-18 20:55:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:55:28,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:55:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:55:28,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:55:28,772 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:55:28,774 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-18 20:55:28,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-18 20:55:28,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:55:28,780 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:55:28,789 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:55:28,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:55:28 BoogieIcfgContainer [2022-11-18 20:55:28,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:55:28,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:55:28,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:55:28,958 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:55:28,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:04" (3/4) ... [2022-11-18 20:55:28,961 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:55:29,057 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:55:29,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:55:29,058 INFO L158 Benchmark]: Toolchain (without parser) took 41648.00ms. Allocated memory was 111.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 50.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 780.0MB. Max. memory is 16.1GB. [2022-11-18 20:55:29,058 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 111.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:55:29,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 5136.32ms. Allocated memory was 111.1MB in the beginning and 241.2MB in the end (delta: 130.0MB). Free memory was 50.9MB in the beginning and 142.1MB in the end (delta: -91.1MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2022-11-18 20:55:29,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 539.07ms. Allocated memory is still 241.2MB. Free memory was 142.1MB in the beginning and 104.1MB in the end (delta: 37.9MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2022-11-18 20:55:29,059 INFO L158 Benchmark]: Boogie Preprocessor took 741.39ms. Allocated memory was 241.2MB in the beginning and 459.3MB in the end (delta: 218.1MB). Free memory was 104.1MB in the beginning and 308.1MB in the end (delta: -203.9MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2022-11-18 20:55:29,060 INFO L158 Benchmark]: RCFGBuilder took 10998.45ms. Allocated memory was 459.3MB in the beginning and 864.0MB in the end (delta: 404.8MB). Free memory was 308.1MB in the beginning and 218.6MB in the end (delta: 89.4MB). Peak memory consumption was 492.1MB. Max. memory is 16.1GB. [2022-11-18 20:55:29,060 INFO L158 Benchmark]: TraceAbstraction took 24053.78ms. Allocated memory was 864.0MB in the beginning and 2.1GB in the end (delta: 1.3GB). Free memory was 689.4MB in the beginning and 1.3GB in the end (delta: -615.2MB). Peak memory consumption was 651.5MB. Max. memory is 16.1GB. [2022-11-18 20:55:29,061 INFO L158 Benchmark]: Witness Printer took 99.71ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-18 20:55:29,063 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.36ms. Allocated memory is still 111.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 5136.32ms. Allocated memory was 111.1MB in the beginning and 241.2MB in the end (delta: 130.0MB). Free memory was 50.9MB in the beginning and 142.1MB in the end (delta: -91.1MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 539.07ms. Allocated memory is still 241.2MB. Free memory was 142.1MB in the beginning and 104.1MB in the end (delta: 37.9MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 741.39ms. Allocated memory was 241.2MB in the beginning and 459.3MB in the end (delta: 218.1MB). Free memory was 104.1MB in the beginning and 308.1MB in the end (delta: -203.9MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * RCFGBuilder took 10998.45ms. Allocated memory was 459.3MB in the beginning and 864.0MB in the end (delta: 404.8MB). Free memory was 308.1MB in the beginning and 218.6MB in the end (delta: 89.4MB). Peak memory consumption was 492.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24053.78ms. Allocated memory was 864.0MB in the beginning and 2.1GB in the end (delta: 1.3GB). Free memory was 689.4MB in the beginning and 1.3GB in the end (delta: -615.2MB). Peak memory consumption was 651.5MB. Max. memory is 16.1GB. * Witness Printer took 99.71ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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: [L11179] int m_st ; [L45] int a12 = 4; [L44] int a15 = 1; [L11184] int T1_E = 2; [L43] int a16 = 1; [L11192] int local ; [L11178] int t1_pc = 0; [L11182] int t1_i ; [L11183] int M_E = 2; [L11185] int E_M = 2; [L11181] int m_i ; [L11180] int t1_st ; [L47] int a20 = 5; [L36] int a= 1; [L38] int b= 2; [L34] int c= 3; [L33] int d= 4; [L35] int e= 5; [L46] int a25 = 1; [L37] int f= 6; [L41] int a27 = 1; [L11190] int token ; [L42] int a2 = 10; [L11186] int E_1 = 2; [L11177] int m_pc = 0; [L40] int a9 = 18; 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_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, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_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_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, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] 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_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, token=0] [L11586] 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_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, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] 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_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, token=0] [L11340] COND TRUE t1_i == 1 [L11341] 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_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, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11424] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11434] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11588] 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_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, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11301] return (__retres1); VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_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_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, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11320] return (__retres1); VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_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_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, tmp=0, tmp___0=0, token=0] [L11589] 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_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, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11452] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11462] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11590] 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_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, token=0] [L11593] 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_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, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] 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_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, token=0] [L11375] 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_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, token=0] [L11378] 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_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, token=0] [L11350] 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_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, token=0] [L11353] COND TRUE m_st == 0 [L11354] __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_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, token=0] [L11366] 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_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, token=0] [L11378] 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_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, token=0] [L11378] tmp = exists_runnable_thread() [L11380] 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_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, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] 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_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, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] 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_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, token=0] [L11264] 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_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, token=0] [L11266] t1_pc = 1 [L11267] 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_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, token=0] [L11405] RET transmit1() [L11375] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] 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_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, token=0] [L11350] 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_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, token=0] [L11353] COND TRUE m_st == 0 [L11354] __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_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, token=0] [L11366] 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_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, token=0] [L11378] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] 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_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, tmp_var=0, token=0] [L11208] 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_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, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] 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_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, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11301] return (__retres1); VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_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_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, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11320] return (__retres1); VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [\old(m_st)=1, \old(t1_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_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, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11214] 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_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, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] 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_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, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] 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_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, token=0] [L11256] 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_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, token=0] [L11272] token += 1 [L11273] 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_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=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11301] return (__retres1); VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [\old(m_st)=2, \old(t1_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_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=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11320] return (__retres1); VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_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_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=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11274] 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_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=1, token=1] [L11275] 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_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=1, token=1] [L11264] 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_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=1, token=1] [L11266] t1_pc = 1 [L11267] 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_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, token=1] [L11405] RET transmit1() [L11375] 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_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] 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_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, token=1] [L11350] 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_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, token=1] [L11353] COND TRUE m_st == 0 [L11354] __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_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, token=1] [L11366] 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_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, token=1] [L11378] 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_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] 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_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] 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_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, tmp_var=5, token=1] [L11200] 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_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, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 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_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, tmp_var=5, token=1] [L11227] 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_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, tmp_var=5, token=1] [L11228] 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_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, tmp_var=5, token=1] [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_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, tmp_var=5, token=1] [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_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, tmp_var=5, token=1] [L11235] 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_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, tmp_var=5, token=1] [L11236] 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_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, token=1] [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_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, token=1] - UnprovableResult [Line: 11118]: 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, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46939 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46831 mSDsluCounter, 213331 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147255 mSDsCounter, 471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4201 IncrementalHoareTripleChecker+Invalid, 4672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 471 mSolverCounterUnsat, 66076 mSDtfsCounter, 4201 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1460 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6635occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4619 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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-11-18 20:55:29,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927b790a-0bf8-4203-9dbe-a41b8f2dcb36/bin/uautomizer-TMbwUNV5ro/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