./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 23:19:42,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 23:19:42,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 23:19:42,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 23:19:42,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 23:19:42,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 23:19:42,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 23:19:42,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 23:19:42,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 23:19:42,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 23:19:42,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 23:19:42,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 23:19:42,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 23:19:42,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 23:19:42,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 23:19:42,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 23:19:42,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 23:19:42,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 23:19:42,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 23:19:42,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 23:19:42,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 23:19:42,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 23:19:42,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 23:19:42,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 23:19:42,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 23:19:42,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 23:19:42,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 23:19:42,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 23:19:42,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 23:19:42,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 23:19:42,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 23:19:42,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 23:19:42,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 23:19:42,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 23:19:42,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 23:19:42,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 23:19:42,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 23:19:42,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 23:19:42,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 23:19:42,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 23:19:42,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 23:19:42,945 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-22 23:19:42,990 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 23:19:42,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 23:19:42,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-22 23:19:42,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-22 23:19:42,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 23:19:42,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 23:19:42,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 23:19:42,993 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 23:19:43,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 23:19:43,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 23:19:43,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 23:19:43,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 23:19:43,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 23:19:43,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 23:19:43,002 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 23:19:43,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 23:19:43,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 23:19:43,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 23:19:43,003 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-22 23:19:43,003 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-22 23:19:43,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 23:19:43,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:19:43,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 23:19:43,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 23:19:43,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 23:19:43,005 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-22 23:19:43,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 23:19:43,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 23:19:43,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/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_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ 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 -> Kojak 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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2021-11-22 23:19:43,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 23:19:43,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 23:19:43,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 23:19:43,377 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 23:19:43,378 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 23:19:43,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2021-11-22 23:19:43,474 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/data/b0cfe0ba8/902de348d67e4637bc701c33fcc03132/FLAG0e49afdc3 [2021-11-22 23:19:44,096 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 23:19:44,097 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2021-11-22 23:19:44,114 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/data/b0cfe0ba8/902de348d67e4637bc701c33fcc03132/FLAG0e49afdc3 [2021-11-22 23:19:44,410 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/data/b0cfe0ba8/902de348d67e4637bc701c33fcc03132 [2021-11-22 23:19:44,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 23:19:44,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 23:19:44,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 23:19:44,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 23:19:44,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 23:19:44,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457840df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44, skipping insertion in model container [2021-11-22 23:19:44,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 23:19:44,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 23:19:44,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2021-11-22 23:19:44,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:19:44,727 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 23:19:44,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2021-11-22 23:19:44,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:19:44,781 INFO L208 MainTranslator]: Completed translation [2021-11-22 23:19:44,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44 WrapperNode [2021-11-22 23:19:44,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 23:19:44,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 23:19:44,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 23:19:44,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 23:19:44,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,847 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2021-11-22 23:19:44,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 23:19:44,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 23:19:44,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 23:19:44,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 23:19:44,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 23:19:44,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 23:19:44,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 23:19:44,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 23:19:44,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:44" (1/1) ... [2021-11-22 23:19:44,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:19:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-22 23:19:44,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-22 23:19:44,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-22 23:19:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 23:19:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 23:19:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 23:19:44,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 23:19:45,068 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 23:19:45,070 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 23:19:45,484 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 23:19:45,779 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 23:19:45,779 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 23:19:45,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:45 BoogieIcfgContainer [2021-11-22 23:19:45,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 23:19:45,782 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-22 23:19:45,783 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-22 23:19:45,794 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-22 23:19:45,794 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:45" (1/1) ... [2021-11-22 23:19:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 23:19:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2021-11-22 23:19:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2021-11-22 23:19:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-22 23:19:45,892 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:45,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:19:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:19:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:19:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 13 states and 18 transitions. [2021-11-22 23:19:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2021-11-22 23:19:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-22 23:19:46,555 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:46,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:19:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:19:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:19:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 16 states and 24 transitions. [2021-11-22 23:19:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2021-11-22 23:19:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-22 23:19:47,108 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:47,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:19:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:19:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:19:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 20 states and 30 transitions. [2021-11-22 23:19:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2021-11-22 23:19:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-22 23:19:47,734 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:47,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:19:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:19:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:19:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 23 states and 34 transitions. [2021-11-22 23:19:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2021-11-22 23:19:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 23:19:48,110 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:48,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:19:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:19:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:19:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 33 states and 52 transitions. [2021-11-22 23:19:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2021-11-22 23:19:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 23:19:51,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:51,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:19:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:19:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:19:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 41 states and 68 transitions. [2021-11-22 23:19:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 68 transitions. [2021-11-22 23:19:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 23:19:54,760 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:54,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:19:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:19:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:19:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:19:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 52 states and 89 transitions. [2021-11-22 23:19:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2021-11-22 23:19:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 23:19:59,957 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:19:59,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 53 states and 92 transitions. [2021-11-22 23:20:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 92 transitions. [2021-11-22 23:20:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 23:20:00,453 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:00,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 69 states and 126 transitions. [2021-11-22 23:20:06,247 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 126 transitions. [2021-11-22 23:20:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 23:20:06,248 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:06,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 85 states and 157 transitions. [2021-11-22 23:20:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 157 transitions. [2021-11-22 23:20:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 23:20:12,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:12,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 91 states and 172 transitions. [2021-11-22 23:20:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 172 transitions. [2021-11-22 23:20:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 23:20:17,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:17,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 92 states and 174 transitions. [2021-11-22 23:20:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 174 transitions. [2021-11-22 23:20:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 23:20:18,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:18,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 93 states and 176 transitions. [2021-11-22 23:20:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 176 transitions. [2021-11-22 23:20:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 23:20:19,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:19,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 118 states and 255 transitions. [2021-11-22 23:20:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2021-11-22 23:20:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 23:20:46,578 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:46,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 121 states and 274 transitions. [2021-11-22 23:20:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 274 transitions. [2021-11-22 23:20:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 23:20:50,591 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:50,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:20:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:20:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:20:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 122 states and 283 transitions. [2021-11-22 23:20:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 283 transitions. [2021-11-22 23:20:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:20:54,220 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:20:54,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:20:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:21:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:22:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:22:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 147 states and 357 transitions. [2021-11-22 23:22:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 357 transitions. [2021-11-22 23:22:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:22:10,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:22:10,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:22:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:22:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:22:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:22:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 155 states and 371 transitions. [2021-11-22 23:22:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 371 transitions. [2021-11-22 23:22:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:22:38,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:22:38,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:22:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:22:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:22:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:22:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 164 states and 399 transitions. [2021-11-22 23:22:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 399 transitions. [2021-11-22 23:22:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:22:57,557 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:22:57,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:22:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:22:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:23:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:23:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 173 states and 431 transitions. [2021-11-22 23:23:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 431 transitions. [2021-11-22 23:23:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:23:08,332 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:23:08,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:23:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:23:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:23:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:23:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 179 states and 438 transitions. [2021-11-22 23:23:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 438 transitions. [2021-11-22 23:23:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:23:28,882 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:23:28,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:23:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:23:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:23:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:23:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 181 states and 447 transitions. [2021-11-22 23:23:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 447 transitions. [2021-11-22 23:23:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:23:31,766 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:23:31,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:23:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:23:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:23:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:23:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 187 states and 459 transitions. [2021-11-22 23:23:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 459 transitions. [2021-11-22 23:23:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:23:43,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:23:43,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:23:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:23:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:23:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:23:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 194 states and 479 transitions. [2021-11-22 23:23:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 479 transitions. [2021-11-22 23:23:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:23:58,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:23:58,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:23:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:24:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:24:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:24:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 195 states and 484 transitions. [2021-11-22 23:24:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 484 transitions. [2021-11-22 23:24:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:24:05,434 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:24:05,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:24:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:24:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:24:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:24:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 198 states and 499 transitions. [2021-11-22 23:24:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 499 transitions. [2021-11-22 23:24:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:24:21,761 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:24:21,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:24:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:24:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:24:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:24:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 199 states and 503 transitions. [2021-11-22 23:24:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 503 transitions. [2021-11-22 23:24:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:24:28,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:24:28,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:24:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:24:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:24:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:24:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 204 states and 508 transitions. [2021-11-22 23:24:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 508 transitions. [2021-11-22 23:24:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:24:38,343 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:24:38,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:24:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:24:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:24:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:24:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 210 states and 524 transitions. [2021-11-22 23:24:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 524 transitions. [2021-11-22 23:24:55,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 23:24:55,145 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:24:55,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:24:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:24:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:25:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:25:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 217 states and 533 transitions. [2021-11-22 23:25:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 533 transitions. [2021-11-22 23:25:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 23:25:10,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:25:10,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:25:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:25:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:25:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:25:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 233 states and 600 transitions. [2021-11-22 23:25:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 600 transitions. [2021-11-22 23:25:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 23:25:45,909 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:25:45,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:25:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:25:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:25:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:25:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 239 states and 611 transitions. [2021-11-22 23:25:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 611 transitions. [2021-11-22 23:25:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:25:55,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:25:55,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:25:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:26:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 241 states and 615 transitions. [2021-11-22 23:26:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 615 transitions. [2021-11-22 23:26:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:14,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:14,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:26:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 249 states and 639 transitions. [2021-11-22 23:26:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 639 transitions. [2021-11-22 23:26:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:26,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:26,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 23:26:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 254 states and 649 transitions. [2021-11-22 23:26:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 649 transitions. [2021-11-22 23:26:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:34,681 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:34,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:26:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 256 states and 656 transitions. [2021-11-22 23:26:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 656 transitions. [2021-11-22 23:26:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:38,564 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:38,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 23:26:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 261 states and 670 transitions. [2021-11-22 23:26:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 670 transitions. [2021-11-22 23:26:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:47,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:47,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 23:26:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 262 states and 675 transitions. [2021-11-22 23:26:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 675 transitions. [2021-11-22 23:26:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:49,371 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:49,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:26:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 263 states and 685 transitions. [2021-11-22 23:26:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 685 transitions. [2021-11-22 23:26:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:51,840 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:51,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 23:26:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:26:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 264 states and 690 transitions. [2021-11-22 23:26:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 690 transitions. [2021-11-22 23:26:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:26:54,037 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:26:54,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:26:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:26:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:27:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:27:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 269 states and 698 transitions. [2021-11-22 23:27:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 698 transitions. [2021-11-22 23:27:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:27:08,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:27:08,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:27:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:27:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:27:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:27:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 270 states and 708 transitions. [2021-11-22 23:27:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 708 transitions. [2021-11-22 23:27:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:27:11,291 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:27:11,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:27:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:27:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 23:27:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:27:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 276 states and 720 transitions. [2021-11-22 23:27:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 720 transitions. [2021-11-22 23:27:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 23:27:19,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:27:19,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:27:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:27:20,128 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:27:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:27:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:27:21,153 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:27:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:27:21,456 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 44 iterations. [2021-11-22 23:27:21,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 11:27:21 ImpRootNode [2021-11-22 23:27:21,666 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-22 23:27:21,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 23:27:21,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 23:27:21,667 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 23:27:21,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:45" (3/4) ... [2021-11-22 23:27:21,669 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-22 23:27:21,895 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-22 23:27:21,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 23:27:21,898 INFO L158 Benchmark]: Toolchain (without parser) took 457481.71ms. Allocated memory was 94.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 60.2MB in the beginning and 990.7MB in the end (delta: -930.6MB). Peak memory consumption was 358.5MB. Max. memory is 16.1GB. [2021-11-22 23:27:21,899 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 94.4MB. Free memory was 49.4MB in the beginning and 49.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 23:27:21,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.41ms. Allocated memory is still 94.4MB. Free memory was 60.0MB in the beginning and 66.7MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 23:27:21,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.88ms. Allocated memory is still 94.4MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 23:27:21,902 INFO L158 Benchmark]: Boogie Preprocessor took 27.07ms. Allocated memory is still 94.4MB. Free memory was 64.6MB in the beginning and 63.1MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-22 23:27:21,902 INFO L158 Benchmark]: RCFGBuilder took 905.32ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 71.0MB in the end (delta: -7.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2021-11-22 23:27:21,903 INFO L158 Benchmark]: CodeCheck took 455883.21ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 71.0MB in the beginning and 1.0GB in the end (delta: -933.3MB). Peak memory consumption was 337.0MB. Max. memory is 16.1GB. [2021-11-22 23:27:21,903 INFO L158 Benchmark]: Witness Printer took 231.10ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 990.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 23:27:21,906 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 455.6s, OverallIterations: 44, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15161 SdHoareTripleChecker+Valid, 218.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14360 mSDsluCounter, 9327 SdHoareTripleChecker+Invalid, 200.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9113 mSDsCounter, 6123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44894 IncrementalHoareTripleChecker+Invalid, 51017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6123 mSolverCounterUnsat, 214 mSDtfsCounter, 44894 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15211 GetRequests, 13608 SyntacticMatches, 711 SemanticMatches, 892 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433722 ImplicationChecksByTransitivity, 387.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 7.5s SatisfiabilityAnalysisTime, 76.1s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1222 ConstructedInterpolants, 0 QuantifiedInterpolants, 83187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 4 PerfectInterpolantSequences, 482/1734 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 287]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] port_t p2 ; [L38] char p2_old ; [L39] char p2_new ; [L40] char id2 ; [L41] char st2 ; [L42] msg_t send2 ; [L43] _Bool mode2 ; [L44] port_t p3 ; [L45] char p3_old ; [L46] char p3_new ; [L47] char id3 ; [L48] char st3 ; [L49] msg_t send3 ; [L50] _Bool mode3 ; [L235] int c1 ; [L236] int i2 ; [L239] c1 = 0 [L240] r1 = __VERIFIER_nondet_uchar() [L241] id1 = __VERIFIER_nondet_char() [L242] st1 = __VERIFIER_nondet_char() [L243] send1 = __VERIFIER_nondet_char() [L244] mode1 = __VERIFIER_nondet_bool() [L245] id2 = __VERIFIER_nondet_char() [L246] st2 = __VERIFIER_nondet_char() [L247] send2 = __VERIFIER_nondet_char() [L248] mode2 = __VERIFIER_nondet_bool() [L249] id3 = __VERIFIER_nondet_char() [L250] st3 = __VERIFIER_nondet_char() [L251] send3 = __VERIFIER_nondet_char() [L252] mode3 = __VERIFIER_nondet_bool() [L253] CALL, EXPR init() [L134] int tmp ; [L137] COND TRUE (int )r1 == 0 [L138] COND TRUE (int )id1 >= 0 [L139] COND TRUE (int )st1 == 0 [L140] COND TRUE (int )send1 == (int )id1 [L141] COND TRUE (int )mode1 == 0 [L142] COND TRUE (int )id2 >= 0 [L143] COND TRUE (int )st2 == 0 [L144] COND TRUE (int )send2 == (int )id2 [L145] COND TRUE (int )mode2 == 0 [L146] COND TRUE (int )id3 >= 0 [L147] COND TRUE (int )st3 == 0 [L148] COND TRUE (int )send3 == (int )id3 [L149] COND TRUE (int )mode3 == 0 [L150] COND TRUE (int )id1 != (int )id2 [L151] COND TRUE (int )id1 != (int )id3 [L152] COND TRUE (int )id2 != (int )id3 [L153] tmp = 1 [L202] return (tmp); [L253] RET, EXPR init() [L253] i2 = init() [L254] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L254] RET assume_abort_if_not(i2) [L255] p1_old = nomsg [L256] p1_new = nomsg [L257] p2_old = nomsg [L258] p2_new = nomsg [L259] p3_old = nomsg [L260] p3_new = nomsg [L261] i2 = 0 VAL [c1=0, i2=0, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND FALSE !((int )m3 > (int )id3) [L120] COND FALSE !((int )m3 == (int )id3) [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND TRUE (int )m1 == (int )id1 [L69] st1 = (char)1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND FALSE !((int )m3 > (int )id3) [L120] COND TRUE (int )m3 == (int )id3 [L121] st3 = (char)1 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=2, send2=2, send3=3, st1=1, st2=0, st3=1] [L210] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L228] tmp = 0 VAL [id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=2, send2=2, send3=3, st1=1, st2=0, st3=1, tmp=0] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND TRUE ! arg VAL [\old(arg)=0, arg=0, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=2, send2=2, send3=3, st1=1, st2=0, st3=1] [L287] reach_error() VAL [\old(arg)=0, arg=0, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=2, send2=2, send3=3, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68ms. Allocated memory is still 94.4MB. Free memory was 49.4MB in the beginning and 49.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.41ms. Allocated memory is still 94.4MB. Free memory was 60.0MB in the beginning and 66.7MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.88ms. Allocated memory is still 94.4MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.07ms. Allocated memory is still 94.4MB. Free memory was 64.6MB in the beginning and 63.1MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 905.32ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 71.0MB in the end (delta: -7.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * CodeCheck took 455883.21ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 71.0MB in the beginning and 1.0GB in the end (delta: -933.3MB). Peak memory consumption was 337.0MB. Max. memory is 16.1GB. * Witness Printer took 231.10ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 990.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-22 23:27:21,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f84dc34c-33d3-436d-99a5-af127a7189b0/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE