./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e7fbc69 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_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acd9e872db1fd43c4a46d62b416714fdbb0fdc4944c5c8838fbbff5e8b72009f --- 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-4e7fbc6 [2022-11-23 02:42:38,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:42:38,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:42:38,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:42:38,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:42:38,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:42:38,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:42:38,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:42:38,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:42:38,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:42:38,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:42:38,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:42:38,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:42:38,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:42:38,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:42:38,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:42:38,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:42:38,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:42:38,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:42:38,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:42:38,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:42:38,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:42:38,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:42:38,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:42:38,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:42:38,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:42:38,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:42:38,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:42:38,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:42:38,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:42:38,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:42:38,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:42:38,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:42:38,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:42:38,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:42:38,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:42:38,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:42:38,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:42:38,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:42:38,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:42:38,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:42:38,838 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-23 02:42:38,875 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:42:38,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:42:38,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:42:38,877 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:42:38,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:42:38,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:42:38,879 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:42:38,879 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-23 02:42:38,880 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-23 02:42:38,880 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-23 02:42:38,881 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-23 02:42:38,882 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-23 02:42:38,882 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-23 02:42:38,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:42:38,882 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:42:38,883 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:42:38,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:42:38,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:42:38,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:42:38,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-23 02:42:38,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-23 02:42:38,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-23 02:42:38,885 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:42:38,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:42:38,885 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-23 02:42:38,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:42:38,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-23 02:42:38,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:42:38,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:42:38,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:42:38,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:42:38,889 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-23 02:42:38,889 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/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_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS 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(F end) ) 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 -> acd9e872db1fd43c4a46d62b416714fdbb0fdc4944c5c8838fbbff5e8b72009f [2022-11-23 02:42:39,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:42:39,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:42:39,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:42:39,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:42:39,211 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:42:39,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c [2022-11-23 02:42:42,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:42:42,531 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:42:42,532 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c [2022-11-23 02:42:42,542 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/data/9d60695a5/c695999296354445a1bba227e4fc4e4a/FLAG3ba74705b [2022-11-23 02:42:42,558 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/data/9d60695a5/c695999296354445a1bba227e4fc4e4a [2022-11-23 02:42:42,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:42:42,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:42:42,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:42:42,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:42:42,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:42:42,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:42,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e5797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42, skipping insertion in model container [2022-11-23 02:42:42,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:42,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:42:42,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:42:42,852 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_5459ebd2-aa4e-4015-89f7-d3a3755025d8/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c[11261,11274] [2022-11-23 02:42:42,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:42:42,880 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:42:42,930 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_5459ebd2-aa4e-4015-89f7-d3a3755025d8/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c[11261,11274] [2022-11-23 02:42:42,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:42:42,947 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:42:42,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42 WrapperNode [2022-11-23 02:42:42,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:42:42,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:42:42,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:42:42,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:42:42,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:42,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,002 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 294 [2022-11-23 02:42:43,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:42:43,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:42:43,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:42:43,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:42:43,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:42:43,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:42:43,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:42:43,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:42:43,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (1/1) ... [2022-11-23 02:42:43,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 02:42:43,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:42:43,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 02:42:43,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5459ebd2-aa4e-4015-89f7-d3a3755025d8/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-23 02:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:42:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:42:43,245 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:42:43,248 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:42:43,865 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:42:43,873 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:42:43,873 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 02:42:43,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:43 BoogieIcfgContainer [2022-11-23 02:42:43,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:42:43,877 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-23 02:42:43,877 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-23 02:42:43,882 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-23 02:42:43,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 02:42:43,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:42:42" (1/3) ... [2022-11-23 02:42:43,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b52682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:42:43, skipping insertion in model container [2022-11-23 02:42:43,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 02:42:43,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:42" (2/3) ... [2022-11-23 02:42:43,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b52682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:42:43, skipping insertion in model container [2022-11-23 02:42:43,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 02:42:43,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:43" (3/3) ... [2022-11-23 02:42:43,887 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c [2022-11-23 02:42:43,954 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-23 02:42:43,954 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-23 02:42:43,954 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-23 02:42:43,954 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-23 02:42:43,954 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-23 02:42:43,954 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-23 02:42:43,954 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-23 02:42:43,955 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-23 02:42:43,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 84 states, 83 states have (on average 1.7349397590361446) internal successors, (144), 83 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:43,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-11-23 02:42:43,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:42:43,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:42:43,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:43,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:43,989 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-23 02:42:43,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 84 states, 83 states have (on average 1.7349397590361446) internal successors, (144), 83 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:43,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-11-23 02:42:43,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:42:43,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:42:43,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:43,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:44,006 INFO L748 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 56#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 64#L199true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 84#L199-1true init_#res#1 := init_~tmp~0#1; 19#L324true main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 62#L22true assume !(0 == assume_abort_if_not_~cond#1); 39#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 42#L396-2true [2022-11-23 02:42:44,008 INFO L750 eck$LassoCheckResult]: Loop: 42#L396-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 5#L71true assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 75#L71-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 69#L100true assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 43#L100-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 26#L125true assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 14#L125-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 41#L150true assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 28#L150-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 3#L175true assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 8#L175-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 37#L332true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 51#L332-1true check_#res#1 := check_~tmp~1#1; 47#L352true main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 53#L425true assume !(0 == assert_~arg#1 % 256); 49#L420true assume { :end_inline_assert } true; 42#L396-2true [2022-11-23 02:42:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2022-11-23 02:42:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:44,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630073686] [2022-11-23 02:42:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:44,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:44,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630073686] [2022-11-23 02:42:44,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630073686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:44,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:44,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:42:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193134370] [2022-11-23 02:42:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:44,391 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 02:42:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1215089893, now seen corresponding path program 1 times [2022-11-23 02:42:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:44,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998069982] [2022-11-23 02:42:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:44,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998069982] [2022-11-23 02:42:44,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998069982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:44,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:44,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:42:44,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896306877] [2022-11-23 02:42:44,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:44,940 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 02:42:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:45,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:45,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:45,006 INFO L87 Difference]: Start difference. First operand has 84 states, 83 states have (on average 1.7349397590361446) internal successors, (144), 83 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:45,122 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2022-11-23 02:42:45,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 139 transitions. [2022-11-23 02:42:45,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-11-23 02:42:45,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 79 states and 105 transitions. [2022-11-23 02:42:45,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2022-11-23 02:42:45,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2022-11-23 02:42:45,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 105 transitions. [2022-11-23 02:42:45,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:45,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 105 transitions. [2022-11-23 02:42:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 105 transitions. [2022-11-23 02:42:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-23 02:42:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 78 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 105 transitions. [2022-11-23 02:42:45,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 105 transitions. [2022-11-23 02:42:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:45,183 INFO L428 stractBuchiCegarLoop]: Abstraction has 79 states and 105 transitions. [2022-11-23 02:42:45,183 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-23 02:42:45,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 105 transitions. [2022-11-23 02:42:45,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-11-23 02:42:45,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:42:45,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:42:45,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2022-11-23 02:42:45,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:45,188 INFO L748 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 252#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 253#L199 assume 0 == ~r1~0 % 256; 247#L200 assume ~id1~0 >= 0; 248#L201 assume 0 == ~st1~0; 225#L202 assume ~send1~0 == ~id1~0; 226#L203 assume 0 == ~mode1~0 % 256; 238#L204 assume ~id2~0 >= 0; 202#L205 assume 0 == ~st2~0; 203#L206 assume ~send2~0 == ~id2~0; 188#L207 assume 0 == ~mode2~0 % 256; 189#L208 assume ~id3~0 >= 0; 251#L209 assume 0 == ~st3~0; 207#L210 assume ~send3~0 == ~id3~0; 208#L211 assume 0 == ~mode3~0 % 256; 196#L212 assume ~id4~0 >= 0; 197#L213 assume 0 == ~st4~0; 260#L214 assume ~send4~0 == ~id4~0; 261#L215 assume 0 == ~mode4~0 % 256; 250#L216 assume ~id5~0 >= 0; 232#L217 assume 0 == ~st5~0; 233#L218 assume ~send5~0 == ~id5~0; 254#L219 assume 0 == ~mode5~0 % 256; 262#L220 assume ~id1~0 != ~id2~0; 221#L221 assume ~id1~0 != ~id3~0; 218#L222 assume ~id1~0 != ~id4~0; 219#L223 assume ~id1~0 != ~id5~0; 214#L224 assume ~id2~0 != ~id3~0; 215#L225 assume ~id2~0 != ~id4~0; 211#L226 assume ~id2~0 != ~id5~0; 212#L227 assume ~id3~0 != ~id4~0; 227#L228 assume ~id3~0 != ~id5~0; 228#L229 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 263#L199-1 init_#res#1 := init_~tmp~0#1; 216#L324 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 217#L22 assume !(0 == assume_abort_if_not_~cond#1); 239#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 240#L396-2 [2022-11-23 02:42:45,188 INFO L750 eck$LassoCheckResult]: Loop: 240#L396-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 190#L71 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 192#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 259#L100 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 243#L100-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 229#L125 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 209#L125-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 210#L150 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 220#L150-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 185#L175 assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 187#L175-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 195#L332 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 205#L332-1 check_#res#1 := check_~tmp~1#1; 245#L352 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 246#L425 assume !(0 == assert_~arg#1 % 256); 249#L420 assume { :end_inline_assert } true; 240#L396-2 [2022-11-23 02:42:45,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2022-11-23 02:42:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:45,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798170187] [2022-11-23 02:42:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:45,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:42:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:45,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:42:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1215089893, now seen corresponding path program 2 times [2022-11-23 02:42:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:45,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026155991] [2022-11-23 02:42:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:45,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:45,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026155991] [2022-11-23 02:42:45,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026155991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:45,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:45,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:42:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735243998] [2022-11-23 02:42:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:45,655 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 02:42:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:45,657 INFO L87 Difference]: Start difference. First operand 79 states and 105 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:45,746 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2022-11-23 02:42:45,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 107 transitions. [2022-11-23 02:42:45,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-11-23 02:42:45,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 79 states and 102 transitions. [2022-11-23 02:42:45,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2022-11-23 02:42:45,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2022-11-23 02:42:45,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 102 transitions. [2022-11-23 02:42:45,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:45,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-11-23 02:42:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 102 transitions. [2022-11-23 02:42:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-23 02:42:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 78 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-11-23 02:42:45,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-11-23 02:42:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:45,772 INFO L428 stractBuchiCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-11-23 02:42:45,772 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-23 02:42:45,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 102 transitions. [2022-11-23 02:42:45,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-11-23 02:42:45,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:42:45,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:42:45,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2022-11-23 02:42:45,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:45,785 INFO L748 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 426#L199 assume 0 == ~r1~0 % 256; 420#L200 assume ~id1~0 >= 0; 421#L201 assume 0 == ~st1~0; 395#L202 assume ~send1~0 == ~id1~0; 396#L203 assume 0 == ~mode1~0 % 256; 410#L204 assume ~id2~0 >= 0; 373#L205 assume 0 == ~st2~0; 374#L206 assume ~send2~0 == ~id2~0; 361#L207 assume 0 == ~mode2~0 % 256; 362#L208 assume ~id3~0 >= 0; 424#L209 assume 0 == ~st3~0; 377#L210 assume ~send3~0 == ~id3~0; 378#L211 assume 0 == ~mode3~0 % 256; 363#L212 assume ~id4~0 >= 0; 364#L213 assume 0 == ~st4~0; 433#L214 assume ~send4~0 == ~id4~0; 434#L215 assume 0 == ~mode4~0 % 256; 423#L216 assume ~id5~0 >= 0; 405#L217 assume 0 == ~st5~0; 406#L218 assume ~send5~0 == ~id5~0; 427#L219 assume 0 == ~mode5~0 % 256; 435#L220 assume ~id1~0 != ~id2~0; 394#L221 assume ~id1~0 != ~id3~0; 391#L222 assume ~id1~0 != ~id4~0; 392#L223 assume ~id1~0 != ~id5~0; 387#L224 assume ~id2~0 != ~id3~0; 388#L225 assume ~id2~0 != ~id4~0; 384#L226 assume ~id2~0 != ~id5~0; 385#L227 assume ~id3~0 != ~id4~0; 400#L228 assume ~id3~0 != ~id5~0; 401#L229 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 436#L199-1 init_#res#1 := init_~tmp~0#1; 389#L324 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 390#L22 assume !(0 == assume_abort_if_not_~cond#1); 412#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 413#L396-2 [2022-11-23 02:42:45,785 INFO L750 eck$LassoCheckResult]: Loop: 413#L396-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 365#L71 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 367#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 432#L100 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 416#L100-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 402#L125 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 382#L125-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 383#L150 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 393#L150-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 358#L175 assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 360#L175-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 370#L332 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 411#L333 assume ~r1~0 % 256 >= 5; 379#L337 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 380#L332-1 check_#res#1 := check_~tmp~1#1; 418#L352 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 419#L425 assume !(0 == assert_~arg#1 % 256); 422#L420 assume { :end_inline_assert } true; 413#L396-2 [2022-11-23 02:42:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2022-11-23 02:42:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:45,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24163423] [2022-11-23 02:42:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:45,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:42:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:45,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:42:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash -886102197, now seen corresponding path program 1 times [2022-11-23 02:42:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:45,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364369351] [2022-11-23 02:42:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:45,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-11-23 02:42:45,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:45,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364369351] [2022-11-23 02:42:45,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364369351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:45,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:45,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224548692] [2022-11-23 02:42:45,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:45,884 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 02:42:45,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:45,885 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:45,921 INFO L93 Difference]: Finished difference Result 115 states and 156 transitions. [2022-11-23 02:42:45,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 156 transitions. [2022-11-23 02:42:45,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-11-23 02:42:45,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 156 transitions. [2022-11-23 02:42:45,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-23 02:42:45,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-23 02:42:45,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 156 transitions. [2022-11-23 02:42:45,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:45,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 156 transitions. [2022-11-23 02:42:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 156 transitions. [2022-11-23 02:42:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-11-23 02:42:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 112 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 153 transitions. [2022-11-23 02:42:45,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 153 transitions. [2022-11-23 02:42:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:45,935 INFO L428 stractBuchiCegarLoop]: Abstraction has 113 states and 153 transitions. [2022-11-23 02:42:45,935 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-23 02:42:45,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 153 transitions. [2022-11-23 02:42:45,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-11-23 02:42:45,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:42:45,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:42:45,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2022-11-23 02:42:45,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:45,938 INFO L748 eck$LassoCheckResult]: Stem: 637#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 630#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 631#L199 assume 0 == ~r1~0 % 256; 624#L200 assume ~id1~0 >= 0; 625#L201 assume 0 == ~st1~0; 599#L202 assume ~send1~0 == ~id1~0; 600#L203 assume 0 == ~mode1~0 % 256; 613#L204 assume ~id2~0 >= 0; 575#L205 assume 0 == ~st2~0; 576#L206 assume ~send2~0 == ~id2~0; 561#L207 assume 0 == ~mode2~0 % 256; 562#L208 assume ~id3~0 >= 0; 629#L209 assume 0 == ~st3~0; 579#L210 assume ~send3~0 == ~id3~0; 580#L211 assume 0 == ~mode3~0 % 256; 569#L212 assume ~id4~0 >= 0; 570#L213 assume 0 == ~st4~0; 639#L214 assume ~send4~0 == ~id4~0; 640#L215 assume 0 == ~mode4~0 % 256; 628#L216 assume ~id5~0 >= 0; 606#L217 assume 0 == ~st5~0; 607#L218 assume ~send5~0 == ~id5~0; 632#L219 assume 0 == ~mode5~0 % 256; 642#L220 assume ~id1~0 != ~id2~0; 595#L221 assume ~id1~0 != ~id3~0; 593#L222 assume ~id1~0 != ~id4~0; 594#L223 assume ~id1~0 != ~id5~0; 587#L224 assume ~id2~0 != ~id3~0; 588#L225 assume ~id2~0 != ~id4~0; 583#L226 assume ~id2~0 != ~id5~0; 584#L227 assume ~id3~0 != ~id4~0; 601#L228 assume ~id3~0 != ~id5~0; 602#L229 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 643#L199-1 init_#res#1 := init_~tmp~0#1; 589#L324 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 590#L22 assume !(0 == assume_abort_if_not_~cond#1); 616#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 617#L396-2 [2022-11-23 02:42:45,938 INFO L750 eck$LassoCheckResult]: Loop: 617#L396-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 563#L71 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 565#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 641#L100 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 620#L100-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 603#L125 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 581#L125-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 582#L150 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 652#L150-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 648#L175 assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 646#L175-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 645#L332 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 644#L333 assume !(~r1~0 % 256 >= 5); 585#L336 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 586#L337 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 670#L332-1 check_#res#1 := check_~tmp~1#1; 669#L352 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 668#L425 assume !(0 == assert_~arg#1 % 256); 667#L420 assume { :end_inline_assert } true; 617#L396-2 [2022-11-23 02:42:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2022-11-23 02:42:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:45,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486439068] [2022-11-23 02:42:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:45,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:42:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:45,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:42:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash -52792374, now seen corresponding path program 1 times [2022-11-23 02:42:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:45,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061079947] [2022-11-23 02:42:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:46,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:42:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:46,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:42:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash -596315624, now seen corresponding path program 1 times [2022-11-23 02:42:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:46,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222383629] [2022-11-23 02:42:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:46,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:46,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:42:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:46,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:42:51,144 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 02:42:51,144 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 02:42:51,145 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 02:42:51,145 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 02:42:51,145 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-23 02:42:51,145 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 02:42:51,145 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 02:42:51,145 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 02:42:51,146 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-23 02:42:51,146 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 02:42:51,146 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 02:42:51,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:51,215 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:51,221 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:51,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:54,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:54,066 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:54,072 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:54,081 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:54,083 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:54,089 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:54,093 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:42:56,519 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 30