./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8 --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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:20:38,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:20:38,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:20:38,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:20:38,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:20:38,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:20:38,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:20:38,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:20:38,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:20:38,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:20:38,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:20:38,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:20:38,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:20:38,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:20:38,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:20:38,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:20:38,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:20:38,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:20:38,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:20:38,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:20:38,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:20:38,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:20:38,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:20:38,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:20:38,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:20:38,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:20:38,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:20:38,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:20:38,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:20:38,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:20:38,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:20:38,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:20:38,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:20:38,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:20:38,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:20:38,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:20:38,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:20:38,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:20:38,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:20:38,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:20:38,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:20:38,879 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 13:20:38,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:20:38,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:20:38,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:20:38,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:20:38,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:20:38,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:20:38,905 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:20:38,906 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 13:20:38,906 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 13:20:38,906 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 13:20:38,906 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 13:20:38,906 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 13:20:38,906 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 13:20:38,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:20:38,906 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:20:38,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:20:38,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:20:38,908 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 13:20:38,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:20:38,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 13:20:38,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:20:38,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:20:38,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:20:38,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:20:38,909 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 13:20:38,909 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_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-12-13 13:20:39,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:20:39,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:20:39,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:20:39,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:20:39,109 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:20:39,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_11.c [2022-12-13 13:20:41,746 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:20:41,873 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:20:41,874 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/sv-benchmarks/c/locks/test_locks_11.c [2022-12-13 13:20:41,879 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/data/f127145b4/070a030ac0f547ea88b1d58cbcd46092/FLAG071a67e81 [2022-12-13 13:20:41,889 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/data/f127145b4/070a030ac0f547ea88b1d58cbcd46092 [2022-12-13 13:20:41,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:20:41,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:20:41,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:20:41,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:20:41,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:20:41,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:20:41" (1/1) ... [2022-12-13 13:20:41,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b267d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:41, skipping insertion in model container [2022-12-13 13:20:41,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:20:41" (1/1) ... [2022-12-13 13:20:41,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:20:41,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:20:42,046 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_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-12-13 13:20:42,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:20:42,057 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:20:42,073 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_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-12-13 13:20:42,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:20:42,084 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:20:42,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42 WrapperNode [2022-12-13 13:20:42,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:20:42,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:20:42,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:20:42,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:20:42,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,109 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2022-12-13 13:20:42,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:20:42,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:20:42,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:20:42,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:20:42,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:20:42,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:20:42,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:20:42,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:20:42,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (1/1) ... [2022-12-13 13:20:42,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:20:42,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:20:42,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:20:42,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 13:20:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:20:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:20:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:20:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:20:42,267 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:20:42,269 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:20:42,424 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:20:42,429 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:20:42,429 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 13:20:42,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:42 BoogieIcfgContainer [2022-12-13 13:20:42,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:20:42,432 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 13:20:42,432 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 13:20:42,435 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 13:20:42,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:20:42,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 01:20:41" (1/3) ... [2022-12-13 13:20:42,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57405618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:20:42, skipping insertion in model container [2022-12-13 13:20:42,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:20:42,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:42" (2/3) ... [2022-12-13 13:20:42,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57405618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:20:42, skipping insertion in model container [2022-12-13 13:20:42,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:20:42,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:42" (3/3) ... [2022-12-13 13:20:42,438 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2022-12-13 13:20:42,486 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 13:20:42,487 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 13:20:42,487 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 13:20:42,487 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 13:20:42,487 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 13:20:42,487 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 13:20:42,487 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 13:20:42,488 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 13:20:42,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-12-13 13:20:42,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-12-13 13:20:42,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:42,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:42,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:42,511 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:42,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 13:20:42,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-12-13 13:20:42,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-12-13 13:20:42,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:42,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:42,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:42,515 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:42,522 INFO L748 eck$LassoCheckResult]: Stem: 38#$Ultimate##0true 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(16, 2);call #Ultimate.allocInit(12, 3); 9#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 26#L169-1true [2022-12-13 13:20:42,522 INFO L750 eck$LassoCheckResult]: Loop: 26#L169-1true assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14#L46true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 40#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 41#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L77-1true assume !(0 != main_~p3~0#1); 5#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 23#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 19#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 28#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 35#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24#L109-1true assume !(0 != main_~p11~0#1); 21#L113-1true assume !(0 != main_~p1~0#1); 36#L119-1true assume !(0 != main_~p2~0#1); 8#L124-1true assume !(0 != main_~p3~0#1); 11#L129-1true assume !(0 != main_~p4~0#1); 20#L134-1true assume !(0 != main_~p5~0#1); 10#L139-1true assume !(0 != main_~p6~0#1); 3#L144-1true assume !(0 != main_~p7~0#1); 33#L149-1true assume !(0 != main_~p8~0#1); 18#L154-1true assume !(0 != main_~p9~0#1); 7#L159-1true assume !(0 != main_~p10~0#1); 37#L164-1true assume !(0 != main_~p11~0#1); 26#L169-1true [2022-12-13 13:20:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 13:20:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898744980] [2022-12-13 13:20:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:42,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:42,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2022-12-13 13:20:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11278309] [2022-12-13 13:20:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:42,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:42,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11278309] [2022-12-13 13:20:42,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11278309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:42,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:42,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:42,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227877489] [2022-12-13 13:20:42,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:42,698 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:42,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:42,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:42,726 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:42,752 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2022-12-13 13:20:42,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2022-12-13 13:20:42,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-12-13 13:20:42,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2022-12-13 13:20:42,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-12-13 13:20:42,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-12-13 13:20:42,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2022-12-13 13:20:42,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:42,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-12-13 13:20:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2022-12-13 13:20:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-13 13:20:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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-12-13 13:20:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2022-12-13 13:20:42,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-12-13 13:20:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:42,820 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-12-13 13:20:42,820 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 13:20:42,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2022-12-13 13:20:42,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-12-13 13:20:42,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:42,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:42,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:42,823 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:42,823 INFO L748 eck$LassoCheckResult]: Stem: 169#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 145#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 146#L169-1 [2022-12-13 13:20:42,823 INFO L750 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 177#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 176#L73 assume !(0 != main_~p1~0#1); 171#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 165#L77-1 assume !(0 != main_~p3~0#1); 135#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 136#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 158#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 149#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 150#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 161#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 175#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 174#L109-1 assume !(0 != main_~p11~0#1); 172#L113-1 assume !(0 != main_~p1~0#1); 173#L119-1 assume !(0 != main_~p2~0#1); 197#L124-1 assume !(0 != main_~p3~0#1); 194#L129-1 assume !(0 != main_~p4~0#1); 191#L134-1 assume !(0 != main_~p5~0#1); 189#L139-1 assume !(0 != main_~p6~0#1); 187#L144-1 assume !(0 != main_~p7~0#1); 185#L149-1 assume !(0 != main_~p8~0#1); 183#L154-1 assume !(0 != main_~p9~0#1); 181#L159-1 assume !(0 != main_~p10~0#1); 179#L164-1 assume !(0 != main_~p11~0#1); 146#L169-1 [2022-12-13 13:20:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 13:20:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304360936] [2022-12-13 13:20:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:42,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:42,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2022-12-13 13:20:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195182286] [2022-12-13 13:20:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:42,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195182286] [2022-12-13 13:20:42,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195182286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:42,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:42,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970959156] [2022-12-13 13:20:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:42,893 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:42,894 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:42,913 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-12-13 13:20:42,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2022-12-13 13:20:42,916 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-12-13 13:20:42,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2022-12-13 13:20:42,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-12-13 13:20:42,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2022-12-13 13:20:42,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2022-12-13 13:20:42,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:42,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-12-13 13:20:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2022-12-13 13:20:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-12-13 13:20:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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-12-13 13:20:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2022-12-13 13:20:42,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-12-13 13:20:42,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:42,929 INFO L428 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-12-13 13:20:42,930 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 13:20:42,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2022-12-13 13:20:42,931 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-12-13 13:20:42,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:42,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:42,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:42,932 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:42,932 INFO L748 eck$LassoCheckResult]: Stem: 388#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 360#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 361#L169-1 [2022-12-13 13:20:42,932 INFO L750 eck$LassoCheckResult]: Loop: 361#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 403#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 404#L73 assume !(0 != main_~p1~0#1); 405#L73-2 assume !(0 != main_~p2~0#1); 482#L77-1 assume !(0 != main_~p3~0#1); 480#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 478#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 476#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 474#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 472#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 470#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 469#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 468#L109-1 assume !(0 != main_~p11~0#1); 466#L113-1 assume !(0 != main_~p1~0#1); 467#L119-1 assume !(0 != main_~p2~0#1); 357#L124-1 assume !(0 != main_~p3~0#1); 358#L129-1 assume !(0 != main_~p4~0#1); 353#L134-1 assume !(0 != main_~p5~0#1); 362#L139-1 assume !(0 != main_~p6~0#1); 347#L144-1 assume !(0 != main_~p7~0#1); 349#L149-1 assume !(0 != main_~p8~0#1); 371#L154-1 assume !(0 != main_~p9~0#1); 372#L159-1 assume !(0 != main_~p10~0#1); 412#L164-1 assume !(0 != main_~p11~0#1); 361#L169-1 [2022-12-13 13:20:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 13:20:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234462735] [2022-12-13 13:20:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:42,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:42,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2022-12-13 13:20:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967461277] [2022-12-13 13:20:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:42,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967461277] [2022-12-13 13:20:42,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967461277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:42,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:42,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:42,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864249011] [2022-12-13 13:20:42,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:42,980 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:42,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:42,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:42,981 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:42,999 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-12-13 13:20:42,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2022-12-13 13:20:43,003 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-12-13 13:20:43,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2022-12-13 13:20:43,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2022-12-13 13:20:43,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-12-13 13:20:43,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2022-12-13 13:20:43,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:43,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-12-13 13:20:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2022-12-13 13:20:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-12-13 13:20:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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-12-13 13:20:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2022-12-13 13:20:43,023 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-12-13 13:20:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:43,023 INFO L428 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-12-13 13:20:43,024 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 13:20:43,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2022-12-13 13:20:43,025 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-12-13 13:20:43,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:43,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:43,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:43,026 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:43,026 INFO L748 eck$LassoCheckResult]: Stem: 806#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 774#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 775#L169-1 [2022-12-13 13:20:43,026 INFO L750 eck$LassoCheckResult]: Loop: 775#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 863#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 858#L73 assume !(0 != main_~p1~0#1); 852#L73-2 assume !(0 != main_~p2~0#1); 853#L77-1 assume !(0 != main_~p3~0#1); 923#L81-1 assume !(0 != main_~p4~0#1); 922#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 921#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 838#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 839#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 834#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 804#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 796#L109-1 assume !(0 != main_~p11~0#1); 797#L113-1 assume !(0 != main_~p1~0#1); 908#L119-1 assume !(0 != main_~p2~0#1); 909#L124-1 assume !(0 != main_~p3~0#1); 949#L129-1 assume !(0 != main_~p4~0#1); 948#L134-1 assume !(0 != main_~p5~0#1); 946#L139-1 assume !(0 != main_~p6~0#1); 944#L144-1 assume !(0 != main_~p7~0#1); 942#L149-1 assume !(0 != main_~p8~0#1); 940#L154-1 assume !(0 != main_~p9~0#1); 938#L159-1 assume !(0 != main_~p10~0#1); 871#L164-1 assume !(0 != main_~p11~0#1); 775#L169-1 [2022-12-13 13:20:43,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 13:20:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042054494] [2022-12-13 13:20:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2022-12-13 13:20:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792286871] [2022-12-13 13:20:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792286871] [2022-12-13 13:20:43,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792286871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110116270] [2022-12-13 13:20:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,076 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:43,077 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:43,092 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-12-13 13:20:43,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2022-12-13 13:20:43,096 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-12-13 13:20:43,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2022-12-13 13:20:43,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-12-13 13:20:43,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2022-12-13 13:20:43,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2022-12-13 13:20:43,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:43,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-12-13 13:20:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2022-12-13 13:20:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-12-13 13:20:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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-12-13 13:20:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2022-12-13 13:20:43,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-12-13 13:20:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:43,125 INFO L428 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-12-13 13:20:43,125 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 13:20:43,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2022-12-13 13:20:43,128 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-12-13 13:20:43,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:43,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:43,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:43,129 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:43,129 INFO L748 eck$LassoCheckResult]: Stem: 1613#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 1580#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 1581#L169-1 [2022-12-13 13:20:43,129 INFO L750 eck$LassoCheckResult]: Loop: 1581#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1813#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 1812#L73 assume !(0 != main_~p1~0#1); 1689#L73-2 assume !(0 != main_~p2~0#1); 1691#L77-1 assume !(0 != main_~p3~0#1); 1669#L81-1 assume !(0 != main_~p4~0#1); 1671#L85-1 assume !(0 != main_~p5~0#1); 1804#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1840#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1839#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1838#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1837#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1836#L109-1 assume !(0 != main_~p11~0#1); 1765#L113-1 assume !(0 != main_~p1~0#1); 1767#L119-1 assume !(0 != main_~p2~0#1); 1834#L124-1 assume !(0 != main_~p3~0#1); 1829#L129-1 assume !(0 != main_~p4~0#1); 1827#L134-1 assume !(0 != main_~p5~0#1); 1828#L139-1 assume !(0 != main_~p6~0#1); 1846#L144-1 assume !(0 != main_~p7~0#1); 1773#L149-1 assume !(0 != main_~p8~0#1); 1769#L154-1 assume !(0 != main_~p9~0#1); 1736#L159-1 assume !(0 != main_~p10~0#1); 1735#L164-1 assume !(0 != main_~p11~0#1); 1581#L169-1 [2022-12-13 13:20:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-12-13 13:20:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994803631] [2022-12-13 13:20:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2022-12-13 13:20:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461717198] [2022-12-13 13:20:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461717198] [2022-12-13 13:20:43,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461717198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333216360] [2022-12-13 13:20:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,167 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:43,168 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:43,183 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-12-13 13:20:43,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2022-12-13 13:20:43,190 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-12-13 13:20:43,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-12-13 13:20:43,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2022-12-13 13:20:43,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2022-12-13 13:20:43,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2022-12-13 13:20:43,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:43,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-12-13 13:20:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2022-12-13 13:20:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-12-13 13:20:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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-12-13 13:20:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-12-13 13:20:43,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-12-13 13:20:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:43,221 INFO L428 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-12-13 13:20:43,221 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 13:20:43,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2022-12-13 13:20:43,226 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-12-13 13:20:43,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:43,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:43,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:43,226 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:43,227 INFO L748 eck$LassoCheckResult]: Stem: 3195#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 3158#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 3159#L169-1 [2022-12-13 13:20:43,227 INFO L750 eck$LassoCheckResult]: Loop: 3159#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3284#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 3280#L73 assume !(0 != main_~p1~0#1); 3276#L73-2 assume !(0 != main_~p2~0#1); 3274#L77-1 assume !(0 != main_~p3~0#1); 3245#L81-1 assume !(0 != main_~p4~0#1); 3243#L85-1 assume !(0 != main_~p5~0#1); 3244#L89-1 assume !(0 != main_~p6~0#1); 3381#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3377#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3374#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3369#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3368#L109-1 assume !(0 != main_~p11~0#1); 3335#L113-1 assume !(0 != main_~p1~0#1); 3331#L119-1 assume !(0 != main_~p2~0#1); 3330#L124-1 assume !(0 != main_~p3~0#1); 3327#L129-1 assume !(0 != main_~p4~0#1); 3325#L134-1 assume !(0 != main_~p5~0#1); 3323#L139-1 assume !(0 != main_~p6~0#1); 3322#L144-1 assume !(0 != main_~p7~0#1); 3320#L149-1 assume !(0 != main_~p8~0#1); 3318#L154-1 assume !(0 != main_~p9~0#1); 3316#L159-1 assume !(0 != main_~p10~0#1); 3288#L164-1 assume !(0 != main_~p11~0#1); 3159#L169-1 [2022-12-13 13:20:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-12-13 13:20:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410993174] [2022-12-13 13:20:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2022-12-13 13:20:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200750911] [2022-12-13 13:20:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200750911] [2022-12-13 13:20:43,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200750911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115210785] [2022-12-13 13:20:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,262 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:43,263 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:43,280 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-12-13 13:20:43,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2022-12-13 13:20:43,296 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-12-13 13:20:43,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-12-13 13:20:43,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2022-12-13 13:20:43,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2022-12-13 13:20:43,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2022-12-13 13:20:43,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:43,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-12-13 13:20:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2022-12-13 13:20:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-12-13 13:20:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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-12-13 13:20:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-12-13 13:20:43,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-12-13 13:20:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:43,352 INFO L428 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-12-13 13:20:43,352 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 13:20:43,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2022-12-13 13:20:43,362 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-12-13 13:20:43,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:43,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:43,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:43,363 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:43,363 INFO L748 eck$LassoCheckResult]: Stem: 6295#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 6255#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6256#L169-1 [2022-12-13 13:20:43,363 INFO L750 eck$LassoCheckResult]: Loop: 6256#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6371#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 6369#L73 assume !(0 != main_~p1~0#1); 6365#L73-2 assume !(0 != main_~p2~0#1); 6363#L77-1 assume !(0 != main_~p3~0#1); 6359#L81-1 assume !(0 != main_~p4~0#1); 6355#L85-1 assume !(0 != main_~p5~0#1); 6351#L89-1 assume !(0 != main_~p6~0#1); 6347#L93-1 assume !(0 != main_~p7~0#1); 6345#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6343#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6341#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6339#L109-1 assume !(0 != main_~p11~0#1); 6336#L113-1 assume !(0 != main_~p1~0#1); 6337#L119-1 assume !(0 != main_~p2~0#1); 6407#L124-1 assume !(0 != main_~p3~0#1); 6402#L129-1 assume !(0 != main_~p4~0#1); 6398#L134-1 assume !(0 != main_~p5~0#1); 6394#L139-1 assume !(0 != main_~p6~0#1); 6390#L144-1 assume !(0 != main_~p7~0#1); 6387#L149-1 assume !(0 != main_~p8~0#1); 6383#L154-1 assume !(0 != main_~p9~0#1); 6379#L159-1 assume !(0 != main_~p10~0#1); 6375#L164-1 assume !(0 != main_~p11~0#1); 6256#L169-1 [2022-12-13 13:20:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-12-13 13:20:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433801378] [2022-12-13 13:20:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:43,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,374 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2022-12-13 13:20:43,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148311226] [2022-12-13 13:20:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148311226] [2022-12-13 13:20:43,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148311226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608018607] [2022-12-13 13:20:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,399 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:43,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:43,399 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:43,419 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-12-13 13:20:43,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2022-12-13 13:20:43,435 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-12-13 13:20:43,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-12-13 13:20:43,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2022-12-13 13:20:43,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2022-12-13 13:20:43,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2022-12-13 13:20:43,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:43,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-12-13 13:20:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2022-12-13 13:20:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2022-12-13 13:20:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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-12-13 13:20:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-12-13 13:20:43,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-12-13 13:20:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:43,503 INFO L428 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-12-13 13:20:43,503 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 13:20:43,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2022-12-13 13:20:43,516 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-12-13 13:20:43,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:43,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:43,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:43,516 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:43,516 INFO L748 eck$LassoCheckResult]: Stem: 12379#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 12345#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 12346#L169-1 [2022-12-13 13:20:43,516 INFO L750 eck$LassoCheckResult]: Loop: 12346#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12486#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 12482#L73 assume !(0 != main_~p1~0#1); 12475#L73-2 assume !(0 != main_~p2~0#1); 12470#L77-1 assume !(0 != main_~p3~0#1); 12463#L81-1 assume !(0 != main_~p4~0#1); 12455#L85-1 assume !(0 != main_~p5~0#1); 12447#L89-1 assume !(0 != main_~p6~0#1); 12439#L93-1 assume !(0 != main_~p7~0#1); 12433#L97-1 assume !(0 != main_~p8~0#1); 12428#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12425#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12421#L109-1 assume !(0 != main_~p11~0#1); 12422#L113-1 assume !(0 != main_~p1~0#1); 12411#L119-1 assume !(0 != main_~p2~0#1); 12413#L124-1 assume !(0 != main_~p3~0#1); 12563#L129-1 assume !(0 != main_~p4~0#1); 12561#L134-1 assume !(0 != main_~p5~0#1); 12551#L139-1 assume !(0 != main_~p6~0#1); 12547#L144-1 assume !(0 != main_~p7~0#1); 12544#L149-1 assume !(0 != main_~p8~0#1); 12540#L154-1 assume !(0 != main_~p9~0#1); 12509#L159-1 assume !(0 != main_~p10~0#1); 12495#L164-1 assume !(0 != main_~p11~0#1); 12346#L169-1 [2022-12-13 13:20:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-12-13 13:20:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215622234] [2022-12-13 13:20:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2022-12-13 13:20:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98052468] [2022-12-13 13:20:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98052468] [2022-12-13 13:20:43,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98052468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18200120] [2022-12-13 13:20:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,544 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:43,545 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:43,572 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-12-13 13:20:43,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2022-12-13 13:20:43,617 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-12-13 13:20:43,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-12-13 13:20:43,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2022-12-13 13:20:43,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2022-12-13 13:20:43,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2022-12-13 13:20:43,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:43,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-12-13 13:20:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2022-12-13 13:20:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2022-12-13 13:20:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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-12-13 13:20:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-12-13 13:20:43,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-12-13 13:20:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:43,788 INFO L428 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-12-13 13:20:43,789 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 13:20:43,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2022-12-13 13:20:43,809 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-12-13 13:20:43,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:43,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:43,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:43,809 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:43,810 INFO L748 eck$LassoCheckResult]: Stem: 24366#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 24323#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 24324#L169-1 [2022-12-13 13:20:43,810 INFO L750 eck$LassoCheckResult]: Loop: 24324#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24516#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 24501#L73 assume !(0 != main_~p1~0#1); 24503#L73-2 assume !(0 != main_~p2~0#1); 24480#L77-1 assume !(0 != main_~p3~0#1); 24481#L81-1 assume !(0 != main_~p4~0#1); 24457#L85-1 assume !(0 != main_~p5~0#1); 24459#L89-1 assume !(0 != main_~p6~0#1); 24433#L93-1 assume !(0 != main_~p7~0#1); 24435#L97-1 assume !(0 != main_~p8~0#1); 24571#L101-1 assume !(0 != main_~p9~0#1); 24570#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24569#L109-1 assume !(0 != main_~p11~0#1); 24567#L113-1 assume !(0 != main_~p1~0#1); 24563#L119-1 assume !(0 != main_~p2~0#1); 24560#L124-1 assume !(0 != main_~p3~0#1); 24555#L129-1 assume !(0 != main_~p4~0#1); 24551#L134-1 assume !(0 != main_~p5~0#1); 24547#L139-1 assume !(0 != main_~p6~0#1); 24543#L144-1 assume !(0 != main_~p7~0#1); 24540#L149-1 assume !(0 != main_~p8~0#1); 24541#L154-1 assume !(0 != main_~p9~0#1); 24532#L159-1 assume !(0 != main_~p10~0#1); 24531#L164-1 assume !(0 != main_~p11~0#1); 24324#L169-1 [2022-12-13 13:20:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-12-13 13:20:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703794583] [2022-12-13 13:20:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:43,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2022-12-13 13:20:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165455259] [2022-12-13 13:20:43,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:43,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165455259] [2022-12-13 13:20:43,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165455259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181175390] [2022-12-13 13:20:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,843 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:20:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:43,843 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-13 13:20:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:43,891 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-12-13 13:20:43,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2022-12-13 13:20:43,937 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-12-13 13:20:44,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-12-13 13:20:44,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2022-12-13 13:20:44,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2022-12-13 13:20:44,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2022-12-13 13:20:44,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:44,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-12-13 13:20:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2022-12-13 13:20:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2022-12-13 13:20:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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-12-13 13:20:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-12-13 13:20:44,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-12-13 13:20:44,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:44,227 INFO L428 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-12-13 13:20:44,227 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 13:20:44,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2022-12-13 13:20:44,260 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-12-13 13:20:44,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:44,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:44,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:20:44,261 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, 1, 1, 1, 1, 1] [2022-12-13 13:20:44,261 INFO L748 eck$LassoCheckResult]: Stem: 47926#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 47884#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 47885#L169-1 [2022-12-13 13:20:44,261 INFO L750 eck$LassoCheckResult]: Loop: 47885#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48302#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 48299#L73 assume !(0 != main_~p1~0#1); 48295#L73-2 assume !(0 != main_~p2~0#1); 48292#L77-1 assume !(0 != main_~p3~0#1); 48289#L81-1 assume !(0 != main_~p4~0#1); 48285#L85-1 assume !(0 != main_~p5~0#1); 48280#L89-1 assume !(0 != main_~p6~0#1); 48276#L93-1 assume !(0 != main_~p7~0#1); 48272#L97-1 assume !(0 != main_~p8~0#1); 48268#L101-1 assume !(0 != main_~p9~0#1); 48269#L105-1 assume !(0 != main_~p10~0#1); 48277#L109-1 assume !(0 != main_~p11~0#1); 48274#L113-1 assume !(0 != main_~p1~0#1); 48270#L119-1 assume !(0 != main_~p2~0#1); 48266#L124-1 assume !(0 != main_~p3~0#1); 48261#L129-1 assume !(0 != main_~p4~0#1); 48258#L134-1 assume !(0 != main_~p5~0#1); 48224#L139-1 assume !(0 != main_~p6~0#1); 48211#L144-1 assume !(0 != main_~p7~0#1); 48209#L149-1 assume !(0 != main_~p8~0#1); 48205#L154-1 assume !(0 != main_~p9~0#1); 48206#L159-1 assume !(0 != main_~p10~0#1); 48307#L164-1 assume !(0 != main_~p11~0#1); 47885#L169-1 [2022-12-13 13:20:44,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-12-13 13:20:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092838586] [2022-12-13 13:20:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2022-12-13 13:20:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625863812] [2022-12-13 13:20:44,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2022-12-13 13:20:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628288036] [2022-12-13 13:20:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 01:20:44 BoogieIcfgContainer [2022-12-13 13:20:44,657 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 13:20:44,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:20:44,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:20:44,658 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:20:44,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:42" (3/4) ... [2022-12-13 13:20:44,660 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 13:20:44,686 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:20:44,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:20:44,687 INFO L158 Benchmark]: Toolchain (without parser) took 2795.26ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 101.0MB in the beginning and 62.2MB in the end (delta: 38.7MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2022-12-13 13:20:44,687 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:20:44,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.30ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 89.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:20:44,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.33ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:20:44,688 INFO L158 Benchmark]: Boogie Preprocessor took 16.92ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 86.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:20:44,688 INFO L158 Benchmark]: RCFGBuilder took 304.04ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 73.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 13:20:44,688 INFO L158 Benchmark]: BuchiAutomizer took 2225.02ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 73.3MB in the beginning and 64.3MB in the end (delta: 8.9MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2022-12-13 13:20:44,688 INFO L158 Benchmark]: Witness Printer took 28.84ms. Allocated memory is still 211.8MB. Free memory was 64.3MB in the beginning and 62.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:20:44,689 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.30ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 89.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.33ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.92ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 86.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.04ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 73.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2225.02ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 73.3MB in the beginning and 64.3MB in the end (delta: 8.9MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 28.84ms. Allocated memory is still 211.8MB. Free memory was 64.3MB in the beginning and 62.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 796 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:20:44,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca0e2b8-6013-46f6-8b63-3bf0e5ee6bab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)