./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:19:19,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:19:19,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:19:19,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:19:19,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:19:19,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:19:19,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:19:19,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:19:19,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:19:19,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:19:19,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:19:19,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:19:19,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:19:19,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:19:19,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:19:19,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:19:19,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:19:19,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:19:19,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:19:19,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:19:19,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:19:19,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:19:19,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:19:19,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:19:19,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:19:19,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:19:19,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:19:19,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:19:19,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:19:19,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:19:19,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:19:19,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:19:19,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:19:19,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:19:19,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:19:19,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:19:19,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:19:19,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:19:19,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:19:19,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:19:19,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:19:19,991 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:19:20,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:19:20,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:19:20,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:19:20,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:19:20,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:19:20,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:19:20,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:19:20,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:19:20,012 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:19:20,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:19:20,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:19:20,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:19:20,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:19:20,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:19:20,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:19:20,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:19:20,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:19:20,013 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:19:20,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:19:20,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:19:20,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:19:20,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:19:20,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:19:20,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:19:20,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:19:20,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:19:20,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:19:20,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:19:20,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:19:20,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:19:20,015 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:19:20,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:19:20,016 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:19:20,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:19:20,016 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:19:20,016 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2022-12-13 12:19:20,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:19:20,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:19:20,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:19:20,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:19:20,228 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:19:20,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-12-13 12:19:22,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:19:23,269 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:19:23,269 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-12-13 12:19:23,302 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/data/40b443ec5/af51f7719ea94a1b8b814ef30dfcea06/FLAGd0cbe4abf [2022-12-13 12:19:23,317 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/data/40b443ec5/af51f7719ea94a1b8b814ef30dfcea06 [2022-12-13 12:19:23,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:19:23,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:19:23,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:19:23,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:19:23,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:19:23,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:19:23" (1/1) ... [2022-12-13 12:19:23,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdd7cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:23, skipping insertion in model container [2022-12-13 12:19:23,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:19:23" (1/1) ... [2022-12-13 12:19:23,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:19:23,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:19:24,780 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-12-13 12:19:24,799 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-12-13 12:19:24,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:19:24,920 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:19:25,702 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-12-13 12:19:25,706 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-12-13 12:19:25,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:19:25,752 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:19:25,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25 WrapperNode [2022-12-13 12:19:25,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:19:25,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:19:25,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:19:25,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:19:25,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:25,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,089 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-12-13 12:19:26,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:19:26,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:19:26,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:19:26,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:19:26,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,339 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:19:26,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:19:26,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:19:26,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:19:26,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (1/1) ... [2022-12-13 12:19:26,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:19:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:26,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:19:26,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:19:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:19:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 12:19:26,436 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 12:19:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 12:19:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 12:19:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 12:19:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 12:19:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 12:19:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 12:19:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 12:19:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 12:19:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 12:19:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 12:19:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:19:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 12:19:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 12:19:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:19:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:19:26,517 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:19:26,519 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:19:31,941 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:19:31,967 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:19:31,967 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 12:19:31,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:19:31 BoogieIcfgContainer [2022-12-13 12:19:31,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:19:31,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:19:31,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:19:31,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:19:31,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:19:23" (1/3) ... [2022-12-13 12:19:31,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dd31b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:19:31, skipping insertion in model container [2022-12-13 12:19:31,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:25" (2/3) ... [2022-12-13 12:19:31,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dd31b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:19:31, skipping insertion in model container [2022-12-13 12:19:31,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:19:31" (3/3) ... [2022-12-13 12:19:31,980 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2022-12-13 12:19:31,995 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:19:31,995 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:19:32,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:19:32,081 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;@6124e02a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:19:32,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 12:19:32,090 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-12-13 12:19:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:19:32,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:32,100 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-12-13 12:19:32,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2022-12-13 12:19:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:32,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438833260] [2022-12-13 12:19:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:32,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:32,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:19:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:32,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438833260] [2022-12-13 12:19:32,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438833260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:32,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:32,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:19:32,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37298947] [2022-12-13 12:19:32,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:32,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:19:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:19:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:19:32,456 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-12-13 12:19:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:33,053 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2022-12-13 12:19:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:19:33,056 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-12-13 12:19:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:33,077 INFO L225 Difference]: With dead ends: 4727 [2022-12-13 12:19:33,077 INFO L226 Difference]: Without dead ends: 2368 [2022-12-13 12:19:33,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:19:33,088 INFO L413 NwaCegarLoop]: 4146 mSDtfsCounter, 4337 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:33,089 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.3s Time] [2022-12-13 12:19:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-12-13 12:19:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2022-12-13 12:19:33,234 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-12-13 12:19:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2022-12-13 12:19:33,247 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2022-12-13 12:19:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:33,248 INFO L495 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2022-12-13 12:19:33,248 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-12-13 12:19:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2022-12-13 12:19:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:19:33,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:33,251 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-12-13 12:19:33,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:19:33,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2022-12-13 12:19:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:33,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053380852] [2022-12-13 12:19:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:19:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:33,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053380852] [2022-12-13 12:19:33,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053380852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:33,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:33,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:19:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177480915] [2022-12-13 12:19:33,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:33,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:19:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:19:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:33,393 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-12-13 12:19:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:33,957 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2022-12-13 12:19:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:19:33,958 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-12-13 12:19:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:33,965 INFO L225 Difference]: With dead ends: 2676 [2022-12-13 12:19:33,965 INFO L226 Difference]: Without dead ends: 2481 [2022-12-13 12:19:33,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:19:33,968 INFO L413 NwaCegarLoop]: 4136 mSDtfsCounter, 4257 mSDsluCounter, 16382 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 20518 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:33,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 20518 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:19:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2022-12-13 12:19:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2022-12-13 12:19:34,005 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-12-13 12:19:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2022-12-13 12:19:34,011 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2022-12-13 12:19:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:34,012 INFO L495 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2022-12-13 12:19:34,012 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-12-13 12:19:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2022-12-13 12:19:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:19:34,013 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:34,013 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-12-13 12:19:34,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:19:34,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2022-12-13 12:19:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:34,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834331026] [2022-12-13 12:19:34,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:19:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:34,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834331026] [2022-12-13 12:19:34,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834331026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:34,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:34,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:19:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250932731] [2022-12-13 12:19:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:34,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:19:34,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:34,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:19:34,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:34,096 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-12-13 12:19:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:34,697 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions. [2022-12-13 12:19:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 12:19:34,698 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-12-13 12:19:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:34,709 INFO L225 Difference]: With dead ends: 3027 [2022-12-13 12:19:34,709 INFO L226 Difference]: Without dead ends: 2742 [2022-12-13 12:19:34,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 12:19:34,712 INFO L413 NwaCegarLoop]: 4132 mSDtfsCounter, 4312 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4322 SdHoareTripleChecker+Valid, 20506 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:34,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4322 Valid, 20506 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:19:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-12-13 12:19:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590. [2022-12-13 12:19:34,779 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-12-13 12:19:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions. [2022-12-13 12:19:34,788 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58 [2022-12-13 12:19:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions. [2022-12-13 12:19:34,789 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-12-13 12:19:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions. [2022-12-13 12:19:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:19:34,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:34,791 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-12-13 12:19:34,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:19:34,791 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2022-12-13 12:19:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:34,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510060665] [2022-12-13 12:19:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:19:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:34,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510060665] [2022-12-13 12:19:34,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510060665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:34,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:34,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:19:34,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230742082] [2022-12-13 12:19:34,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:34,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:19:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:19:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:34,885 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-12-13 12:19:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:35,435 INFO L93 Difference]: Finished difference Result 3579 states and 6048 transitions. [2022-12-13 12:19:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 12:19:35,435 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-12-13 12:19:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:35,443 INFO L225 Difference]: With dead ends: 3579 [2022-12-13 12:19:35,444 INFO L226 Difference]: Without dead ends: 3119 [2022-12-13 12:19:35,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 12:19:35,446 INFO L413 NwaCegarLoop]: 4124 mSDtfsCounter, 4252 mSDsluCounter, 16356 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 20480 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:35,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 20480 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:19:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2022-12-13 12:19:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2889. [2022-12-13 12:19:35,542 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-12-13 12:19:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5052 transitions. [2022-12-13 12:19:35,548 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5052 transitions. Word has length 58 [2022-12-13 12:19:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:35,549 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 5052 transitions. [2022-12-13 12:19:35,549 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-12-13 12:19:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5052 transitions. [2022-12-13 12:19:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:19:35,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:35,551 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-12-13 12:19:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:19:35,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2022-12-13 12:19:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:35,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748224958] [2022-12-13 12:19:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:35,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:35,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:35,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:35,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:19:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748224958] [2022-12-13 12:19:35,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748224958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:35,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:35,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:19:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102122039] [2022-12-13 12:19:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:35,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:19:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:19:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:19:35,615 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-12-13 12:19:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:36,076 INFO L93 Difference]: Finished difference Result 4253 states and 6998 transitions. [2022-12-13 12:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:19:36,076 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-12-13 12:19:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:36,087 INFO L225 Difference]: With dead ends: 4253 [2022-12-13 12:19:36,087 INFO L226 Difference]: Without dead ends: 3495 [2022-12-13 12:19:36,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:19:36,092 INFO L413 NwaCegarLoop]: 4141 mSDtfsCounter, 4370 mSDsluCounter, 12183 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4393 SdHoareTripleChecker+Valid, 16324 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:36,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4393 Valid, 16324 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:19:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-12-13 12:19:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3290. [2022-12-13 12:19:36,190 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-12-13 12:19:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5586 transitions. [2022-12-13 12:19:36,196 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5586 transitions. Word has length 58 [2022-12-13 12:19:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:36,196 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 5586 transitions. [2022-12-13 12:19:36,196 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-12-13 12:19:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5586 transitions. [2022-12-13 12:19:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 12:19:36,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:36,199 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-12-13 12:19:36,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:19:36,199 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2022-12-13 12:19:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:36,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840582091] [2022-12-13 12:19:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 12:19:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 12:19:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:19:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840582091] [2022-12-13 12:19:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840582091] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569525420] [2022-12-13 12:19:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:36,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:36,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:36,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:36,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:19:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:19:36,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 12:19:36,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:36,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569525420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:36,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:36,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 12:19:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991988682] [2022-12-13 12:19:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:36,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:19:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:19:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:36,419 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-12-13 12:19:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:36,535 INFO L93 Difference]: Finished difference Result 5496 states and 8712 transitions. [2022-12-13 12:19:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:19:36,535 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-12-13 12:19:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:36,547 INFO L225 Difference]: With dead ends: 5496 [2022-12-13 12:19:36,548 INFO L226 Difference]: Without dead ends: 4338 [2022-12-13 12:19:36,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:36,552 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-12-13 12:19:36,552 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-12-13 12:19:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2022-12-13 12:19:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2022-12-13 12:19:36,657 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-12-13 12:19:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7038 transitions. [2022-12-13 12:19:36,666 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7038 transitions. Word has length 93 [2022-12-13 12:19:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:36,667 INFO L495 AbstractCegarLoop]: Abstraction has 4338 states and 7038 transitions. [2022-12-13 12:19:36,667 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-12-13 12:19:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7038 transitions. [2022-12-13 12:19:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 12:19:36,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:36,671 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-12-13 12:19:36,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:19:36,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 12:19:36,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2022-12-13 12:19:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:36,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172022871] [2022-12-13 12:19:36,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 12:19:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 12:19:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 12:19:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 12:19:36,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:36,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172022871] [2022-12-13 12:19:36,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172022871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:36,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731544330] [2022-12-13 12:19:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:36,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:36,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:19:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:19:37,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 12:19:37,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:37,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731544330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:37,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:37,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 12:19:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779380226] [2022-12-13 12:19:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:37,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:19:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:19:37,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:37,140 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-12-13 12:19:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:37,352 INFO L93 Difference]: Finished difference Result 8608 states and 13011 transitions. [2022-12-13 12:19:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:19:37,352 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-12-13 12:19:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:37,372 INFO L225 Difference]: With dead ends: 8608 [2022-12-13 12:19:37,372 INFO L226 Difference]: Without dead ends: 6405 [2022-12-13 12:19:37,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:37,379 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-12-13 12:19:37,379 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-12-13 12:19:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2022-12-13 12:19:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6345. [2022-12-13 12:19:37,559 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-12-13 12:19:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 9768 transitions. [2022-12-13 12:19:37,573 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 9768 transitions. Word has length 119 [2022-12-13 12:19:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:37,573 INFO L495 AbstractCegarLoop]: Abstraction has 6345 states and 9768 transitions. [2022-12-13 12:19:37,574 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-12-13 12:19:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 9768 transitions. [2022-12-13 12:19:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 12:19:37,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:37,582 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-12-13 12:19:37,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:19:37,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 12:19:37,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2022-12-13 12:19:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:37,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110183430] [2022-12-13 12:19:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 12:19:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 12:19:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 12:19:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 12:19:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-13 12:19:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:37,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110183430] [2022-12-13 12:19:37,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110183430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:37,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424722185] [2022-12-13 12:19:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:37,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:37,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:37,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:37,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:19:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:38,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:38,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 12:19:38,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:38,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424722185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:38,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:38,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 12:19:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817641699] [2022-12-13 12:19:38,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:38,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:19:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:38,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:19:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:38,102 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-12-13 12:19:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:38,342 INFO L93 Difference]: Finished difference Result 9619 states and 14299 transitions. [2022-12-13 12:19:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:19:38,343 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-12-13 12:19:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:38,363 INFO L225 Difference]: With dead ends: 9619 [2022-12-13 12:19:38,363 INFO L226 Difference]: Without dead ends: 6673 [2022-12-13 12:19:38,370 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-12-13 12:19:38,371 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-12-13 12:19:38,371 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-12-13 12:19:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2022-12-13 12:19:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6635. [2022-12-13 12:19:38,675 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-12-13 12:19:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 10060 transitions. [2022-12-13 12:19:38,693 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 10060 transitions. Word has length 135 [2022-12-13 12:19:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:38,694 INFO L495 AbstractCegarLoop]: Abstraction has 6635 states and 10060 transitions. [2022-12-13 12:19:38,694 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-12-13 12:19:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 10060 transitions. [2022-12-13 12:19:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 12:19:38,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:38,704 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-12-13 12:19:38,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 12:19:38,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:38,905 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2022-12-13 12:19:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:38,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915098855] [2022-12-13 12:19:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 12:19:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 12:19:39,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:39,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915098855] [2022-12-13 12:19:39,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915098855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:39,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799489700] [2022-12-13 12:19:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:39,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:39,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:39,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:39,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 12:19:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:39,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 12:19:39,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:39,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799489700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:39,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:39,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 12:19:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922358771] [2022-12-13 12:19:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:39,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:19:39,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:19:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:39,250 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-12-13 12:19:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:39,458 INFO L93 Difference]: Finished difference Result 9031 states and 13439 transitions. [2022-12-13 12:19:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:19:39,459 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-12-13 12:19:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:39,473 INFO L225 Difference]: With dead ends: 9031 [2022-12-13 12:19:39,474 INFO L226 Difference]: Without dead ends: 6671 [2022-12-13 12:19:39,479 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-12-13 12:19:39,480 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-12-13 12:19:39,480 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-12-13 12:19:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2022-12-13 12:19:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6611. [2022-12-13 12:19:39,690 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-12-13 12:19:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 9942 transitions. [2022-12-13 12:19:39,701 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 9942 transitions. Word has length 136 [2022-12-13 12:19:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:39,701 INFO L495 AbstractCegarLoop]: Abstraction has 6611 states and 9942 transitions. [2022-12-13 12:19:39,701 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-12-13 12:19:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 9942 transitions. [2022-12-13 12:19:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 12:19:39,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:39,708 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-12-13 12:19:39,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 12:19:39,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:39,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2022-12-13 12:19:39,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:39,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590035453] [2022-12-13 12:19:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 12:19:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 12:19:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:40,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590035453] [2022-12-13 12:19:40,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590035453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:40,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018323165] [2022-12-13 12:19:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:40,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:40,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:40,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 12:19:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:19:40,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 12:19:40,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:40,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018323165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:40,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:40,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 12:19:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306871658] [2022-12-13 12:19:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:40,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:19:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:40,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:19:40,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:40,140 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-12-13 12:19:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:40,309 INFO L93 Difference]: Finished difference Result 9935 states and 14498 transitions. [2022-12-13 12:19:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:19:40,310 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-12-13 12:19:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:40,321 INFO L225 Difference]: With dead ends: 9935 [2022-12-13 12:19:40,321 INFO L226 Difference]: Without dead ends: 5993 [2022-12-13 12:19:40,328 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-12-13 12:19:40,329 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-12-13 12:19:40,329 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-12-13 12:19:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2022-12-13 12:19:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5763. [2022-12-13 12:19:40,491 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-12-13 12:19:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 8600 transitions. [2022-12-13 12:19:40,500 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 8600 transitions. Word has length 136 [2022-12-13 12:19:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:40,500 INFO L495 AbstractCegarLoop]: Abstraction has 5763 states and 8600 transitions. [2022-12-13 12:19:40,501 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-12-13 12:19:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 8600 transitions. [2022-12-13 12:19:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 12:19:40,506 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:40,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-13 12:19:40,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 12:19:40,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:40,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2022-12-13 12:19:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:40,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306465267] [2022-12-13 12:19:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 12:19:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 12:19:40,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:40,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306465267] [2022-12-13 12:19:40,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306465267] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:40,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010548897] [2022-12-13 12:19:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:40,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:40,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:40,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:40,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 12:19:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:40,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:19:40,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 12:19:40,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:40,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010548897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:40,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:40,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 12:19:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717471505] [2022-12-13 12:19:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:40,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:40,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:40,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:19:40,977 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-12-13 12:19:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:41,231 INFO L93 Difference]: Finished difference Result 7191 states and 10479 transitions. [2022-12-13 12:19:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:19:41,232 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-12-13 12:19:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:41,242 INFO L225 Difference]: With dead ends: 7191 [2022-12-13 12:19:41,242 INFO L226 Difference]: Without dead ends: 4833 [2022-12-13 12:19:41,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:19:41,248 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-12-13 12:19:41,248 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-12-13 12:19:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2022-12-13 12:19:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4821. [2022-12-13 12:19:41,406 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-12-13 12:19:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7314 transitions. [2022-12-13 12:19:41,413 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7314 transitions. Word has length 137 [2022-12-13 12:19:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:41,413 INFO L495 AbstractCegarLoop]: Abstraction has 4821 states and 7314 transitions. [2022-12-13 12:19:41,414 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-12-13 12:19:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7314 transitions. [2022-12-13 12:19:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 12:19:41,416 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:41,417 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-12-13 12:19:41,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 12:19:41,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 12:19:41,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2022-12-13 12:19:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:41,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960025631] [2022-12-13 12:19:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 12:19:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 12:19:41,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960025631] [2022-12-13 12:19:41,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960025631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70382326] [2022-12-13 12:19:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:41,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:41,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:41,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:41,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 12:19:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:41,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:19:41,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 12:19:41,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:41,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70382326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:41,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:41,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 12:19:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045012502] [2022-12-13 12:19:41,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:41,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:41,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:19:41,861 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-12-13 12:19:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:42,156 INFO L93 Difference]: Finished difference Result 7162 states and 10301 transitions. [2022-12-13 12:19:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:19:42,157 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-12-13 12:19:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:42,165 INFO L225 Difference]: With dead ends: 7162 [2022-12-13 12:19:42,165 INFO L226 Difference]: Without dead ends: 4769 [2022-12-13 12:19:42,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:19:42,170 INFO L413 NwaCegarLoop]: 4057 mSDtfsCounter, 4129 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:42,170 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.1s Time] [2022-12-13 12:19:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2022-12-13 12:19:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3795. [2022-12-13 12:19:42,277 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-12-13 12:19:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2022-12-13 12:19:42,283 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2022-12-13 12:19:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:42,284 INFO L495 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2022-12-13 12:19:42,284 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-12-13 12:19:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2022-12-13 12:19:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 12:19:42,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:42,286 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-12-13 12:19:42,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 12:19:42,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 12:19:42,487 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2022-12-13 12:19:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785910706] [2022-12-13 12:19:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 12:19:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 12:19:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:42,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785910706] [2022-12-13 12:19:42,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785910706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:42,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614781036] [2022-12-13 12:19:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:42,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:42,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:42,589 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:42,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 12:19:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:42,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:19:42,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 12:19:42,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:42,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614781036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:42,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:42,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 12:19:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532999239] [2022-12-13 12:19:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:42,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:42,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:42,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:42,701 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-12-13 12:19:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:42,871 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2022-12-13 12:19:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:19:42,872 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-12-13 12:19:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:42,877 INFO L225 Difference]: With dead ends: 4934 [2022-12-13 12:19:42,877 INFO L226 Difference]: Without dead ends: 3270 [2022-12-13 12:19:42,880 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-12-13 12:19:42,880 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.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:42,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:19:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-12-13 12:19:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2022-12-13 12:19:43,007 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-12-13 12:19:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2022-12-13 12:19:43,014 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2022-12-13 12:19:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:43,014 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2022-12-13 12:19:43,014 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-12-13 12:19:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2022-12-13 12:19:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 12:19:43,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:43,017 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-12-13 12:19:43,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 12:19:43,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 12:19:43,218 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2022-12-13 12:19:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:43,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437549594] [2022-12-13 12:19:43,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 12:19:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 12:19:43,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:43,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437549594] [2022-12-13 12:19:43,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437549594] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:43,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72935777] [2022-12-13 12:19:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:43,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:43,322 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:43,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 12:19:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:19:43,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 12:19:43,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:43,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72935777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:43,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:43,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 12:19:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118322029] [2022-12-13 12:19:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:43,414 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-12-13 12:19:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:43,544 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2022-12-13 12:19:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:19:43,544 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-12-13 12:19:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:43,550 INFO L225 Difference]: With dead ends: 4365 [2022-12-13 12:19:43,550 INFO L226 Difference]: Without dead ends: 3262 [2022-12-13 12:19:43,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:19:43,553 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-12-13 12:19:43,553 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-12-13 12:19:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-12-13 12:19:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2022-12-13 12:19:43,638 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-12-13 12:19:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2022-12-13 12:19:43,643 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2022-12-13 12:19:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:43,643 INFO L495 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2022-12-13 12:19:43,643 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-12-13 12:19:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2022-12-13 12:19:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 12:19:43,645 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:43,645 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-12-13 12:19:43,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 12:19:43,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 12:19:43,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2022-12-13 12:19:43,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:43,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686310223] [2022-12-13 12:19:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 12:19:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-13 12:19:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:43,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686310223] [2022-12-13 12:19:43,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686310223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:43,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:43,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:19:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437031176] [2022-12-13 12:19:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:43,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:19:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:43,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:19:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:19:43,944 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-12-13 12:19:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:44,441 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2022-12-13 12:19:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:19:44,441 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-12-13 12:19:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:44,447 INFO L225 Difference]: With dead ends: 4206 [2022-12-13 12:19:44,448 INFO L226 Difference]: Without dead ends: 4203 [2022-12-13 12:19:44,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:19:44,449 INFO L413 NwaCegarLoop]: 4124 mSDtfsCounter, 4454 mSDsluCounter, 12174 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 16298 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:44,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 16298 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:19:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2022-12-13 12:19:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2022-12-13 12:19:44,568 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-12-13 12:19:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2022-12-13 12:19:44,573 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2022-12-13 12:19:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:44,573 INFO L495 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2022-12-13 12:19:44,573 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-12-13 12:19:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2022-12-13 12:19:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 12:19:44,575 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:44,575 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-12-13 12:19:44,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:19:44,575 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2022-12-13 12:19:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:44,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769879271] [2022-12-13 12:19:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 12:19:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 12:19:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:19:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:19:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 12:19:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 12:19:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:19:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:19:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 12:19:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 12:19:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 12:19:44,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:44,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769879271] [2022-12-13 12:19:44,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769879271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:44,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:44,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:19:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349469544] [2022-12-13 12:19:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:44,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:44,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:19:44,634 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-12-13 12:19:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:45,072 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2022-12-13 12:19:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:19:45,073 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-12-13 12:19:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:45,081 INFO L225 Difference]: With dead ends: 4845 [2022-12-13 12:19:45,081 INFO L226 Difference]: Without dead ends: 3985 [2022-12-13 12:19:45,083 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-12-13 12:19:45,084 INFO L413 NwaCegarLoop]: 4124 mSDtfsCounter, 144 mSDsluCounter, 12149 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:45,084 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.2s Time] [2022-12-13 12:19:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2022-12-13 12:19:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2022-12-13 12:19:45,257 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-12-13 12:19:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2022-12-13 12:19:45,262 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2022-12-13 12:19:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:45,262 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2022-12-13 12:19:45,262 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-12-13 12:19:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2022-12-13 12:19:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-13 12:19:45,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:45,264 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-12-13 12:19:45,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:19:45,264 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:19:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2022-12-13 12:19:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:45,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954724927] [2022-12-13 12:19:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:45,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:19:45,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:19:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:19:45,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:19:45,315 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:19:45,316 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 12:19:45,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 12:19:45,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:19:45,320 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:45,324 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:19:45,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:19:45 BoogieIcfgContainer [2022-12-13 12:19:45,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:19:45,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:19:45,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:19:45,394 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:19:45,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:19:31" (3/4) ... [2022-12-13 12:19:45,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 12:19:45,457 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:19:45,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:19:45,458 INFO L158 Benchmark]: Toolchain (without parser) took 22137.51ms. Allocated memory was 119.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 45.9MB in the beginning and 954.1MB in the end (delta: -908.2MB). Peak memory consumption was 420.5MB. Max. memory is 16.1GB. [2022-12-13 12:19:45,458 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:19:45,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2430.35ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 45.9MB in the beginning and 58.4MB in the end (delta: -12.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2022-12-13 12:19:45,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 336.64ms. Allocated memory was 174.1MB in the beginning and 266.3MB in the end (delta: 92.3MB). Free memory was 58.4MB in the beginning and 131.1MB in the end (delta: -72.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2022-12-13 12:19:45,459 INFO L158 Benchmark]: Boogie Preprocessor took 288.58ms. Allocated memory is still 266.3MB. Free memory was 131.1MB in the beginning and 107.1MB in the end (delta: 24.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-12-13 12:19:45,459 INFO L158 Benchmark]: RCFGBuilder took 5592.78ms. Allocated memory was 266.3MB in the beginning and 889.2MB in the end (delta: 622.9MB). Free memory was 107.1MB in the beginning and 372.4MB in the end (delta: -265.3MB). Peak memory consumption was 365.3MB. Max. memory is 16.1GB. [2022-12-13 12:19:45,459 INFO L158 Benchmark]: TraceAbstraction took 13419.25ms. Allocated memory was 889.2MB in the beginning and 1.4GB in the end (delta: 557.8MB). Free memory was 371.3MB in the beginning and 968.8MB in the end (delta: -597.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:19:45,460 INFO L158 Benchmark]: Witness Printer took 63.63ms. Allocated memory is still 1.4GB. Free memory was 968.8MB in the beginning and 954.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 12:19:45,462 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.16ms. Allocated memory is still 119.5MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2430.35ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 45.9MB in the beginning and 58.4MB in the end (delta: -12.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 336.64ms. Allocated memory was 174.1MB in the beginning and 266.3MB in the end (delta: 92.3MB). Free memory was 58.4MB in the beginning and 131.1MB in the end (delta: -72.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 288.58ms. Allocated memory is still 266.3MB. Free memory was 131.1MB in the beginning and 107.1MB in the end (delta: 24.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * RCFGBuilder took 5592.78ms. Allocated memory was 266.3MB in the beginning and 889.2MB in the end (delta: 622.9MB). Free memory was 107.1MB in the beginning and 372.4MB in the end (delta: -265.3MB). Peak memory consumption was 365.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13419.25ms. Allocated memory was 889.2MB in the beginning and 1.4GB in the end (delta: 557.8MB). Free memory was 371.3MB in the beginning and 968.8MB in the end (delta: -597.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.63ms. Allocated memory is still 1.4GB. Free memory was 968.8MB in the beginning and 954.1MB in the end (delta: 14.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: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_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: 11094]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46939 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46831 mSDsluCounter, 213331 SdHoareTripleChecker+Invalid, 2.0s 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.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1460 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s 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: 2.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s 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-12-13 12:19:45,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5a4751b-1fe4-492b-8135-38e003a342dd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE