./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:51:26,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:51:26,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:51:26,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:51:26,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:51:26,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:51:26,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:51:26,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:51:26,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:51:26,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:51:26,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:51:26,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:51:26,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:51:26,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:51:26,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:51:26,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:51:26,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:51:26,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:51:26,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:51:26,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:51:26,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:51:26,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:51:26,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:51:26,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:51:26,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:51:26,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:51:26,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:51:26,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:51:26,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:51:26,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:51:26,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:51:26,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:51:26,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:51:26,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:51:26,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:51:26,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:51:27,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:51:27,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:51:27,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:51:27,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:51:27,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:51:27,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-23 02:51:27,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:51:27,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:51:27,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:51:27,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:51:27,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:51:27,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:51:27,040 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:51:27,041 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-23 02:51:27,041 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-23 02:51:27,041 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-23 02:51:27,042 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-23 02:51:27,042 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-23 02:51:27,042 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-23 02:51:27,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:51:27,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:51:27,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:51:27,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:51:27,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:51:27,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:51:27,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-23 02:51:27,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-23 02:51:27,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-23 02:51:27,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:51:27,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:51:27,047 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-23 02:51:27,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:51:27,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-23 02:51:27,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:51:27,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:51:27,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:51:27,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:51:27,050 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-23 02:51:27,051 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_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2022-11-23 02:51:27,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:51:27,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:51:27,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:51:27,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:51:27,395 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:51:27,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2022-11-23 02:51:31,199 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:51:31,638 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:51:31,639 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2022-11-23 02:51:31,656 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/data/6fd005f7f/029c161995ee4893a7e8f7b4ce0d6955/FLAG48a9fe02c [2022-11-23 02:51:31,675 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/data/6fd005f7f/029c161995ee4893a7e8f7b4ce0d6955 [2022-11-23 02:51:31,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:51:31,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:51:31,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:51:31,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:51:31,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:51:31,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:51:31" (1/1) ... [2022-11-23 02:51:31,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3d1598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31, skipping insertion in model container [2022-11-23 02:51:31,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:51:31" (1/1) ... [2022-11-23 02:51:31,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:51:31,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:51:32,154 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_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/sv-benchmarks/c/seq-pthread/cs_stateful-1.i[23400,23413] [2022-11-23 02:51:32,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:51:32,331 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:51:32,369 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_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/sv-benchmarks/c/seq-pthread/cs_stateful-1.i[23400,23413] [2022-11-23 02:51:32,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:51:32,473 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:51:32,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32 WrapperNode [2022-11-23 02:51:32,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:51:32,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:51:32,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:51:32,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:51:32,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,642 INFO L138 Inliner]: procedures = 144, calls = 231, calls flagged for inlining = 51, calls inlined = 141, statements flattened = 2285 [2022-11-23 02:51:32,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:51:32,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:51:32,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:51:32,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:51:32,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:51:32,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:51:32,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:51:32,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:51:32,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (1/1) ... [2022-11-23 02:51:32,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 02:51:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:51:32,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 02:51:32,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-23 02:51:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 02:51:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:51:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:51:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:51:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 02:51:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 02:51:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:51:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 02:51:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:51:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:51:32,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:51:33,338 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:51:33,347 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:51:33,386 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 02:51:33,387 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 02:51:33,410 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 02:51:33,413 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 02:51:33,443 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 02:51:33,444 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 02:51:48,033 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##305: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,034 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##304: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,034 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##309: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,034 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##308: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,035 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,035 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,035 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,035 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,036 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,036 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,037 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,037 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,038 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: assume { :end_inline___CS_cs } true; [2022-11-23 02:51:48,038 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,038 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2022-11-23 02:51:48,039 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-32: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,039 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,039 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2022-11-23 02:51:48,039 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-110: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,040 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,040 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2022-11-23 02:51:48,040 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-188: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,040 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##508: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,047 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##509: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,048 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##513: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,049 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##512: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,050 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,054 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume !(0 != ~__CS_ret~0 % 256); [2022-11-23 02:51:48,055 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,055 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume !(0 != ~__CS_ret~0 % 256); [2022-11-23 02:51:48,055 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,055 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume !(0 != ~__CS_ret~0 % 256); [2022-11-23 02:51:48,056 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,056 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: assume !(0 != ~__CS_ret~0 % 256);assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-11-23 02:51:48,056 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,056 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume !(0 != ~__CS_ret~0 % 256);assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-11-23 02:51:48,058 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,058 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume !(0 != ~__CS_ret~0 % 256);assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-11-23 02:51:48,058 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,059 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume !(0 != ~__CS_ret~0 % 256); [2022-11-23 02:51:48,060 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,060 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume !(0 != ~__CS_ret~0 % 256); [2022-11-23 02:51:48,060 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-11-23 02:51:48,060 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume !(0 != ~__CS_ret~0 % 256); [2022-11-23 02:51:48,061 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##100: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,061 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-11-23 02:51:48,061 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##101: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,061 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256 then ~__CS_ret_PREEMPTED~0 % 256 else ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet4#1; [2022-11-23 02:51:48,062 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:51:48,079 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:51:48,080 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-23 02:51:48,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:48 BoogieIcfgContainer [2022-11-23 02:51:48,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:51:48,084 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-23 02:51:48,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-23 02:51:48,089 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-23 02:51:48,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 02:51:48,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:51:31" (1/3) ... [2022-11-23 02:51:48,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@798f46e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:51:48, skipping insertion in model container [2022-11-23 02:51:48,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 02:51:48,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:32" (2/3) ... [2022-11-23 02:51:48,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@798f46e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:51:48, skipping insertion in model container [2022-11-23 02:51:48,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 02:51:48,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:48" (3/3) ... [2022-11-23 02:51:48,095 INFO L332 chiAutomizerObserver]: Analyzing ICFG cs_stateful-1.i [2022-11-23 02:51:48,171 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-23 02:51:48,172 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-23 02:51:48,172 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-23 02:51:48,172 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-23 02:51:48,172 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-23 02:51:48,173 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-23 02:51:48,173 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-23 02:51:48,173 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-23 02:51:48,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 496 states, 495 states have (on average 1.490909090909091) internal successors, (738), 495 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:51:48,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-23 02:51:48,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:51:48,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:51:48,246 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 02:51:48,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-23 02:51:48,246 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-23 02:51:48,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 496 states, 495 states have (on average 1.490909090909091) internal successors, (738), 495 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:51:48,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-23 02:51:48,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:51:48,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:51:48,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 02:51:48,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-23 02:51:48,272 INFO L748 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;#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);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 417#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~nondet49#1, main_#t~pre47#1, main_~j~2#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~pre46#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 177#L758-3true [2022-11-23 02:51:48,272 INFO L750 eck$LassoCheckResult]: Loop: 177#L758-3true assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 171#L759-3true assume !(main_~j~2#1 < 3); 351#L759-4true call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1; 8#L758-2true main_#t~pre46#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre46#1; 177#L758-3true [2022-11-23 02:51:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-23 02:51:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:51:48,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041248456] [2022-11-23 02:51:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:51:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:48,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:51:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:48,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:51:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2022-11-23 02:51:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:51:48,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321524264] [2022-11-23 02:51:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:51:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:51:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:51:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:51:48,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321524264] [2022-11-23 02:51:48,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321524264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:51:48,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:51:48,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:51:48,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936735887] [2022-11-23 02:51:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:51:48,706 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 02:51:48,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:51:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:51:48,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:51:48,752 INFO L87 Difference]: Start difference. First operand has 496 states, 495 states have (on average 1.490909090909091) internal successors, (738), 495 states have internal predecessors, (738), 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 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:51:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:51:48,871 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2022-11-23 02:51:48,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 646 transitions. [2022-11-23 02:51:48,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-11-23 02:51:48,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 9 states and 10 transitions. [2022-11-23 02:51:48,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-23 02:51:48,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-23 02:51:48,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-11-23 02:51:48,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:51:48,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-23 02:51:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-11-23 02:51:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-11-23 02:51:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:51:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-23 02:51:48,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-23 02:51:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:51:48,925 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-23 02:51:48,925 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-23 02:51:48,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-11-23 02:51:48,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-23 02:51:48,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:51:48,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:51:48,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 02:51:48,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-23 02:51:48,927 INFO L748 eck$LassoCheckResult]: Stem: 1006#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;#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);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 1007#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~nondet49#1, main_#t~pre47#1, main_~j~2#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~pre46#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1009#L758-3 [2022-11-23 02:51:48,928 INFO L750 eck$LassoCheckResult]: Loop: 1009#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1003#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1004#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1005#L759-3 assume !(main_~j~2#1 < 3); 1010#L759-4 call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1; 1008#L758-2 main_#t~pre46#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre46#1; 1009#L758-3 [2022-11-23 02:51:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-23 02:51:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:51:48,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371365717] [2022-11-23 02:51:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:51:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:48,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:51:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:49,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:51:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2022-11-23 02:51:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:51:49,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58884625] [2022-11-23 02:51:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:51:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:51:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:51:49,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:51:49,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58884625] [2022-11-23 02:51:49,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58884625] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:51:49,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674237024] [2022-11-23 02:51:49,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:49,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:51:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:51:49,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:51:49,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea6dceeb-d31c-4eb3-8114-5232c94ccd95/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:51:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:51:49,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:51:49,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:51:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:51:49,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:51:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:51:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674237024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:51:49,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:51:49,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-23 02:51:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43464158] [2022-11-23 02:51:49,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:51:49,516 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 02:51:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:51:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:51:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:51:49,518 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:51:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:51:49,573 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-11-23 02:51:49,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-11-23 02:51:49,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-11-23 02:51:49,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2022-11-23 02:51:49,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-23 02:51:49,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-23 02:51:49,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2022-11-23 02:51:49,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:51:49,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-23 02:51:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2022-11-23 02:51:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-23 02:51:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:51:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-23 02:51:49,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-23 02:51:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:51:49,580 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-23 02:51:49,580 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-23 02:51:49,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-11-23 02:51:49,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-11-23 02:51:49,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:51:49,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:51:49,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 02:51:49,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1] [2022-11-23 02:51:49,582 INFO L748 eck$LassoCheckResult]: Stem: 1064#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;#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);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 1065#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~nondet49#1, main_#t~pre47#1, main_~j~2#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~pre46#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1067#L758-3 [2022-11-23 02:51:49,583 INFO L750 eck$LassoCheckResult]: Loop: 1067#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1061#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1062#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1063#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1072#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1071#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1070#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1069#L759-3 assume !(main_~j~2#1 < 3); 1068#L759-4 call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1; 1066#L758-2 main_#t~pre46#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre46#1; 1067#L758-3 [2022-11-23 02:51:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-23 02:51:49,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:51:49,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593673803] [2022-11-23 02:51:49,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:49,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:51:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:49,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:51:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:49,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:51:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2055044605, now seen corresponding path program 2 times [2022-11-23 02:51:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:51:49,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488582674] [2022-11-23 02:51:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:51:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:49,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:51:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:49,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:51:49,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash 149568325, now seen corresponding path program 1 times [2022-11-23 02:51:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:51:49,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056571402] [2022-11-23 02:51:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:51:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:50,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:51:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:51:50,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:54:48,863 WARN L233 SmtUtils]: Spent 2.98m on a formula simplification. DAG size of input: 306 DAG size of output: 290 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)