./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b 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_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN --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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- 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-6b4ec56 [2022-11-20 10:31:19,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:31:19,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:31:19,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:31:19,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:31:19,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:31:19,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:31:19,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:31:19,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:31:19,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:31:19,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:31:19,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:31:19,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:31:19,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:31:19,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:31:19,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:31:19,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:31:19,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:31:19,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:31:19,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:31:19,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:31:19,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:31:19,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:31:19,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:31:19,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:31:19,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:31:19,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:31:19,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:31:19,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:31:19,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:31:19,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:31:19,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:31:19,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:31:19,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:31:19,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:31:19,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:31:19,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:31:19,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:31:19,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:31:19,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:31:19,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:31:19,212 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-20 10:31:19,254 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:31:19,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:31:19,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:31:19,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:31:19,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:31:19,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:31:19,257 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:31:19,258 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 10:31:19,258 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 10:31:19,258 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 10:31:19,259 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 10:31:19,260 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 10:31:19,260 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 10:31:19,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:31:19,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:31:19,261 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:31:19,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:31:19,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:31:19,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:31:19,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 10:31:19,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 10:31:19,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 10:31:19,262 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:31:19,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:31:19,262 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 10:31:19,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:31:19,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 10:31:19,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:31:19,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:31:19,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:31:19,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:31:19,266 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 10:31:19,267 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_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/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_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2022-11-20 10:31:19,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:31:19,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:31:19,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:31:19,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:31:19,597 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:31:19,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/locks/test_locks_10.c [2022-11-20 10:31:22,574 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:31:22,892 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:31:22,893 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/sv-benchmarks/c/locks/test_locks_10.c [2022-11-20 10:31:22,903 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/data/598f03ba2/3531fb90d307489fa7ff48f34181ff89/FLAG5fadd4db0 [2022-11-20 10:31:22,921 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/data/598f03ba2/3531fb90d307489fa7ff48f34181ff89 [2022-11-20 10:31:22,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:31:22,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:31:22,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:22,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:31:22,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:31:22,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:22" (1/1) ... [2022-11-20 10:31:22,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34eeeb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:22, skipping insertion in model container [2022-11-20 10:31:22,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:22" (1/1) ... [2022-11-20 10:31:22,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:31:22,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:31:23,132 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_714bdba4-f983-4ad7-80d7-6f37fe523999/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2022-11-20 10:31:23,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:23,149 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:31:23,170 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_714bdba4-f983-4ad7-80d7-6f37fe523999/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2022-11-20 10:31:23,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:23,182 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:31:23,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23 WrapperNode [2022-11-20 10:31:23,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:23,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:23,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:31:23,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:31:23,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,215 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-11-20 10:31:23,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:23,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:31:23,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:31:23,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:31:23,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,236 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:31:23,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:31:23,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:31:23,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:31:23,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (1/1) ... [2022-11-20 10:31:23,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:31:23,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:23,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:31:23,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 10:31:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:31:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:31:23,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:31:23,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:31:23,395 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:31:23,398 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:31:23,648 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:31:23,661 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:31:23,661 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:31:23,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:23 BoogieIcfgContainer [2022-11-20 10:31:23,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:31:23,665 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 10:31:23,665 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 10:31:23,670 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 10:31:23,671 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:31:23,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:31:22" (1/3) ... [2022-11-20 10:31:23,673 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@233376c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:31:23, skipping insertion in model container [2022-11-20 10:31:23,673 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:31:23,673 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:23" (2/3) ... [2022-11-20 10:31:23,674 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@233376c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:31:23, skipping insertion in model container [2022-11-20 10:31:23,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:31:23,674 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:23" (3/3) ... [2022-11-20 10:31:23,676 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2022-11-20 10:31:23,738 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 10:31:23,739 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 10:31:23,739 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 10:31:23,739 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 10:31:23,739 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 10:31:23,739 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 10:31:23,740 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 10:31:23,740 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 10:31:23,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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-20 10:31:23,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-11-20 10:31:23,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:23,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:23,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:23,771 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] [2022-11-20 10:31:23,771 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 10:31:23,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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-20 10:31:23,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-11-20 10:31:23,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:23,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:23,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:23,776 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] [2022-11-20 10:31:23,784 INFO L748 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 8#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_~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_~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;havoc main_~cond~0#1; 29#L155-1true [2022-11-20 10:31:23,785 INFO L750 eck$LassoCheckResult]: Loop: 29#L155-1true assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 26#L43true 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; 30#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 9#L68-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 3#L72-1true assume !(0 != main_~p3~0#1); 18#L76-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 17#L80-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 31#L84-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 19#L88-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6#L92-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L96-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7#L100-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 38#L104-1true assume !(0 != main_~p1~0#1); 24#L110-1true assume !(0 != main_~p2~0#1); 33#L115-1true assume !(0 != main_~p3~0#1); 16#L120-1true assume !(0 != main_~p4~0#1); 28#L125-1true assume !(0 != main_~p5~0#1); 35#L130-1true assume !(0 != main_~p6~0#1); 15#L135-1true assume !(0 != main_~p7~0#1); 13#L140-1true assume !(0 != main_~p8~0#1); 39#L145-1true assume !(0 != main_~p9~0#1); 10#L150-1true assume !(0 != main_~p10~0#1); 29#L155-1true [2022-11-20 10:31:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-20 10:31:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:23,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829777982] [2022-11-20 10:31:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:23,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:23,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2022-11-20 10:31:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:23,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44169830] [2022-11-20 10:31:23,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:23,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,162 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-20 10:31:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44169830] [2022-11-20 10:31:24,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44169830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:24,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:24,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423573938] [2022-11-20 10:31:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,170 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:24,220 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:24,298 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2022-11-20 10:31:24,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2022-11-20 10:31:24,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2022-11-20 10:31:24,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2022-11-20 10:31:24,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-11-20 10:31:24,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-11-20 10:31:24,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2022-11-20 10:31:24,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:24,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-11-20 10:31:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2022-11-20 10:31:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:31:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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-20 10:31:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2022-11-20 10:31:24,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-11-20 10:31:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:24,362 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-11-20 10:31:24,362 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 10:31:24,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2022-11-20 10:31:24,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2022-11-20 10:31:24,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:24,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:24,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:24,365 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] [2022-11-20 10:31:24,366 INFO L748 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 132#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_~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_~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;havoc main_~cond~0#1; 133#L155-1 [2022-11-20 10:31:24,366 INFO L750 eck$LassoCheckResult]: Loop: 133#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 154#L43 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; 155#L68 assume !(0 != main_~p1~0#1); 134#L68-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 123#L72-1 assume !(0 != main_~p3~0#1); 124#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 145#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 146#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 167#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 166#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 125#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 126#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 131#L104-1 assume !(0 != main_~p1~0#1); 151#L110-1 assume !(0 != main_~p2~0#1); 152#L115-1 assume !(0 != main_~p3~0#1); 144#L120-1 assume !(0 != main_~p4~0#1); 128#L125-1 assume !(0 != main_~p5~0#1); 138#L130-1 assume !(0 != main_~p6~0#1); 143#L135-1 assume !(0 != main_~p7~0#1); 139#L140-1 assume !(0 != main_~p8~0#1); 140#L145-1 assume !(0 != main_~p9~0#1); 135#L150-1 assume !(0 != main_~p10~0#1); 133#L155-1 [2022-11-20 10:31:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-20 10:31:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396860233] [2022-11-20 10:31:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2022-11-20 10:31:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536314956] [2022-11-20 10:31:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,482 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-20 10:31:24,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:24,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536314956] [2022-11-20 10:31:24,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536314956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:24,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:24,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277749270] [2022-11-20 10:31:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,484 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:24,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:24,486 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:24,520 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2022-11-20 10:31:24,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2022-11-20 10:31:24,523 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-11-20 10:31:24,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2022-11-20 10:31:24,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-11-20 10:31:24,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-11-20 10:31:24,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2022-11-20 10:31:24,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:24,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-11-20 10:31:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2022-11-20 10:31:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-20 10:31:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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-20 10:31:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2022-11-20 10:31:24,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-11-20 10:31:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:24,544 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-11-20 10:31:24,544 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 10:31:24,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2022-11-20 10:31:24,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-11-20 10:31:24,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:24,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:24,547 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:24,547 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] [2022-11-20 10:31:24,547 INFO L748 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 328#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_~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_~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;havoc main_~cond~0#1; 329#L155-1 [2022-11-20 10:31:24,547 INFO L750 eck$LassoCheckResult]: Loop: 329#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 373#L43 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; 371#L68 assume !(0 != main_~p1~0#1); 369#L68-2 assume !(0 != main_~p2~0#1); 368#L72-1 assume !(0 != main_~p3~0#1); 367#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 366#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 365#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 364#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 363#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 362#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 361#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 359#L104-1 assume !(0 != main_~p1~0#1); 360#L110-1 assume !(0 != main_~p2~0#1); 391#L115-1 assume !(0 != main_~p3~0#1); 388#L120-1 assume !(0 != main_~p4~0#1); 385#L125-1 assume !(0 != main_~p5~0#1); 383#L130-1 assume !(0 != main_~p6~0#1); 381#L135-1 assume !(0 != main_~p7~0#1); 379#L140-1 assume !(0 != main_~p8~0#1); 377#L145-1 assume !(0 != main_~p9~0#1); 375#L150-1 assume !(0 != main_~p10~0#1); 329#L155-1 [2022-11-20 10:31:24,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,548 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-20 10:31:24,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526799227] [2022-11-20 10:31:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2022-11-20 10:31:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735356511] [2022-11-20 10:31:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,651 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-20 10:31:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:24,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735356511] [2022-11-20 10:31:24,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735356511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:24,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:24,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505913609] [2022-11-20 10:31:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,653 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:24,654 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:24,675 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2022-11-20 10:31:24,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2022-11-20 10:31:24,678 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2022-11-20 10:31:24,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2022-11-20 10:31:24,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2022-11-20 10:31:24,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2022-11-20 10:31:24,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2022-11-20 10:31:24,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:24,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-11-20 10:31:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2022-11-20 10:31:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-11-20 10:31:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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-20 10:31:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2022-11-20 10:31:24,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-11-20 10:31:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:24,700 INFO L428 stractBuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-11-20 10:31:24,700 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 10:31:24,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2022-11-20 10:31:24,702 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2022-11-20 10:31:24,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:24,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:24,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:24,703 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] [2022-11-20 10:31:24,704 INFO L748 eck$LassoCheckResult]: Stem: 729#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 706#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_~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_~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;havoc main_~cond~0#1; 707#L155-1 [2022-11-20 10:31:24,704 INFO L750 eck$LassoCheckResult]: Loop: 707#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 776#L43 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; 773#L68 assume !(0 != main_~p1~0#1); 769#L68-2 assume !(0 != main_~p2~0#1); 767#L72-1 assume !(0 != main_~p3~0#1); 764#L76-1 assume !(0 != main_~p4~0#1); 765#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 759#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 760#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 755#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 756#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 751#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 752#L104-1 assume !(0 != main_~p1~0#1); 807#L110-1 assume !(0 != main_~p2~0#1); 805#L115-1 assume !(0 != main_~p3~0#1); 802#L120-1 assume !(0 != main_~p4~0#1); 799#L125-1 assume !(0 != main_~p5~0#1); 795#L130-1 assume !(0 != main_~p6~0#1); 791#L135-1 assume !(0 != main_~p7~0#1); 787#L140-1 assume !(0 != main_~p8~0#1); 783#L145-1 assume !(0 != main_~p9~0#1); 781#L150-1 assume !(0 != main_~p10~0#1); 707#L155-1 [2022-11-20 10:31:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-20 10:31:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625127432] [2022-11-20 10:31:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:24,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2022-11-20 10:31:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979778944] [2022-11-20 10:31:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,756 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-20 10:31:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:24,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979778944] [2022-11-20 10:31:24,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979778944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:24,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:24,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731175594] [2022-11-20 10:31:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,758 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:24,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:24,759 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:24,781 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2022-11-20 10:31:24,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2022-11-20 10:31:24,786 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2022-11-20 10:31:24,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2022-11-20 10:31:24,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2022-11-20 10:31:24,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2022-11-20 10:31:24,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2022-11-20 10:31:24,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:24,794 INFO L218 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-11-20 10:31:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2022-11-20 10:31:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-11-20 10:31:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 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-20 10:31:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2022-11-20 10:31:24,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-11-20 10:31:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:24,817 INFO L428 stractBuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-11-20 10:31:24,817 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 10:31:24,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2022-11-20 10:31:24,820 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2022-11-20 10:31:24,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:24,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:24,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:24,821 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] [2022-11-20 10:31:24,821 INFO L748 eck$LassoCheckResult]: Stem: 1462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1440#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_~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_~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;havoc main_~cond~0#1; 1441#L155-1 [2022-11-20 10:31:24,821 INFO L750 eck$LassoCheckResult]: Loop: 1441#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1511#L43 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; 1508#L68 assume !(0 != main_~p1~0#1); 1504#L68-2 assume !(0 != main_~p2~0#1); 1501#L72-1 assume !(0 != main_~p3~0#1); 1498#L76-1 assume !(0 != main_~p4~0#1); 1499#L80-1 assume !(0 != main_~p5~0#1); 1562#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1559#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1556#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1553#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1551#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1548#L104-1 assume !(0 != main_~p1~0#1); 1544#L110-1 assume !(0 != main_~p2~0#1); 1541#L115-1 assume !(0 != main_~p3~0#1); 1537#L120-1 assume !(0 != main_~p4~0#1); 1534#L125-1 assume !(0 != main_~p5~0#1); 1532#L130-1 assume !(0 != main_~p6~0#1); 1528#L135-1 assume !(0 != main_~p7~0#1); 1524#L140-1 assume !(0 != main_~p8~0#1); 1520#L145-1 assume !(0 != main_~p9~0#1); 1516#L150-1 assume !(0 != main_~p10~0#1); 1441#L155-1 [2022-11-20 10:31:24,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-20 10:31:24,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355978543] [2022-11-20 10:31:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:24,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2022-11-20 10:31:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059341563] [2022-11-20 10:31:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,946 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-20 10:31:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:24,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059341563] [2022-11-20 10:31:24,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059341563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:24,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:24,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437595276] [2022-11-20 10:31:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,948 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:24,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:24,949 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:24,984 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2022-11-20 10:31:24,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2022-11-20 10:31:24,997 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2022-11-20 10:31:25,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2022-11-20 10:31:25,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2022-11-20 10:31:25,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2022-11-20 10:31:25,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2022-11-20 10:31:25,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:25,013 INFO L218 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-11-20 10:31:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2022-11-20 10:31:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2022-11-20 10:31:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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-20 10:31:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2022-11-20 10:31:25,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-11-20 10:31:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:25,044 INFO L428 stractBuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-11-20 10:31:25,044 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 10:31:25,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2022-11-20 10:31:25,050 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2022-11-20 10:31:25,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:25,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:25,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:25,051 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] [2022-11-20 10:31:25,051 INFO L748 eck$LassoCheckResult]: Stem: 2899#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2874#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_~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_~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;havoc main_~cond~0#1; 2875#L155-1 [2022-11-20 10:31:25,051 INFO L750 eck$LassoCheckResult]: Loop: 2875#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 2948#L43 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; 2949#L68 assume !(0 != main_~p1~0#1); 3042#L68-2 assume !(0 != main_~p2~0#1); 3037#L72-1 assume !(0 != main_~p3~0#1); 3031#L76-1 assume !(0 != main_~p4~0#1); 3032#L80-1 assume !(0 != main_~p5~0#1); 3051#L84-1 assume !(0 != main_~p6~0#1); 3047#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3045#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3039#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3035#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3028#L104-1 assume !(0 != main_~p1~0#1); 3001#L110-1 assume !(0 != main_~p2~0#1); 2998#L115-1 assume !(0 != main_~p3~0#1); 2993#L120-1 assume !(0 != main_~p4~0#1); 2989#L125-1 assume !(0 != main_~p5~0#1); 2987#L130-1 assume !(0 != main_~p6~0#1); 2972#L135-1 assume !(0 != main_~p7~0#1); 2971#L140-1 assume !(0 != main_~p8~0#1); 3067#L145-1 assume !(0 != main_~p9~0#1); 2956#L150-1 assume !(0 != main_~p10~0#1); 2875#L155-1 [2022-11-20 10:31:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-20 10:31:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878481686] [2022-11-20 10:31:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:25,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:25,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2022-11-20 10:31:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127539085] [2022-11-20 10:31:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,093 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-20 10:31:25,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127539085] [2022-11-20 10:31:25,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127539085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:25,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:25,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040009508] [2022-11-20 10:31:25,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:25,094 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:25,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:25,096 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:25,117 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2022-11-20 10:31:25,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2022-11-20 10:31:25,136 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2022-11-20 10:31:25,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2022-11-20 10:31:25,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2022-11-20 10:31:25,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2022-11-20 10:31:25,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2022-11-20 10:31:25,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:25,151 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-11-20 10:31:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2022-11-20 10:31:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2022-11-20 10:31:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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-20 10:31:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2022-11-20 10:31:25,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-11-20 10:31:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:25,196 INFO L428 stractBuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-11-20 10:31:25,199 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 10:31:25,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2022-11-20 10:31:25,212 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2022-11-20 10:31:25,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:25,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:25,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:25,214 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] [2022-11-20 10:31:25,215 INFO L748 eck$LassoCheckResult]: Stem: 5706#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 5684#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_~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_~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;havoc main_~cond~0#1; 5685#L155-1 [2022-11-20 10:31:25,215 INFO L750 eck$LassoCheckResult]: Loop: 5685#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 5885#L43 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; 5882#L68 assume !(0 != main_~p1~0#1); 5878#L68-2 assume !(0 != main_~p2~0#1); 5875#L72-1 assume !(0 != main_~p3~0#1); 5873#L76-1 assume !(0 != main_~p4~0#1); 5863#L80-1 assume !(0 != main_~p5~0#1); 5865#L84-1 assume !(0 != main_~p6~0#1); 5850#L88-1 assume !(0 != main_~p7~0#1); 5852#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5838#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5839#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5825#L104-1 assume !(0 != main_~p1~0#1); 5826#L110-1 assume !(0 != main_~p2~0#1); 5804#L115-1 assume !(0 != main_~p3~0#1); 5803#L120-1 assume !(0 != main_~p4~0#1); 5903#L125-1 assume !(0 != main_~p5~0#1); 5901#L130-1 assume !(0 != main_~p6~0#1); 5899#L135-1 assume !(0 != main_~p7~0#1); 5896#L140-1 assume !(0 != main_~p8~0#1); 5894#L145-1 assume !(0 != main_~p9~0#1); 5890#L150-1 assume !(0 != main_~p10~0#1); 5685#L155-1 [2022-11-20 10:31:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-20 10:31:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784733862] [2022-11-20 10:31:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:25,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:25,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2022-11-20 10:31:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475782521] [2022-11-20 10:31:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,305 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-20 10:31:25,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:25,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475782521] [2022-11-20 10:31:25,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475782521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:25,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:25,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:25,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510303059] [2022-11-20 10:31:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:25,307 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:25,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:25,308 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:25,350 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2022-11-20 10:31:25,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2022-11-20 10:31:25,385 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2022-11-20 10:31:25,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2022-11-20 10:31:25,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2022-11-20 10:31:25,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2022-11-20 10:31:25,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2022-11-20 10:31:25,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:25,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-11-20 10:31:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2022-11-20 10:31:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2022-11-20 10:31:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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-20 10:31:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2022-11-20 10:31:25,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-11-20 10:31:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:25,494 INFO L428 stractBuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-11-20 10:31:25,494 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-20 10:31:25,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2022-11-20 10:31:25,559 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2022-11-20 10:31:25,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:25,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:25,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:25,560 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] [2022-11-20 10:31:25,560 INFO L748 eck$LassoCheckResult]: Stem: 11221#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 11198#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_~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_~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;havoc main_~cond~0#1; 11199#L155-1 [2022-11-20 10:31:25,560 INFO L750 eck$LassoCheckResult]: Loop: 11199#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 11355#L43 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; 11352#L68 assume !(0 != main_~p1~0#1); 11348#L68-2 assume !(0 != main_~p2~0#1); 11345#L72-1 assume !(0 != main_~p3~0#1); 11342#L76-1 assume !(0 != main_~p4~0#1); 11291#L80-1 assume !(0 != main_~p5~0#1); 11277#L84-1 assume !(0 != main_~p6~0#1); 11279#L88-1 assume !(0 != main_~p7~0#1); 11480#L92-1 assume !(0 != main_~p8~0#1); 11481#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11482#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11439#L104-1 assume !(0 != main_~p1~0#1); 11436#L110-1 assume !(0 != main_~p2~0#1); 11423#L115-1 assume !(0 != main_~p3~0#1); 11416#L120-1 assume !(0 != main_~p4~0#1); 11411#L125-1 assume !(0 != main_~p5~0#1); 11404#L130-1 assume !(0 != main_~p6~0#1); 11398#L135-1 assume !(0 != main_~p7~0#1); 11393#L140-1 assume !(0 != main_~p8~0#1); 11387#L145-1 assume !(0 != main_~p9~0#1); 11360#L150-1 assume !(0 != main_~p10~0#1); 11199#L155-1 [2022-11-20 10:31:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-20 10:31:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970874262] [2022-11-20 10:31:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:25,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:25,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2022-11-20 10:31:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709027283] [2022-11-20 10:31:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,631 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-20 10:31:25,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:25,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709027283] [2022-11-20 10:31:25,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709027283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:25,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:25,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528242840] [2022-11-20 10:31:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:25,632 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:25,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:25,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:25,633 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:25,687 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2022-11-20 10:31:25,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2022-11-20 10:31:25,743 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2022-11-20 10:31:25,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2022-11-20 10:31:25,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2022-11-20 10:31:25,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2022-11-20 10:31:25,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2022-11-20 10:31:25,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:25,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-11-20 10:31:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2022-11-20 10:31:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2022-11-20 10:31:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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-20 10:31:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2022-11-20 10:31:25,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-11-20 10:31:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:25,950 INFO L428 stractBuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-11-20 10:31:25,950 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-20 10:31:25,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2022-11-20 10:31:26,000 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2022-11-20 10:31:26,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:26,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:26,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:26,001 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] [2022-11-20 10:31:26,002 INFO L748 eck$LassoCheckResult]: Stem: 22047#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 22025#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_~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_~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;havoc main_~cond~0#1; 22026#L155-1 [2022-11-20 10:31:26,002 INFO L750 eck$LassoCheckResult]: Loop: 22026#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 22222#L43 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; 22212#L68 assume !(0 != main_~p1~0#1); 22214#L68-2 assume !(0 != main_~p2~0#1); 22204#L72-1 assume !(0 != main_~p3~0#1); 22205#L76-1 assume !(0 != main_~p4~0#1); 22437#L80-1 assume !(0 != main_~p5~0#1); 22435#L84-1 assume !(0 != main_~p6~0#1); 22431#L88-1 assume !(0 != main_~p7~0#1); 22427#L92-1 assume !(0 != main_~p8~0#1); 22423#L96-1 assume !(0 != main_~p9~0#1); 22421#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 22417#L104-1 assume !(0 != main_~p1~0#1); 22413#L110-1 assume !(0 != main_~p2~0#1); 22409#L115-1 assume !(0 != main_~p3~0#1); 22406#L120-1 assume !(0 != main_~p4~0#1); 22401#L125-1 assume !(0 != main_~p5~0#1); 22402#L130-1 assume !(0 != main_~p6~0#1); 22391#L135-1 assume !(0 != main_~p7~0#1); 22392#L140-1 assume !(0 != main_~p8~0#1); 22228#L145-1 assume !(0 != main_~p9~0#1); 22229#L150-1 assume !(0 != main_~p10~0#1); 22026#L155-1 [2022-11-20 10:31:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-11-20 10:31:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:26,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406771451] [2022-11-20 10:31:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2022-11-20 10:31:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:26,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416589299] [2022-11-20 10:31:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,073 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-20 10:31:26,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:26,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416589299] [2022-11-20 10:31:26,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416589299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:26,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:26,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:31:26,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910429588] [2022-11-20 10:31:26,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:26,075 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:31:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:26,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:26,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:26,076 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-20 10:31:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:26,159 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2022-11-20 10:31:26,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2022-11-20 10:31:26,248 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2022-11-20 10:31:26,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2022-11-20 10:31:26,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2022-11-20 10:31:26,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2022-11-20 10:31:26,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2022-11-20 10:31:26,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:26,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-11-20 10:31:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2022-11-20 10:31:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2022-11-20 10:31:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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-20 10:31:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2022-11-20 10:31:26,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-11-20 10:31:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:26,701 INFO L428 stractBuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-11-20 10:31:26,701 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-20 10:31:26,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2022-11-20 10:31:26,753 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2022-11-20 10:31:26,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:31:26,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:31:26,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:31:26,755 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] [2022-11-20 10:31:26,755 INFO L748 eck$LassoCheckResult]: Stem: 43305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 43283#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_~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_~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;havoc main_~cond~0#1; 43284#L155-1 [2022-11-20 10:31:26,756 INFO L750 eck$LassoCheckResult]: Loop: 43284#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 43670#L43 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; 43660#L68 assume !(0 != main_~p1~0#1); 43662#L68-2 assume !(0 != main_~p2~0#1); 43651#L72-1 assume !(0 != main_~p3~0#1); 43652#L76-1 assume !(0 != main_~p4~0#1); 43620#L80-1 assume !(0 != main_~p5~0#1); 43622#L84-1 assume !(0 != main_~p6~0#1); 43715#L88-1 assume !(0 != main_~p7~0#1); 43717#L92-1 assume !(0 != main_~p8~0#1); 43779#L96-1 assume !(0 != main_~p9~0#1); 43776#L100-1 assume !(0 != main_~p10~0#1); 43772#L104-1 assume !(0 != main_~p1~0#1); 43768#L110-1 assume !(0 != main_~p2~0#1); 43765#L115-1 assume !(0 != main_~p3~0#1); 43761#L120-1 assume !(0 != main_~p4~0#1); 43444#L125-1 assume !(0 != main_~p5~0#1); 43445#L130-1 assume !(0 != main_~p6~0#1); 43434#L135-1 assume !(0 != main_~p7~0#1); 43436#L140-1 assume !(0 != main_~p8~0#1); 43679#L145-1 assume !(0 != main_~p9~0#1); 43681#L150-1 assume !(0 != main_~p10~0#1); 43284#L155-1 [2022-11-20 10:31:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-11-20 10:31:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:26,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142862041] [2022-11-20 10:31:26,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:26,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2022-11-20 10:31:26,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:26,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879770526] [2022-11-20 10:31:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2022-11-20 10:31:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:26,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509196859] [2022-11-20 10:31:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:26,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:27,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:27,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:31:27 BoogieIcfgContainer [2022-11-20 10:31:27,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-20 10:31:27,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:31:27,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:31:27,405 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:31:27,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:23" (3/4) ... [2022-11-20 10:31:27,408 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-20 10:31:27,474 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:31:27,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:31:27,475 INFO L158 Benchmark]: Toolchain (without parser) took 4548.65ms. Allocated memory was 186.6MB in the beginning and 234.9MB in the end (delta: 48.2MB). Free memory was 152.7MB in the beginning and 103.1MB in the end (delta: 49.6MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2022-11-20 10:31:27,475 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 127.9MB. Free memory was 71.2MB in the beginning and 71.1MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:31:27,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.61ms. Allocated memory is still 186.6MB. Free memory was 152.7MB in the beginning and 142.0MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:31:27,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.76ms. Allocated memory is still 186.6MB. Free memory was 142.0MB in the beginning and 140.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:31:27,476 INFO L158 Benchmark]: Boogie Preprocessor took 23.09ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 139.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:31:27,476 INFO L158 Benchmark]: RCFGBuilder took 423.85ms. Allocated memory is still 186.6MB. Free memory was 139.0MB in the beginning and 125.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:31:27,477 INFO L158 Benchmark]: BuchiAutomizer took 3740.11ms. Allocated memory was 186.6MB in the beginning and 234.9MB in the end (delta: 48.2MB). Free memory was 125.2MB in the beginning and 106.1MB in the end (delta: 19.1MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2022-11-20 10:31:27,477 INFO L158 Benchmark]: Witness Printer took 69.18ms. Allocated memory is still 234.9MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:31:27,479 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.23ms. Allocated memory is still 127.9MB. Free memory was 71.2MB in the beginning and 71.1MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.61ms. Allocated memory is still 186.6MB. Free memory was 152.7MB in the beginning and 142.0MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.76ms. Allocated memory is still 186.6MB. Free memory was 142.0MB in the beginning and 140.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.09ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 139.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.85ms. Allocated memory is still 186.6MB. Free memory was 139.0MB in the beginning and 125.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3740.11ms. Allocated memory was 186.6MB in the beginning and 234.9MB in the end (delta: 48.2MB). Free memory was 125.2MB in the beginning and 106.1MB in the end (delta: 19.1MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * Witness Printer took 69.18ms. Allocated memory is still 234.9MB. Free memory was 105.2MB in the beginning and 103.1MB 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 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.3s 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, 374 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 1167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 722 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: 41]: 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; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: 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; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:31:27,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_714bdba4-f983-4ad7-80d7-6f37fe523999/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)