./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc --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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- 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-5e519f3 [2022-11-02 20:50:53,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:53,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:53,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:53,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:53,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:53,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:53,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:53,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:53,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:53,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:53,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:53,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:53,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:53,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:53,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:53,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:53,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:53,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:53,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:53,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:53,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:53,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:53,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:53,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:53,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:53,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:53,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:53,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:53,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:53,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:53,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:53,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:53,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:53,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:53,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:53,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:53,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:53,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:53,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:53,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:53,784 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 20:50:53,833 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:53,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:53,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:53,834 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:53,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:53,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:53,836 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:53,837 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:50:53,837 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:50:53,837 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:50:53,839 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:50:53,839 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:50:53,839 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:50:53,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:53,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:50:53,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:50:53,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:53,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:50:53,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:53,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:50:53,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:50:53,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:50:53,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:50:53,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:53,842 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:50:53,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:53,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:50:53,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:53,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:53,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:53,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:53,845 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:50:53,846 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_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/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_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-11-02 20:50:54,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:54,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:54,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:54,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:54,301 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:54,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/locks/test_locks_13.c [2022-11-02 20:50:54,401 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/data/b18338aab/7a2088cc6fbe44d4932d91a602fa997d/FLAG74727ce43 [2022-11-02 20:50:54,962 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:54,963 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/sv-benchmarks/c/locks/test_locks_13.c [2022-11-02 20:50:54,979 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/data/b18338aab/7a2088cc6fbe44d4932d91a602fa997d/FLAG74727ce43 [2022-11-02 20:50:55,328 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/data/b18338aab/7a2088cc6fbe44d4932d91a602fa997d [2022-11-02 20:50:55,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:55,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:55,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:55,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:55,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:55,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdfad75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55, skipping insertion in model container [2022-11-02 20:50:55,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:55,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:55,661 WARN L230 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_8051983f-82c5-4d58-8dc2-340ea1890373/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-02 20:50:55,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:55,674 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:55,706 WARN L230 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_8051983f-82c5-4d58-8dc2-340ea1890373/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-02 20:50:55,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:55,724 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:55,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55 WrapperNode [2022-11-02 20:50:55,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:55,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:55,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:55,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:55,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,807 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2022-11-02 20:50:55,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:55,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:55,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:55,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:55,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,863 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:55,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:55,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:55,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:55,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (1/1) ... [2022-11-02 20:50:55,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:55,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:55,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:55,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:55,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:55,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:56,119 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:56,121 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:56,385 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:56,393 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:56,407 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:50:56,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:56 BoogieIcfgContainer [2022-11-02 20:50:56,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:56,412 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:50:56,412 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:50:56,424 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:50:56,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:50:56,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:50:55" (1/3) ... [2022-11-02 20:50:56,427 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1547247c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:50:56, skipping insertion in model container [2022-11-02 20:50:56,427 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:50:56,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:55" (2/3) ... [2022-11-02 20:50:56,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1547247c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:50:56, skipping insertion in model container [2022-11-02 20:50:56,444 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:50:56,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:56" (3/3) ... [2022-11-02 20:50:56,446 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2022-11-02 20:50:56,554 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:50:56,554 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:50:56,554 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:50:56,554 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:50:56,555 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:50:56,555 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:50:56,555 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:50:56,555 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:50:56,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-02 20:50:56,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-11-02 20:50:56,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:56,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:56,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:56,654 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, 1, 1, 1, 1] [2022-11-02 20:50:56,654 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:50:56,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-02 20:50:56,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-11-02 20:50:56,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:56,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:56,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:56,674 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, 1, 1, 1, 1] [2022-11-02 20:50:56,684 INFO L748 eck$LassoCheckResult]: Stem: 22#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); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 13#L197-1true [2022-11-02 20:50:56,687 INFO L750 eck$LassoCheckResult]: Loop: 13#L197-1true assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 43#L52true 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 28#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 15#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 9#L87-1true assume !(0 != main_~p3~0#1); 3#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 45#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 16#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 10#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 25#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 14#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 32#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L119-1true assume !(0 != main_~p11~0#1); 46#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 35#L131-1true assume !(0 != main_~p1~0#1); 12#L137-1true assume !(0 != main_~p2~0#1); 7#L142-1true assume !(0 != main_~p3~0#1); 36#L147-1true assume !(0 != main_~p4~0#1); 11#L152-1true assume !(0 != main_~p5~0#1); 20#L157-1true assume !(0 != main_~p6~0#1); 17#L162-1true assume !(0 != main_~p7~0#1); 18#L167-1true assume !(0 != main_~p8~0#1); 23#L172-1true assume !(0 != main_~p9~0#1); 31#L177-1true assume !(0 != main_~p10~0#1); 47#L182-1true assume !(0 != main_~p11~0#1); 44#L187-1true assume !(0 != main_~p12~0#1); 38#L192-1true assume !(0 != main_~p13~0#1); 13#L197-1true [2022-11-02 20:50:56,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 20:50:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:56,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613798288] [2022-11-02 20:50:56,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:56,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:56,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:56,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2022-11-02 20:50:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:56,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31146970] [2022-11-02 20:50:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,219 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-02 20:50:57,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:57,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31146970] [2022-11-02 20:50:57,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31146970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:57,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:57,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440896191] [2022-11-02 20:50:57,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:57,233 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:57,289 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:57,336 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2022-11-02 20:50:57,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2022-11-02 20:50:57,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-11-02 20:50:57,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2022-11-02 20:50:57,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2022-11-02 20:50:57,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2022-11-02 20:50:57,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2022-11-02 20:50:57,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:57,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-11-02 20:50:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2022-11-02 20:50:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-02 20:50:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 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-02 20:50:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2022-11-02 20:50:57,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-11-02 20:50:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:57,401 INFO L428 stractBuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-11-02 20:50:57,409 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:50:57,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2022-11-02 20:50:57,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-11-02 20:50:57,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:57,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:57,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:57,414 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, 1, 1, 1, 1] [2022-11-02 20:50:57,414 INFO L748 eck$LassoCheckResult]: Stem: 181#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); 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 157#L197-1 [2022-11-02 20:50:57,415 INFO L750 eck$LassoCheckResult]: Loop: 157#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 209#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 208#L83 assume !(0 != main_~p1~0#1); 207#L83-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 206#L87-1 assume !(0 != main_~p3~0#1); 205#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 198#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 174#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 164#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 165#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 202#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L119-1 assume !(0 != main_~p11~0#1); 201#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 185#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 186#L131-1 assume !(0 != main_~p1~0#1); 200#L137-1 assume !(0 != main_~p2~0#1); 231#L142-1 assume !(0 != main_~p3~0#1); 229#L147-1 assume !(0 != main_~p4~0#1); 227#L152-1 assume !(0 != main_~p5~0#1); 225#L157-1 assume !(0 != main_~p6~0#1); 223#L162-1 assume !(0 != main_~p7~0#1); 221#L167-1 assume !(0 != main_~p8~0#1); 218#L172-1 assume !(0 != main_~p9~0#1); 217#L177-1 assume !(0 != main_~p10~0#1); 215#L182-1 assume !(0 != main_~p11~0#1); 212#L187-1 assume !(0 != main_~p12~0#1); 211#L192-1 assume !(0 != main_~p13~0#1); 157#L197-1 [2022-11-02 20:50:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-02 20:50:57,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:57,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025330513] [2022-11-02 20:50:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:57,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:57,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:57,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2022-11-02 20:50:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:57,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361249463] [2022-11-02 20:50:57,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,580 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-02 20:50:57,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361249463] [2022-11-02 20:50:57,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361249463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:57,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:57,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:57,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105861945] [2022-11-02 20:50:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:57,586 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:57,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:57,591 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:57,646 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2022-11-02 20:50:57,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2022-11-02 20:50:57,650 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-11-02 20:50:57,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2022-11-02 20:50:57,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-11-02 20:50:57,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-11-02 20:50:57,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2022-11-02 20:50:57,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:57,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-11-02 20:50:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2022-11-02 20:50:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-02 20:50:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 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-02 20:50:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2022-11-02 20:50:57,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-11-02 20:50:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:57,691 INFO L428 stractBuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-11-02 20:50:57,691 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:50:57,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2022-11-02 20:50:57,694 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-11-02 20:50:57,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:57,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:57,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:57,698 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, 1, 1, 1, 1] [2022-11-02 20:50:57,698 INFO L748 eck$LassoCheckResult]: Stem: 434#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); 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 406#L197-1 [2022-11-02 20:50:57,698 INFO L750 eck$LassoCheckResult]: Loop: 406#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 422#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 454#L83 assume !(0 != main_~p1~0#1); 515#L83-2 assume !(0 != main_~p2~0#1); 413#L87-1 assume !(0 != main_~p3~0#1); 401#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 402#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 425#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 414#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 415#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 467#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 468#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 463#L119-1 assume !(0 != main_~p11~0#1); 464#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 437#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 438#L131-1 assume !(0 != main_~p1~0#1); 509#L137-1 assume !(0 != main_~p2~0#1); 553#L142-1 assume !(0 != main_~p3~0#1); 551#L147-1 assume !(0 != main_~p4~0#1); 549#L152-1 assume !(0 != main_~p5~0#1); 547#L157-1 assume !(0 != main_~p6~0#1); 545#L162-1 assume !(0 != main_~p7~0#1); 543#L167-1 assume !(0 != main_~p8~0#1); 540#L172-1 assume !(0 != main_~p9~0#1); 539#L177-1 assume !(0 != main_~p10~0#1); 537#L182-1 assume !(0 != main_~p11~0#1); 523#L187-1 assume !(0 != main_~p12~0#1); 451#L192-1 assume !(0 != main_~p13~0#1); 406#L197-1 [2022-11-02 20:50:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-02 20:50:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:57,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976250625] [2022-11-02 20:50:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:57,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:57,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2022-11-02 20:50:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:57,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805680493] [2022-11-02 20:50:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:57,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,822 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-02 20:50:57,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:57,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805680493] [2022-11-02 20:50:57,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805680493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:57,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:57,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:57,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842152891] [2022-11-02 20:50:57,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:57,825 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:57,827 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:57,852 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2022-11-02 20:50:57,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2022-11-02 20:50:57,856 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-11-02 20:50:57,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2022-11-02 20:50:57,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2022-11-02 20:50:57,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2022-11-02 20:50:57,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2022-11-02 20:50:57,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:57,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-11-02 20:50:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2022-11-02 20:50:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-11-02 20:50:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 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-02 20:50:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2022-11-02 20:50:57,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-11-02 20:50:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:57,887 INFO L428 stractBuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-11-02 20:50:57,888 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:50:57,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2022-11-02 20:50:57,891 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-11-02 20:50:57,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:57,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:57,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:57,892 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, 1, 1, 1, 1] [2022-11-02 20:50:57,893 INFO L748 eck$LassoCheckResult]: Stem: 920#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); 893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 894#L197-1 [2022-11-02 20:50:57,893 INFO L750 eck$LassoCheckResult]: Loop: 894#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1033#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 1031#L83 assume !(0 != main_~p1~0#1); 1029#L83-2 assume !(0 != main_~p2~0#1); 1030#L87-1 assume !(0 != main_~p3~0#1); 1101#L91-1 assume !(0 != main_~p4~0#1); 1100#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1097#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1094#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1091#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1088#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1086#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1083#L119-1 assume !(0 != main_~p11~0#1); 1081#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1077#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1073#L131-1 assume !(0 != main_~p1~0#1); 1068#L137-1 assume !(0 != main_~p2~0#1); 1021#L142-1 assume !(0 != main_~p3~0#1); 1020#L147-1 assume !(0 != main_~p4~0#1); 1060#L152-1 assume !(0 != main_~p5~0#1); 1056#L157-1 assume !(0 != main_~p6~0#1); 1052#L162-1 assume !(0 != main_~p7~0#1); 1048#L167-1 assume !(0 != main_~p8~0#1); 1044#L172-1 assume !(0 != main_~p9~0#1); 1042#L177-1 assume !(0 != main_~p10~0#1); 1039#L182-1 assume !(0 != main_~p11~0#1); 1036#L187-1 assume !(0 != main_~p12~0#1); 1035#L192-1 assume !(0 != main_~p13~0#1); 894#L197-1 [2022-11-02 20:50:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-02 20:50:57,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:57,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590236592] [2022-11-02 20:50:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:57,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:57,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2022-11-02 20:50:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:57,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105354124] [2022-11-02 20:50:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,952 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-02 20:50:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:57,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105354124] [2022-11-02 20:50:57,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105354124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:57,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:57,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:57,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541878849] [2022-11-02 20:50:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:57,954 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:57,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:57,956 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:57,978 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2022-11-02 20:50:57,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2022-11-02 20:50:57,986 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-11-02 20:50:57,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2022-11-02 20:50:57,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2022-11-02 20:50:57,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2022-11-02 20:50:57,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2022-11-02 20:50:57,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:57,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-11-02 20:50:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2022-11-02 20:50:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-11-02 20:50:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 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-02 20:50:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2022-11-02 20:50:58,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-11-02 20:50:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:58,032 INFO L428 stractBuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-11-02 20:50:58,032 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:50:58,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2022-11-02 20:50:58,037 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-11-02 20:50:58,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:58,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:58,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:58,039 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, 1, 1, 1, 1] [2022-11-02 20:50:58,039 INFO L748 eck$LassoCheckResult]: Stem: 1873#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); 1843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 1844#L197-1 [2022-11-02 20:50:58,040 INFO L750 eck$LassoCheckResult]: Loop: 1844#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1950#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 1948#L83 assume !(0 != main_~p1~0#1); 1944#L83-2 assume !(0 != main_~p2~0#1); 1942#L87-1 assume !(0 != main_~p3~0#1); 1938#L91-1 assume !(0 != main_~p4~0#1); 1935#L95-1 assume !(0 != main_~p5~0#1); 1933#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1931#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1929#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1927#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1925#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1923#L119-1 assume !(0 != main_~p11~0#1); 1921#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1919#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1916#L131-1 assume !(0 != main_~p1~0#1); 1917#L137-1 assume !(0 != main_~p2~0#1); 1994#L142-1 assume !(0 != main_~p3~0#1); 1989#L147-1 assume !(0 != main_~p4~0#1); 1985#L152-1 assume !(0 != main_~p5~0#1); 1982#L157-1 assume !(0 != main_~p6~0#1); 1978#L162-1 assume !(0 != main_~p7~0#1); 1974#L167-1 assume !(0 != main_~p8~0#1); 1969#L172-1 assume !(0 != main_~p9~0#1); 1966#L177-1 assume !(0 != main_~p10~0#1); 1962#L182-1 assume !(0 != main_~p11~0#1); 1957#L187-1 assume !(0 != main_~p12~0#1); 1954#L192-1 assume !(0 != main_~p13~0#1); 1844#L197-1 [2022-11-02 20:50:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-02 20:50:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415713002] [2022-11-02 20:50:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2022-11-02 20:50:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611650547] [2022-11-02 20:50:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,097 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-02 20:50:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:58,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611650547] [2022-11-02 20:50:58,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611650547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:58,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:58,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:58,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524384288] [2022-11-02 20:50:58,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:58,100 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:58,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:58,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:58,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:58,102 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:58,126 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2022-11-02 20:50:58,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2022-11-02 20:50:58,141 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-11-02 20:50:58,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-11-02 20:50:58,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2022-11-02 20:50:58,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2022-11-02 20:50:58,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2022-11-02 20:50:58,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:58,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-11-02 20:50:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2022-11-02 20:50:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2022-11-02 20:50:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 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-02 20:50:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-11-02 20:50:58,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-11-02 20:50:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:58,238 INFO L428 stractBuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-11-02 20:50:58,238 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:50:58,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2022-11-02 20:50:58,248 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-11-02 20:50:58,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:58,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:58,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:58,250 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, 1, 1, 1, 1] [2022-11-02 20:50:58,250 INFO L748 eck$LassoCheckResult]: Stem: 3735#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); 3709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 3710#L197-1 [2022-11-02 20:50:58,250 INFO L750 eck$LassoCheckResult]: Loop: 3710#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 3841#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 3837#L83 assume !(0 != main_~p1~0#1); 3830#L83-2 assume !(0 != main_~p2~0#1); 3825#L87-1 assume !(0 != main_~p3~0#1); 3818#L91-1 assume !(0 != main_~p4~0#1); 3810#L95-1 assume !(0 != main_~p5~0#1); 3804#L99-1 assume !(0 != main_~p6~0#1); 3799#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3796#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3793#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3790#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3787#L119-1 assume !(0 != main_~p11~0#1); 3784#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3780#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3781#L131-1 assume !(0 != main_~p1~0#1); 3908#L137-1 assume !(0 != main_~p2~0#1); 3904#L142-1 assume !(0 != main_~p3~0#1); 3894#L147-1 assume !(0 != main_~p4~0#1); 3889#L152-1 assume !(0 != main_~p5~0#1); 3887#L157-1 assume !(0 != main_~p6~0#1); 3886#L162-1 assume !(0 != main_~p7~0#1); 3884#L167-1 assume !(0 != main_~p8~0#1); 3877#L172-1 assume !(0 != main_~p9~0#1); 3866#L177-1 assume !(0 != main_~p10~0#1); 3858#L182-1 assume !(0 != main_~p11~0#1); 3853#L187-1 assume !(0 != main_~p12~0#1); 3850#L192-1 assume !(0 != main_~p13~0#1); 3710#L197-1 [2022-11-02 20:50:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-02 20:50:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268499227] [2022-11-02 20:50:58,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2022-11-02 20:50:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524371554] [2022-11-02 20:50:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,321 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-02 20:50:58,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:58,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524371554] [2022-11-02 20:50:58,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524371554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:58,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:58,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394002326] [2022-11-02 20:50:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:58,326 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:58,329 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:58,363 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2022-11-02 20:50:58,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2022-11-02 20:50:58,392 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-11-02 20:50:58,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-11-02 20:50:58,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2022-11-02 20:50:58,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2022-11-02 20:50:58,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2022-11-02 20:50:58,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:58,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-11-02 20:50:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2022-11-02 20:50:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2022-11-02 20:50:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 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-02 20:50:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-11-02 20:50:58,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-11-02 20:50:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:58,527 INFO L428 stractBuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-11-02 20:50:58,530 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 20:50:58,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2022-11-02 20:50:58,547 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-11-02 20:50:58,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:58,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:58,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:58,549 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, 1, 1, 1, 1] [2022-11-02 20:50:58,550 INFO L748 eck$LassoCheckResult]: Stem: 7410#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); 7383#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 7384#L197-1 [2022-11-02 20:50:58,550 INFO L750 eck$LassoCheckResult]: Loop: 7384#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 7625#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 7624#L83 assume !(0 != main_~p1~0#1); 7593#L83-2 assume !(0 != main_~p2~0#1); 7590#L87-1 assume !(0 != main_~p3~0#1); 7582#L91-1 assume !(0 != main_~p4~0#1); 7531#L95-1 assume !(0 != main_~p5~0#1); 7490#L99-1 assume !(0 != main_~p6~0#1); 7491#L103-1 assume !(0 != main_~p7~0#1); 7731#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7726#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7724#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7722#L119-1 assume !(0 != main_~p11~0#1); 7718#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7712#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7705#L131-1 assume !(0 != main_~p1~0#1); 7654#L137-1 assume !(0 != main_~p2~0#1); 7651#L142-1 assume !(0 != main_~p3~0#1); 7648#L147-1 assume !(0 != main_~p4~0#1); 7646#L152-1 assume !(0 != main_~p5~0#1); 7644#L157-1 assume !(0 != main_~p6~0#1); 7642#L162-1 assume !(0 != main_~p7~0#1); 7641#L167-1 assume !(0 != main_~p8~0#1); 7638#L172-1 assume !(0 != main_~p9~0#1); 7637#L177-1 assume !(0 != main_~p10~0#1); 7635#L182-1 assume !(0 != main_~p11~0#1); 7632#L187-1 assume !(0 != main_~p12~0#1); 7631#L192-1 assume !(0 != main_~p13~0#1); 7384#L197-1 [2022-11-02 20:50:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-02 20:50:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583769008] [2022-11-02 20:50:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2022-11-02 20:50:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502770981] [2022-11-02 20:50:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,604 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-02 20:50:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:58,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502770981] [2022-11-02 20:50:58,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502770981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:58,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:58,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250617045] [2022-11-02 20:50:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:58,606 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:58,608 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:58,648 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2022-11-02 20:50:58,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2022-11-02 20:50:58,684 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-11-02 20:50:58,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-11-02 20:50:58,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2022-11-02 20:50:58,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2022-11-02 20:50:58,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2022-11-02 20:50:58,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:58,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-11-02 20:50:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2022-11-02 20:50:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2022-11-02 20:50:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 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-02 20:50:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-11-02 20:50:58,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-11-02 20:50:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:58,907 INFO L428 stractBuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-11-02 20:50:58,908 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 20:50:58,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2022-11-02 20:50:58,943 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-11-02 20:50:58,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:58,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:58,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:58,948 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, 1, 1, 1, 1] [2022-11-02 20:50:58,948 INFO L748 eck$LassoCheckResult]: Stem: 14651#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); 14625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 14626#L197-1 [2022-11-02 20:50:58,949 INFO L750 eck$LassoCheckResult]: Loop: 14626#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 15042#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 15039#L83 assume !(0 != main_~p1~0#1); 15035#L83-2 assume !(0 != main_~p2~0#1); 15032#L87-1 assume !(0 != main_~p3~0#1); 15029#L91-1 assume !(0 != main_~p4~0#1); 15025#L95-1 assume !(0 != main_~p5~0#1); 15021#L99-1 assume !(0 != main_~p6~0#1); 15022#L103-1 assume !(0 != main_~p7~0#1); 15100#L107-1 assume !(0 != main_~p8~0#1); 15098#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 15096#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 15094#L119-1 assume !(0 != main_~p11~0#1); 15092#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 15090#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 15087#L131-1 assume !(0 != main_~p1~0#1); 15083#L137-1 assume !(0 != main_~p2~0#1); 15080#L142-1 assume !(0 != main_~p3~0#1); 15075#L147-1 assume !(0 != main_~p4~0#1); 15071#L152-1 assume !(0 != main_~p5~0#1); 15069#L157-1 assume !(0 != main_~p6~0#1); 15068#L162-1 assume !(0 != main_~p7~0#1); 15066#L167-1 assume !(0 != main_~p8~0#1); 15062#L172-1 assume !(0 != main_~p9~0#1); 15059#L177-1 assume !(0 != main_~p10~0#1); 15055#L182-1 assume !(0 != main_~p11~0#1); 15050#L187-1 assume !(0 != main_~p12~0#1); 15047#L192-1 assume !(0 != main_~p13~0#1); 14626#L197-1 [2022-11-02 20:50:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-02 20:50:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93542124] [2022-11-02 20:50:58,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:58,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2022-11-02 20:50:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829852061] [2022-11-02 20:50:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:59,062 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-02 20:50:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:59,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829852061] [2022-11-02 20:50:59,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829852061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:59,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:59,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291129827] [2022-11-02 20:50:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:59,065 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:59,066 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:50:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:59,155 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2022-11-02 20:50:59,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2022-11-02 20:50:59,238 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-11-02 20:50:59,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-11-02 20:50:59,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2022-11-02 20:50:59,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2022-11-02 20:50:59,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2022-11-02 20:50:59,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:59,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-11-02 20:50:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2022-11-02 20:50:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2022-11-02 20:50:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 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-02 20:50:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-11-02 20:50:59,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-11-02 20:50:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:59,725 INFO L428 stractBuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-11-02 20:50:59,726 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-02 20:50:59,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2022-11-02 20:50:59,765 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-11-02 20:50:59,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:59,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:59,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:59,767 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, 1, 1, 1, 1] [2022-11-02 20:50:59,767 INFO L748 eck$LassoCheckResult]: Stem: 28933#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); 28907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 28908#L197-1 [2022-11-02 20:50:59,769 INFO L750 eck$LassoCheckResult]: Loop: 28908#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 29641#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 29642#L83 assume !(0 != main_~p1~0#1); 29625#L83-2 assume !(0 != main_~p2~0#1); 29627#L87-1 assume !(0 != main_~p3~0#1); 29609#L91-1 assume !(0 != main_~p4~0#1); 29611#L95-1 assume !(0 != main_~p5~0#1); 29776#L99-1 assume !(0 != main_~p6~0#1); 29773#L103-1 assume !(0 != main_~p7~0#1); 29769#L107-1 assume !(0 != main_~p8~0#1); 29762#L111-1 assume !(0 != main_~p9~0#1); 29757#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 29753#L119-1 assume !(0 != main_~p11~0#1); 29749#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 29745#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 29738#L131-1 assume !(0 != main_~p1~0#1); 29728#L137-1 assume !(0 != main_~p2~0#1); 29722#L142-1 assume !(0 != main_~p3~0#1); 29714#L147-1 assume !(0 != main_~p4~0#1); 29710#L152-1 assume !(0 != main_~p5~0#1); 29421#L157-1 assume !(0 != main_~p6~0#1); 29423#L162-1 assume !(0 != main_~p7~0#1); 29693#L167-1 assume !(0 != main_~p8~0#1); 29694#L172-1 assume !(0 != main_~p9~0#1); 29684#L177-1 assume !(0 != main_~p10~0#1); 29683#L182-1 assume !(0 != main_~p11~0#1); 29788#L187-1 assume !(0 != main_~p12~0#1); 29656#L192-1 assume !(0 != main_~p13~0#1); 28908#L197-1 [2022-11-02 20:50:59,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-11-02 20:50:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162691926] [2022-11-02 20:50:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:59,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:59,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2022-11-02 20:50:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:59,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091520296] [2022-11-02 20:50:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:59,921 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-02 20:50:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:59,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091520296] [2022-11-02 20:50:59,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091520296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:59,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:59,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:59,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620250063] [2022-11-02 20:50:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:59,923 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:50:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:59,924 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:51:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:00,031 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2022-11-02 20:51:00,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2022-11-02 20:51:00,257 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-11-02 20:51:00,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-11-02 20:51:00,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2022-11-02 20:51:00,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2022-11-02 20:51:00,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2022-11-02 20:51:00,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:00,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-11-02 20:51:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2022-11-02 20:51:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2022-11-02 20:51:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 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-02 20:51:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-11-02 20:51:01,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-11-02 20:51:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:01,032 INFO L428 stractBuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-11-02 20:51:01,032 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-02 20:51:01,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2022-11-02 20:51:01,101 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-11-02 20:51:01,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:51:01,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:51:01,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:51:01,102 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, 1, 1, 1, 1] [2022-11-02 20:51:01,102 INFO L748 eck$LassoCheckResult]: Stem: 57107#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); 57077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 57078#L197-1 [2022-11-02 20:51:01,103 INFO L750 eck$LassoCheckResult]: Loop: 57078#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 57248#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 57244#L83 assume !(0 != main_~p1~0#1); 57241#L83-2 assume !(0 != main_~p2~0#1); 57238#L87-1 assume !(0 != main_~p3~0#1); 57234#L91-1 assume !(0 != main_~p4~0#1); 57230#L95-1 assume !(0 != main_~p5~0#1); 57226#L99-1 assume !(0 != main_~p6~0#1); 57221#L103-1 assume !(0 != main_~p7~0#1); 57216#L107-1 assume !(0 != main_~p8~0#1); 57217#L111-1 assume !(0 != main_~p9~0#1); 57538#L115-1 assume !(0 != main_~p10~0#1); 57534#L119-1 assume !(0 != main_~p11~0#1); 57530#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 57526#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 57519#L131-1 assume !(0 != main_~p1~0#1); 57512#L137-1 assume !(0 != main_~p2~0#1); 57494#L142-1 assume !(0 != main_~p3~0#1); 57475#L147-1 assume !(0 != main_~p4~0#1); 57471#L152-1 assume !(0 != main_~p5~0#1); 57467#L157-1 assume !(0 != main_~p6~0#1); 57465#L162-1 assume !(0 != main_~p7~0#1); 57453#L167-1 assume !(0 != main_~p8~0#1); 57451#L172-1 assume !(0 != main_~p9~0#1); 57450#L177-1 assume !(0 != main_~p10~0#1); 57449#L182-1 assume !(0 != main_~p11~0#1); 57253#L187-1 assume !(0 != main_~p12~0#1); 57252#L192-1 assume !(0 != main_~p13~0#1); 57078#L197-1 [2022-11-02 20:51:01,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-11-02 20:51:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:01,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542483442] [2022-11-02 20:51:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:01,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:01,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2022-11-02 20:51:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:01,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936394867] [2022-11-02 20:51:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,137 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-02 20:51:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:01,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936394867] [2022-11-02 20:51:01,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936394867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:01,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:01,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104571903] [2022-11-02 20:51:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:01,139 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:51:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:01,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:01,140 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:51:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:01,502 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2022-11-02 20:51:01,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2022-11-02 20:51:01,874 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2022-11-02 20:51:02,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2022-11-02 20:51:02,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2022-11-02 20:51:02,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2022-11-02 20:51:02,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2022-11-02 20:51:02,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:02,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-11-02 20:51:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2022-11-02 20:51:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2022-11-02 20:51:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 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-02 20:51:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2022-11-02 20:51:02,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-11-02 20:51:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:02,925 INFO L428 stractBuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-11-02 20:51:02,926 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-02 20:51:02,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2022-11-02 20:51:03,209 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2022-11-02 20:51:03,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:51:03,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:51:03,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:51:03,211 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, 1, 1, 1, 1] [2022-11-02 20:51:03,211 INFO L748 eck$LassoCheckResult]: Stem: 112669#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); 112639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 112640#L197-1 [2022-11-02 20:51:03,212 INFO L750 eck$LassoCheckResult]: Loop: 112640#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 113657#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 113653#L83 assume !(0 != main_~p1~0#1); 113649#L83-2 assume !(0 != main_~p2~0#1); 113647#L87-1 assume !(0 != main_~p3~0#1); 113643#L91-1 assume !(0 != main_~p4~0#1); 113639#L95-1 assume !(0 != main_~p5~0#1); 113635#L99-1 assume !(0 != main_~p6~0#1); 113631#L103-1 assume !(0 != main_~p7~0#1); 113627#L107-1 assume !(0 != main_~p8~0#1); 113623#L111-1 assume !(0 != main_~p9~0#1); 113624#L115-1 assume !(0 != main_~p10~0#1); 113702#L119-1 assume !(0 != main_~p11~0#1); 113699#L123-1 assume !(0 != main_~p12~0#1); 113697#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 113695#L131-1 assume !(0 != main_~p1~0#1); 113693#L137-1 assume !(0 != main_~p2~0#1); 113681#L142-1 assume !(0 != main_~p3~0#1); 113675#L147-1 assume !(0 != main_~p4~0#1); 113544#L152-1 assume !(0 != main_~p5~0#1); 113545#L157-1 assume !(0 != main_~p6~0#1); 113491#L162-1 assume !(0 != main_~p7~0#1); 113493#L167-1 assume !(0 != main_~p8~0#1); 113427#L172-1 assume !(0 != main_~p9~0#1); 113428#L177-1 assume !(0 != main_~p10~0#1); 113669#L182-1 assume !(0 != main_~p11~0#1); 113664#L187-1 assume !(0 != main_~p12~0#1); 113661#L192-1 assume !(0 != main_~p13~0#1); 112640#L197-1 [2022-11-02 20:51:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-11-02 20:51:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:03,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470765099] [2022-11-02 20:51:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:03,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:03,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:03,234 INFO L85 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2022-11-02 20:51:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:03,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861950751] [2022-11-02 20:51:03,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:03,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,264 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-02 20:51:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:03,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861950751] [2022-11-02 20:51:03,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861950751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:03,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:03,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479275893] [2022-11-02 20:51:03,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:03,265 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:51:03,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:03,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:03,267 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-02 20:51:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:03,637 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2022-11-02 20:51:03,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2022-11-02 20:51:04,154 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2022-11-02 20:51:04,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2022-11-02 20:51:04,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2022-11-02 20:51:04,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2022-11-02 20:51:04,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2022-11-02 20:51:04,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:04,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-11-02 20:51:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2022-11-02 20:51:05,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2022-11-02 20:51:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 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-02 20:51:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2022-11-02 20:51:06,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-11-02 20:51:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:06,072 INFO L428 stractBuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-11-02 20:51:06,073 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-02 20:51:06,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2022-11-02 20:51:06,950 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2022-11-02 20:51:06,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:51:06,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:51:06,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:51:06,953 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, 1, 1, 1, 1] [2022-11-02 20:51:06,953 INFO L748 eck$LassoCheckResult]: Stem: 222245#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); 222217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~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;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 222218#L197-1 [2022-11-02 20:51:06,953 INFO L750 eck$LassoCheckResult]: Loop: 222218#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 223381#L52 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 223379#L83 assume !(0 != main_~p1~0#1); 223377#L83-2 assume !(0 != main_~p2~0#1); 223376#L87-1 assume !(0 != main_~p3~0#1); 223374#L91-1 assume !(0 != main_~p4~0#1); 223372#L95-1 assume !(0 != main_~p5~0#1); 223370#L99-1 assume !(0 != main_~p6~0#1); 223368#L103-1 assume !(0 != main_~p7~0#1); 223366#L107-1 assume !(0 != main_~p8~0#1); 223364#L111-1 assume !(0 != main_~p9~0#1); 223362#L115-1 assume !(0 != main_~p10~0#1); 223360#L119-1 assume !(0 != main_~p11~0#1); 223357#L123-1 assume !(0 != main_~p12~0#1); 223358#L127-1 assume !(0 != main_~p13~0#1); 223341#L131-1 assume !(0 != main_~p1~0#1); 223343#L137-1 assume !(0 != main_~p2~0#1); 223327#L142-1 assume !(0 != main_~p3~0#1); 223326#L147-1 assume !(0 != main_~p4~0#1); 223309#L152-1 assume !(0 != main_~p5~0#1); 223310#L157-1 assume !(0 != main_~p6~0#1); 223291#L162-1 assume !(0 != main_~p7~0#1); 223293#L167-1 assume !(0 != main_~p8~0#1); 223278#L172-1 assume !(0 != main_~p9~0#1); 223279#L177-1 assume !(0 != main_~p10~0#1); 223267#L182-1 assume !(0 != main_~p11~0#1); 223266#L187-1 assume !(0 != main_~p12~0#1); 223382#L192-1 assume !(0 != main_~p13~0#1); 222218#L197-1 [2022-11-02 20:51:06,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-11-02 20:51:06,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:06,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288239312] [2022-11-02 20:51:06,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:06,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:06,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:06,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2022-11-02 20:51:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:06,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361147726] [2022-11-02 20:51:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:06,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:07,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2022-11-02 20:51:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:07,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046933172] [2022-11-02 20:51:07,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:07,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:07,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:07,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:07,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:07,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 08:51:07 BoogieIcfgContainer [2022-11-02 20:51:07,816 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 20:51:07,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:51:07,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:51:07,818 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:51:07,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:56" (3/4) ... [2022-11-02 20:51:07,822 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-02 20:51:07,901 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:51:07,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:51:07,902 INFO L158 Benchmark]: Toolchain (without parser) took 12566.08ms. Allocated memory was 140.5MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 103.4MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 627.3MB. Max. memory is 16.1GB. [2022-11-02 20:51:07,903 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 140.5MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:51:07,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.84ms. Allocated memory is still 140.5MB. Free memory was 103.2MB in the beginning and 115.4MB in the end (delta: -12.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:51:07,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.06ms. Allocated memory is still 140.5MB. Free memory was 115.4MB in the beginning and 113.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:07,904 INFO L158 Benchmark]: Boogie Preprocessor took 58.67ms. Allocated memory is still 140.5MB. Free memory was 113.6MB in the beginning and 112.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:07,905 INFO L158 Benchmark]: RCFGBuilder took 541.30ms. Allocated memory is still 140.5MB. Free memory was 112.1MB in the beginning and 97.9MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:51:07,905 INFO L158 Benchmark]: BuchiAutomizer took 11404.65ms. Allocated memory was 140.5MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 97.8MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 621.7MB. Max. memory is 16.1GB. [2022-11-02 20:51:07,906 INFO L158 Benchmark]: Witness Printer took 84.15ms. Allocated memory is still 5.5GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:07,908 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.38ms. Allocated memory is still 140.5MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.84ms. Allocated memory is still 140.5MB. Free memory was 103.2MB in the beginning and 115.4MB in the end (delta: -12.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.06ms. Allocated memory is still 140.5MB. Free memory was 115.4MB in the beginning and 113.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.67ms. Allocated memory is still 140.5MB. Free memory was 113.6MB in the beginning and 112.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 541.30ms. Allocated memory is still 140.5MB. Free memory was 112.1MB in the beginning and 97.9MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 11404.65ms. Allocated memory was 140.5MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 97.8MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 621.7MB. Max. memory is 16.1GB. * Witness Printer took 84.15ms. Allocated memory is still 5.5GB. Free memory was 4.9GB in the beginning and 4.9GB 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.2s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 7.2s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.1s 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, 589 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 1842 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 709 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1133 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 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: 50]: 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; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: 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; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:51:07,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8051983f-82c5-4d58-8dc2-340ea1890373/bin/uautomizer-Dbtcem3rbc/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)