./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:07:01,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:07:01,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:07:01,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:07:01,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:07:01,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:07:01,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:07:01,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:07:01,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:07:01,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:07:01,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:07:01,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:07:01,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:07:01,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:07:01,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:07:01,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:07:01,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:07:01,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:07:01,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:07:01,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:07:01,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:07:01,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:07:01,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:07:01,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:07:01,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:07:01,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:07:01,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:07:01,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:07:01,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:07:01,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:07:01,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:07:01,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:07:01,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:07:01,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:07:01,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:07:01,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:07:01,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:07:01,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:07:01,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:07:01,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:07:01,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:07:01,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-21 16:07:01,832 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:07:01,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:07:01,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:07:01,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:07:01,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:07:01,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:07:01,839 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:07:01,839 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 16:07:01,839 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 16:07:01,840 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 16:07:01,841 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 16:07:01,841 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 16:07:01,842 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 16:07:01,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:07:01,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:07:01,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:07:01,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:07:01,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:07:01,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:07:01,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 16:07:01,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 16:07:01,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 16:07:01,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:07:01,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:07:01,845 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 16:07:01,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:07:01,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 16:07:01,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:07:01,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:07:01,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:07:01,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:07:01,849 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 16:07:01,850 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_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/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_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-11-21 16:07:02,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:07:02,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:07:02,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:07:02,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:07:02,259 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:07:02,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/locks/test_locks_11.c [2022-11-21 16:07:05,463 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:07:05,689 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:07:05,690 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/sv-benchmarks/c/locks/test_locks_11.c [2022-11-21 16:07:05,697 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/data/3567bc298/d39c8a39219f4d7885af359fde443dab/FLAG7ed902497 [2022-11-21 16:07:05,713 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/data/3567bc298/d39c8a39219f4d7885af359fde443dab [2022-11-21 16:07:05,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:07:05,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:07:05,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:07:05,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:07:05,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:07:05,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:05,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d6bcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05, skipping insertion in model container [2022-11-21 16:07:05,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:05,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:07:05,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:07:05,911 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_3b85ee37-00b2-4b20-956d-1d6c63a82432/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-11-21 16:07:05,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:07:05,925 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:07:05,948 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_3b85ee37-00b2-4b20-956d-1d6c63a82432/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-11-21 16:07:05,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:07:05,962 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:07:05,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05 WrapperNode [2022-11-21 16:07:05,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:07:05,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:07:05,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:07:05,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:07:05,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:05,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:05,997 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2022-11-21 16:07:05,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:07:05,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:07:05,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:07:05,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:07:06,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,020 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:07:06,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:07:06,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:07:06,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:07:06,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (1/1) ... [2022-11-21 16:07:06,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:07:06,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:07:06,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:07:06,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 16:07:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:07:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:07:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:07:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:07:06,183 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:07:06,185 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:07:06,403 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:07:06,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:07:06,411 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 16:07:06,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:07:06 BoogieIcfgContainer [2022-11-21 16:07:06,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:07:06,415 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 16:07:06,415 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 16:07:06,420 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 16:07:06,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:07:06,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 04:07:05" (1/3) ... [2022-11-21 16:07:06,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c1b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:07:06, skipping insertion in model container [2022-11-21 16:07:06,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:07:06,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:05" (2/3) ... [2022-11-21 16:07:06,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c1b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:07:06, skipping insertion in model container [2022-11-21 16:07:06,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:07:06,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:07:06" (3/3) ... [2022-11-21 16:07:06,426 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2022-11-21 16:07:06,491 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 16:07:06,491 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 16:07:06,491 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 16:07:06,491 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 16:07:06,491 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 16:07:06,491 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 16:07:06,492 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 16:07:06,492 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 16:07:06,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:06,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-21 16:07:06,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:06,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:06,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:06,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:06,529 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 16:07:06,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:06,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-21 16:07:06,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:06,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:06,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:06,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:06,545 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); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 27#L169-1true [2022-11-21 16:07:06,546 INFO L750 eck$LassoCheckResult]: Loop: 27#L169-1true assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14#L46true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 40#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 41#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L77-1true assume !(0 != main_~p3~0#1); 5#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 18#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 21#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 29#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 35#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 25#L109-1true assume !(0 != main_~p11~0#1); 20#L113-1true assume !(0 != main_~p1~0#1); 36#L119-1true assume !(0 != main_~p2~0#1); 8#L124-1true assume !(0 != main_~p3~0#1); 11#L129-1true assume !(0 != main_~p4~0#1); 19#L134-1true assume !(0 != main_~p5~0#1); 10#L139-1true assume !(0 != main_~p6~0#1); 3#L144-1true assume !(0 != main_~p7~0#1); 34#L149-1true assume !(0 != main_~p8~0#1); 17#L154-1true assume !(0 != main_~p9~0#1); 7#L159-1true assume !(0 != main_~p10~0#1); 38#L164-1true assume !(0 != main_~p11~0#1); 27#L169-1true [2022-11-21 16:07:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-21 16:07:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:06,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456674979] [2022-11-21 16:07:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:06,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:06,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2022-11-21 16:07:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:06,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367763365] [2022-11-21 16:07:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:06,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:06,838 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-21 16:07:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:06,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367763365] [2022-11-21 16:07:06,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367763365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:06,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:06,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808846288] [2022-11-21 16:07:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:06,847 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:06,892 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:06,981 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2022-11-21 16:07:06,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2022-11-21 16:07:06,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-11-21 16:07:06,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2022-11-21 16:07:06,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-11-21 16:07:06,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-11-21 16:07:06,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2022-11-21 16:07:06,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:06,996 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-11-21 16:07:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2022-11-21 16:07:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-21 16:07:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2022-11-21 16:07:07,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-11-21 16:07:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:07,044 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-11-21 16:07:07,044 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 16:07:07,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2022-11-21 16:07:07,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-11-21 16:07:07,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:07,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:07,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:07,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:07,049 INFO L748 eck$LassoCheckResult]: Stem: 164#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); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 146#L169-1 [2022-11-21 16:07:07,049 INFO L750 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 179#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 178#L73 assume !(0 != main_~p1~0#1); 174#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 168#L77-1 assume !(0 != main_~p3~0#1); 135#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 136#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 159#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 149#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 150#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 169#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 170#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 177#L109-1 assume !(0 != main_~p11~0#1); 175#L113-1 assume !(0 != main_~p1~0#1); 176#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 194#L129-1 assume !(0 != main_~p4~0#1); 192#L134-1 assume !(0 != main_~p5~0#1); 190#L139-1 assume !(0 != main_~p6~0#1); 188#L144-1 assume !(0 != main_~p7~0#1); 186#L149-1 assume !(0 != main_~p8~0#1); 157#L154-1 assume !(0 != main_~p9~0#1); 139#L159-1 assume !(0 != main_~p10~0#1); 141#L164-1 assume !(0 != main_~p11~0#1); 146#L169-1 [2022-11-21 16:07:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-21 16:07:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787885205] [2022-11-21 16:07:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2022-11-21 16:07:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566085137] [2022-11-21 16:07:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:07,236 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-21 16:07:07,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:07,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566085137] [2022-11-21 16:07:07,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566085137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:07,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:07,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153931707] [2022-11-21 16:07:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:07,243 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:07,244 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:07,273 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-11-21 16:07:07,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2022-11-21 16:07:07,277 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-11-21 16:07:07,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2022-11-21 16:07:07,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-11-21 16:07:07,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2022-11-21 16:07:07,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2022-11-21 16:07:07,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:07,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-11-21 16:07:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2022-11-21 16:07:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-21 16:07:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2022-11-21 16:07:07,294 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-11-21 16:07:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:07,295 INFO L428 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-11-21 16:07:07,296 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 16:07:07,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2022-11-21 16:07:07,299 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-11-21 16:07:07,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:07,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:07,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:07,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:07,300 INFO L748 eck$LassoCheckResult]: Stem: 379#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); 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 361#L169-1 [2022-11-21 16:07:07,301 INFO L750 eck$LassoCheckResult]: Loop: 361#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 369#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 370#L73 assume !(0 != main_~p1~0#1); 425#L73-2 assume !(0 != main_~p2~0#1); 424#L77-1 assume !(0 != main_~p3~0#1); 421#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 418#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 415#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 412#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 409#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 406#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 404#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 395#L109-1 assume !(0 != main_~p11~0#1); 396#L113-1 assume !(0 != main_~p1~0#1); 400#L119-1 assume !(0 != main_~p2~0#1); 357#L124-1 assume !(0 != main_~p3~0#1); 358#L129-1 assume !(0 != main_~p4~0#1); 353#L134-1 assume !(0 != main_~p5~0#1); 362#L139-1 assume !(0 != main_~p6~0#1); 363#L144-1 assume !(0 != main_~p7~0#1); 456#L149-1 assume !(0 != main_~p8~0#1); 454#L154-1 assume !(0 != main_~p9~0#1); 452#L159-1 assume !(0 != main_~p10~0#1); 388#L164-1 assume !(0 != main_~p11~0#1); 361#L169-1 [2022-11-21 16:07:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-21 16:07:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048225773] [2022-11-21 16:07:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2022-11-21 16:07:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085210731] [2022-11-21 16:07:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:07,375 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-21 16:07:07,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:07,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085210731] [2022-11-21 16:07:07,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085210731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:07,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:07,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:07,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863076923] [2022-11-21 16:07:07,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:07,377 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:07,379 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:07,402 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-11-21 16:07:07,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2022-11-21 16:07:07,420 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-11-21 16:07:07,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2022-11-21 16:07:07,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2022-11-21 16:07:07,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-11-21 16:07:07,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2022-11-21 16:07:07,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:07,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-11-21 16:07:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2022-11-21 16:07:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-21 16:07:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2022-11-21 16:07:07,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-11-21 16:07:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:07,464 INFO L428 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-11-21 16:07:07,464 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-21 16:07:07,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2022-11-21 16:07:07,467 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-11-21 16:07:07,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:07,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:07,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:07,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:07,469 INFO L748 eck$LassoCheckResult]: Stem: 793#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); 774#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 775#L169-1 [2022-11-21 16:07:07,469 INFO L750 eck$LassoCheckResult]: Loop: 775#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 917#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 916#L73 assume !(0 != main_~p1~0#1); 914#L73-2 assume !(0 != main_~p2~0#1); 910#L77-1 assume !(0 != main_~p3~0#1); 906#L81-1 assume !(0 != main_~p4~0#1); 902#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 898#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 894#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 890#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 886#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 882#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 878#L109-1 assume !(0 != main_~p11~0#1); 872#L113-1 assume !(0 != main_~p1~0#1); 873#L119-1 assume !(0 != main_~p2~0#1); 940#L124-1 assume !(0 != main_~p3~0#1); 937#L129-1 assume !(0 != main_~p4~0#1); 936#L134-1 assume !(0 != main_~p5~0#1); 933#L139-1 assume !(0 != main_~p6~0#1); 848#L144-1 assume !(0 != main_~p7~0#1); 843#L149-1 assume !(0 != main_~p8~0#1); 842#L154-1 assume !(0 != main_~p9~0#1); 831#L159-1 assume !(0 != main_~p10~0#1); 830#L164-1 assume !(0 != main_~p11~0#1); 775#L169-1 [2022-11-21 16:07:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-21 16:07:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415745755] [2022-11-21 16:07:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:07,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2022-11-21 16:07:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265188919] [2022-11-21 16:07:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:07,569 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-21 16:07:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:07,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265188919] [2022-11-21 16:07:07,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265188919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:07,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:07,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939807179] [2022-11-21 16:07:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:07,571 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:07,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:07,573 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:07,601 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-11-21 16:07:07,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2022-11-21 16:07:07,608 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-11-21 16:07:07,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2022-11-21 16:07:07,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-11-21 16:07:07,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2022-11-21 16:07:07,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2022-11-21 16:07:07,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:07,619 INFO L218 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-11-21 16:07:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2022-11-21 16:07:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-11-21 16:07:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2022-11-21 16:07:07,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-11-21 16:07:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:07,653 INFO L428 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-11-21 16:07:07,653 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-21 16:07:07,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2022-11-21 16:07:07,657 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-11-21 16:07:07,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:07,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:07,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:07,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:07,659 INFO L748 eck$LassoCheckResult]: Stem: 1600#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); 1580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 1581#L169-1 [2022-11-21 16:07:07,659 INFO L750 eck$LassoCheckResult]: Loop: 1581#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1663#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 1661#L73 assume !(0 != main_~p1~0#1); 1657#L73-2 assume !(0 != main_~p2~0#1); 1655#L77-1 assume !(0 != main_~p3~0#1); 1651#L81-1 assume !(0 != main_~p4~0#1); 1647#L85-1 assume !(0 != main_~p5~0#1); 1645#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1643#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1641#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1639#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1637#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1635#L109-1 assume !(0 != main_~p11~0#1); 1632#L113-1 assume !(0 != main_~p1~0#1); 1633#L119-1 assume !(0 != main_~p2~0#1); 1699#L124-1 assume !(0 != main_~p3~0#1); 1694#L129-1 assume !(0 != main_~p4~0#1); 1690#L134-1 assume !(0 != main_~p5~0#1); 1687#L139-1 assume !(0 != main_~p6~0#1); 1683#L144-1 assume !(0 != main_~p7~0#1); 1679#L149-1 assume !(0 != main_~p8~0#1); 1675#L154-1 assume !(0 != main_~p9~0#1); 1671#L159-1 assume !(0 != main_~p10~0#1); 1667#L164-1 assume !(0 != main_~p11~0#1); 1581#L169-1 [2022-11-21 16:07:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-21 16:07:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548771221] [2022-11-21 16:07:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:07,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2022-11-21 16:07:07,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573933235] [2022-11-21 16:07:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:07,722 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-21 16:07:07,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:07,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573933235] [2022-11-21 16:07:07,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573933235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:07,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:07,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086416813] [2022-11-21 16:07:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:07,725 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:07,726 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:07,755 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-11-21 16:07:07,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2022-11-21 16:07:07,766 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-11-21 16:07:07,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-11-21 16:07:07,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2022-11-21 16:07:07,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2022-11-21 16:07:07,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2022-11-21 16:07:07,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:07,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-11-21 16:07:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2022-11-21 16:07:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-11-21 16:07:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-11-21 16:07:07,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-11-21 16:07:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:07,835 INFO L428 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-11-21 16:07:07,835 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-21 16:07:07,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2022-11-21 16:07:07,843 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-11-21 16:07:07,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:07,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:07,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:07,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:07,847 INFO L748 eck$LassoCheckResult]: Stem: 3176#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); 3158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 3159#L169-1 [2022-11-21 16:07:07,847 INFO L750 eck$LassoCheckResult]: Loop: 3159#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3298#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 3294#L73 assume !(0 != main_~p1~0#1); 3290#L73-2 assume !(0 != main_~p2~0#1); 3288#L77-1 assume !(0 != main_~p3~0#1); 3286#L81-1 assume !(0 != main_~p4~0#1); 3282#L85-1 assume !(0 != main_~p5~0#1); 3278#L89-1 assume !(0 != main_~p6~0#1); 3276#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3274#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3272#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3270#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3268#L109-1 assume !(0 != main_~p11~0#1); 3264#L113-1 assume !(0 != main_~p1~0#1); 3260#L119-1 assume !(0 != main_~p2~0#1); 3257#L124-1 assume !(0 != main_~p3~0#1); 3253#L129-1 assume !(0 != main_~p4~0#1); 3254#L134-1 assume !(0 != main_~p5~0#1); 3321#L139-1 assume !(0 != main_~p6~0#1); 3318#L144-1 assume !(0 != main_~p7~0#1); 3314#L149-1 assume !(0 != main_~p8~0#1); 3310#L154-1 assume !(0 != main_~p9~0#1); 3306#L159-1 assume !(0 != main_~p10~0#1); 3302#L164-1 assume !(0 != main_~p11~0#1); 3159#L169-1 [2022-11-21 16:07:07,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-21 16:07:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454364186] [2022-11-21 16:07:07,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:07,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2022-11-21 16:07:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:07,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212783486] [2022-11-21 16:07:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:07,970 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-21 16:07:07,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:07,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212783486] [2022-11-21 16:07:07,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212783486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:07,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:07,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:07,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858610529] [2022-11-21 16:07:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:07,972 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:07,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:07,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:07,974 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:08,015 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-11-21 16:07:08,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2022-11-21 16:07:08,049 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-11-21 16:07:08,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-11-21 16:07:08,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2022-11-21 16:07:08,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2022-11-21 16:07:08,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2022-11-21 16:07:08,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:08,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-11-21 16:07:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2022-11-21 16:07:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-11-21 16:07:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-11-21 16:07:08,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-11-21 16:07:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:08,124 INFO L428 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-11-21 16:07:08,127 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-21 16:07:08,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2022-11-21 16:07:08,144 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-11-21 16:07:08,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:08,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:08,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:08,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:08,148 INFO L748 eck$LassoCheckResult]: Stem: 6275#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); 6255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6256#L169-1 [2022-11-21 16:07:08,149 INFO L750 eck$LassoCheckResult]: Loop: 6256#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6363#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 6361#L73 assume !(0 != main_~p1~0#1); 6357#L73-2 assume !(0 != main_~p2~0#1); 6355#L77-1 assume !(0 != main_~p3~0#1); 6351#L81-1 assume !(0 != main_~p4~0#1); 6347#L85-1 assume !(0 != main_~p5~0#1); 6343#L89-1 assume !(0 != main_~p6~0#1); 6339#L93-1 assume !(0 != main_~p7~0#1); 6337#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6335#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6333#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6331#L109-1 assume !(0 != main_~p11~0#1); 6328#L113-1 assume !(0 != main_~p1~0#1); 6329#L119-1 assume !(0 != main_~p2~0#1); 6399#L124-1 assume !(0 != main_~p3~0#1); 6394#L129-1 assume !(0 != main_~p4~0#1); 6390#L134-1 assume !(0 != main_~p5~0#1); 6386#L139-1 assume !(0 != main_~p6~0#1); 6382#L144-1 assume !(0 != main_~p7~0#1); 6379#L149-1 assume !(0 != main_~p8~0#1); 6375#L154-1 assume !(0 != main_~p9~0#1); 6371#L159-1 assume !(0 != main_~p10~0#1); 6367#L164-1 assume !(0 != main_~p11~0#1); 6256#L169-1 [2022-11-21 16:07:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-21 16:07:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:08,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846262145] [2022-11-21 16:07:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:08,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:08,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2022-11-21 16:07:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:08,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756341824] [2022-11-21 16:07:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:08,255 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-21 16:07:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:08,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756341824] [2022-11-21 16:07:08,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756341824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:08,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:08,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:08,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443827514] [2022-11-21 16:07:08,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:08,259 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:08,261 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:08,311 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-11-21 16:07:08,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2022-11-21 16:07:08,385 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-11-21 16:07:08,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-11-21 16:07:08,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2022-11-21 16:07:08,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2022-11-21 16:07:08,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2022-11-21 16:07:08,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:08,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-11-21 16:07:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2022-11-21 16:07:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2022-11-21 16:07:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-11-21 16:07:08,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-11-21 16:07:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:08,520 INFO L428 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-11-21 16:07:08,521 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-21 16:07:08,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2022-11-21 16:07:08,544 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-11-21 16:07:08,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:08,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:08,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:08,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:08,547 INFO L748 eck$LassoCheckResult]: Stem: 12367#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); 12345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 12346#L169-1 [2022-11-21 16:07:08,547 INFO L750 eck$LassoCheckResult]: Loop: 12346#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12506#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 12500#L73 assume !(0 != main_~p1~0#1); 12494#L73-2 assume !(0 != main_~p2~0#1); 12495#L77-1 assume !(0 != main_~p3~0#1); 12689#L81-1 assume !(0 != main_~p4~0#1); 12687#L85-1 assume !(0 != main_~p5~0#1); 12685#L89-1 assume !(0 != main_~p6~0#1); 12450#L93-1 assume !(0 != main_~p7~0#1); 12452#L97-1 assume !(0 != main_~p8~0#1); 12638#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12634#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12630#L109-1 assume !(0 != main_~p11~0#1); 12626#L113-1 assume !(0 != main_~p1~0#1); 12627#L119-1 assume !(0 != main_~p2~0#1); 12684#L124-1 assume !(0 != main_~p3~0#1); 12681#L129-1 assume !(0 != main_~p4~0#1); 12679#L134-1 assume !(0 != main_~p5~0#1); 12677#L139-1 assume !(0 != main_~p6~0#1); 12675#L144-1 assume !(0 != main_~p7~0#1); 12672#L149-1 assume !(0 != main_~p8~0#1); 12670#L154-1 assume !(0 != main_~p9~0#1); 12532#L159-1 assume !(0 != main_~p10~0#1); 12518#L164-1 assume !(0 != main_~p11~0#1); 12346#L169-1 [2022-11-21 16:07:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-21 16:07:08,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:08,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010967039] [2022-11-21 16:07:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:08,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:08,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2022-11-21 16:07:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:08,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253271130] [2022-11-21 16:07:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:08,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-21 16:07:08,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:08,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253271130] [2022-11-21 16:07:08,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253271130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:08,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:08,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822503072] [2022-11-21 16:07:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:08,637 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:08,639 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:08,698 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-11-21 16:07:08,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2022-11-21 16:07:08,765 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-11-21 16:07:08,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-11-21 16:07:08,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2022-11-21 16:07:08,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2022-11-21 16:07:08,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2022-11-21 16:07:08,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:08,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-11-21 16:07:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2022-11-21 16:07:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2022-11-21 16:07:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-11-21 16:07:09,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-11-21 16:07:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:09,093 INFO L428 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-11-21 16:07:09,093 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-21 16:07:09,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2022-11-21 16:07:09,127 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-11-21 16:07:09,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:09,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:09,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:09,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:09,130 INFO L748 eck$LassoCheckResult]: Stem: 24342#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); 24323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 24324#L169-1 [2022-11-21 16:07:09,130 INFO L750 eck$LassoCheckResult]: Loop: 24324#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24735#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 24728#L73 assume !(0 != main_~p1~0#1); 24720#L73-2 assume !(0 != main_~p2~0#1); 24716#L77-1 assume !(0 != main_~p3~0#1); 24714#L81-1 assume !(0 != main_~p4~0#1); 24712#L85-1 assume !(0 != main_~p5~0#1); 24710#L89-1 assume !(0 != main_~p6~0#1); 24709#L93-1 assume !(0 != main_~p7~0#1); 24707#L97-1 assume !(0 != main_~p8~0#1); 24706#L101-1 assume !(0 != main_~p9~0#1); 24702#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24699#L109-1 assume !(0 != main_~p11~0#1); 24695#L113-1 assume !(0 != main_~p1~0#1); 24681#L119-1 assume !(0 != main_~p2~0#1); 24678#L124-1 assume !(0 != main_~p3~0#1); 24669#L129-1 assume !(0 != main_~p4~0#1); 24659#L134-1 assume !(0 != main_~p5~0#1); 24649#L139-1 assume !(0 != main_~p6~0#1); 24639#L144-1 assume !(0 != main_~p7~0#1); 24630#L149-1 assume !(0 != main_~p8~0#1); 24631#L154-1 assume !(0 != main_~p9~0#1); 24832#L159-1 assume !(0 != main_~p10~0#1); 24746#L164-1 assume !(0 != main_~p11~0#1); 24324#L169-1 [2022-11-21 16:07:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-11-21 16:07:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:09,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726402615] [2022-11-21 16:07:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:09,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:09,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:09,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2022-11-21 16:07:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:09,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749115835] [2022-11-21 16:07:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:09,203 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-21 16:07:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:09,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749115835] [2022-11-21 16:07:09,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749115835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:09,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:09,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:09,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573154826] [2022-11-21 16:07:09,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:09,205 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:07:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:09,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:09,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:09,206 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:09,286 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-11-21 16:07:09,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2022-11-21 16:07:09,391 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-11-21 16:07:09,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-11-21 16:07:09,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2022-11-21 16:07:09,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2022-11-21 16:07:09,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2022-11-21 16:07:09,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:07:09,717 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-11-21 16:07:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2022-11-21 16:07:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2022-11-21 16:07:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:07:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-11-21 16:07:10,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-11-21 16:07:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:10,137 INFO L428 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-11-21 16:07:10,137 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-21 16:07:10,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2022-11-21 16:07:10,219 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-11-21 16:07:10,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:07:10,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:07:10,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:07:10,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:10,222 INFO L748 eck$LassoCheckResult]: Stem: 47906#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); 47884#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 47885#L169-1 [2022-11-21 16:07:10,222 INFO L750 eck$LassoCheckResult]: Loop: 47885#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48601#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 48598#L73 assume !(0 != main_~p1~0#1); 48594#L73-2 assume !(0 != main_~p2~0#1); 48591#L77-1 assume !(0 != main_~p3~0#1); 48588#L81-1 assume !(0 != main_~p4~0#1); 48584#L85-1 assume !(0 != main_~p5~0#1); 48580#L89-1 assume !(0 != main_~p6~0#1); 48576#L93-1 assume !(0 != main_~p7~0#1); 48572#L97-1 assume !(0 != main_~p8~0#1); 48568#L101-1 assume !(0 != main_~p9~0#1); 48569#L105-1 assume !(0 != main_~p10~0#1); 48527#L109-1 assume !(0 != main_~p11~0#1); 48528#L113-1 assume !(0 != main_~p1~0#1); 48643#L119-1 assume !(0 != main_~p2~0#1); 48637#L124-1 assume !(0 != main_~p3~0#1); 48631#L129-1 assume !(0 != main_~p4~0#1); 48626#L134-1 assume !(0 != main_~p5~0#1); 48622#L139-1 assume !(0 != main_~p6~0#1); 48617#L144-1 assume !(0 != main_~p7~0#1); 48612#L149-1 assume !(0 != main_~p8~0#1); 48609#L154-1 assume !(0 != main_~p9~0#1); 48607#L159-1 assume !(0 != main_~p10~0#1); 48606#L164-1 assume !(0 != main_~p11~0#1); 47885#L169-1 [2022-11-21 16:07:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-11-21 16:07:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:10,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052471075] [2022-11-21 16:07:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2022-11-21 16:07:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:10,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689031044] [2022-11-21 16:07:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:10,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:10,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:10,280 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2022-11-21 16:07:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:10,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847756503] [2022-11-21 16:07:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:07:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:07:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:07:10,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 04:07:10 BoogieIcfgContainer [2022-11-21 16:07:10,949 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-21 16:07:10,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:07:10,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:07:10,951 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:07:10,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:07:06" (3/4) ... [2022-11-21 16:07:10,954 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-21 16:07:10,999 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:07:10,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:07:11,000 INFO L158 Benchmark]: Toolchain (without parser) took 5283.09ms. Allocated memory was 172.0MB in the beginning and 411.0MB in the end (delta: 239.1MB). Free memory was 125.2MB in the beginning and 207.8MB in the end (delta: -82.6MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. [2022-11-21 16:07:11,000 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 172.0MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:07:11,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.00ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 113.8MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:07:11,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.75ms. Allocated memory is still 172.0MB. Free memory was 113.8MB in the beginning and 112.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:07:11,002 INFO L158 Benchmark]: Boogie Preprocessor took 25.52ms. Allocated memory is still 172.0MB. Free memory was 112.4MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:07:11,002 INFO L158 Benchmark]: RCFGBuilder took 389.24ms. Allocated memory is still 172.0MB. Free memory was 110.5MB in the beginning and 97.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:07:11,003 INFO L158 Benchmark]: BuchiAutomizer took 4534.41ms. Allocated memory was 172.0MB in the beginning and 411.0MB in the end (delta: 239.1MB). Free memory was 97.7MB in the beginning and 209.9MB in the end (delta: -112.2MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-11-21 16:07:11,003 INFO L158 Benchmark]: Witness Printer took 49.25ms. Allocated memory is still 411.0MB. Free memory was 209.9MB in the beginning and 207.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:07:11,005 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.25ms. Allocated memory is still 172.0MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.00ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 113.8MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.75ms. Allocated memory is still 172.0MB. Free memory was 113.8MB in the beginning and 112.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.52ms. Allocated memory is still 172.0MB. Free memory was 112.4MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.24ms. Allocated memory is still 172.0MB. Free memory was 110.5MB in the beginning and 97.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4534.41ms. Allocated memory was 172.0MB in the beginning and 411.0MB in the end (delta: 239.1MB). Free memory was 97.7MB in the beginning and 209.9MB in the end (delta: -112.2MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Witness Printer took 49.25ms. Allocated memory is still 411.0MB. Free memory was 209.9MB in the beginning and 207.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 796 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-21 16:07:11,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b85ee37-00b2-4b20-956d-1d6c63a82432/bin/uautomizer-vX5HgA9Q3a/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)