./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8.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_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/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_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/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_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- 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:30:36,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:30:36,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:30:36,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:30:36,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:30:36,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:30:36,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:30:36,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:30:36,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:30:36,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:30:36,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:30:36,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:30:36,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:30:36,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:30:36,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:30:36,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:30:36,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:30:36,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:30:36,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:30:36,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:30:36,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:30:36,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:30:36,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:30:36,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:30:36,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:30:36,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:30:36,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:30:36,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:30:36,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:30:36,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:30:36,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:30:36,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:30:36,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:30:36,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:30:36,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:30:36,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:30:36,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:30:36,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:30:36,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:30:36,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:30:36,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:30:36,889 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 20:30:36,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:30:36,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:30:36,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:30:36,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:30:36,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:30:36,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:30:36,919 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:30:36,919 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:30:36,919 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:30:36,919 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:30:36,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:30:36,920 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:30:36,920 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:30:36,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:30:36,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:30:36,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:30:36,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:30:36,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:30:36,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:30:36,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:30:36,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:30:36,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:30:36,923 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:30:36,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:30:36,923 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:30:36,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:30:36,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:30:36,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:30:36,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:30:36,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:30:36,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:30:36,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:30:36,927 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_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/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_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2022-11-02 20:30:37,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:30:37,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:30:37,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:30:37,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:30:37,341 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:30:37,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/locks/test_locks_8.c [2022-11-02 20:30:37,425 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/data/de11264f1/e6fd5ddf6afa45d4929d675d64b20fae/FLAG8b5c120a9 [2022-11-02 20:30:38,013 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:30:38,014 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/sv-benchmarks/c/locks/test_locks_8.c [2022-11-02 20:30:38,024 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/data/de11264f1/e6fd5ddf6afa45d4929d675d64b20fae/FLAG8b5c120a9 [2022-11-02 20:30:38,363 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/data/de11264f1/e6fd5ddf6afa45d4929d675d64b20fae [2022-11-02 20:30:38,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:30:38,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:30:38,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:38,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:30:38,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:30:38,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59029edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38, skipping insertion in model container [2022-11-02 20:30:38,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:30:38,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:30:38,732 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_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-11-02 20:30:38,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:38,747 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:30:38,797 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_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-11-02 20:30:38,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:38,815 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:30:38,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38 WrapperNode [2022-11-02 20:30:38,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:38,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:38,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:30:38,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:30:38,827 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:30:38" (1/1) ... [2022-11-02 20:30:38,836 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:30:38" (1/1) ... [2022-11-02 20:30:38,871 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2022-11-02 20:30:38,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:38,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:30:38,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:30:38,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:30:38,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:30:38,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:30:38,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:30:38,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:30:38,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (1/1) ... [2022-11-02 20:30:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:30:38,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:38,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:30:38,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:30:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:30:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:30:39,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:30:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:30:39,135 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:30:39,138 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:30:39,456 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:30:39,463 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:30:39,464 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:30:39,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:39 BoogieIcfgContainer [2022-11-02 20:30:39,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:30:39,468 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:30:39,468 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:30:39,473 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:30:39,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:30:39,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:30:38" (1/3) ... [2022-11-02 20:30:39,475 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76eae423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:30:39, skipping insertion in model container [2022-11-02 20:30:39,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:30:39,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:38" (2/3) ... [2022-11-02 20:30:39,476 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76eae423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:30:39, skipping insertion in model container [2022-11-02 20:30:39,476 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:30:39,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:39" (3/3) ... [2022-11-02 20:30:39,478 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2022-11-02 20:30:39,540 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:30:39,540 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:30:39,541 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:30:39,541 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:30:39,541 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:30:39,541 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:30:39,542 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:30:39,542 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:30:39,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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:30:39,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-11-02 20:30:39,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:39,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:39,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:39,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:39,577 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:30:39,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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:30:39,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-11-02 20:30:39,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:39,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:39,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:39,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:39,593 INFO L748 eck$LassoCheckResult]: Stem: 18#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(15, 2);call #Ultimate.allocInit(12, 3); 7#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_~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_~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;havoc main_~cond~0#1; 21#L127-1true [2022-11-02 20:30:39,595 INFO L750 eck$LassoCheckResult]: Loop: 21#L127-1true assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 28#L37true 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; 6#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 13#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 15#L62-1true assume !(0 != main_~p3~0#1); 29#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 30#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 26#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8#L86-1true assume !(0 != main_~p1~0#1); 5#L92-1true assume !(0 != main_~p2~0#1); 16#L97-1true assume !(0 != main_~p3~0#1); 23#L102-1true assume !(0 != main_~p4~0#1); 20#L107-1true assume !(0 != main_~p5~0#1); 33#L112-1true assume !(0 != main_~p6~0#1); 31#L117-1true assume !(0 != main_~p7~0#1); 11#L122-1true assume !(0 != main_~p8~0#1); 21#L127-1true [2022-11-02 20:30:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 20:30:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:39,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657552319] [2022-11-02 20:30:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:39,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:39,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2022-11-02 20:30:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825292586] [2022-11-02 20:30:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:39,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:39,984 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:30:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:39,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825292586] [2022-11-02 20:30:39,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825292586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:39,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:39,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971445882] [2022-11-02 20:30:39,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:39,995 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:30:39,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:40,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:40,046 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:30:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:40,086 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2022-11-02 20:30:40,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2022-11-02 20:30:40,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-11-02 20:30:40,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2022-11-02 20:30:40,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-11-02 20:30:40,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-11-02 20:30:40,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2022-11-02 20:30:40,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:40,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-11-02 20:30:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2022-11-02 20:30:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-02 20:30:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 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:30:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2022-11-02 20:30:40,142 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-11-02 20:30:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:40,147 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-11-02 20:30:40,148 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:30:40,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2022-11-02 20:30:40,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-11-02 20:30:40,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:40,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:40,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:40,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:40,152 INFO L748 eck$LassoCheckResult]: Stem: 125#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(15, 2);call #Ultimate.allocInit(12, 3); 112#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_~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_~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;havoc main_~cond~0#1; 113#L127-1 [2022-11-02 20:30:40,152 INFO L750 eck$LassoCheckResult]: Loop: 113#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 140#L37 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; 138#L58 assume !(0 != main_~p1~0#1); 139#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 157#L62-1 assume !(0 != main_~p3~0#1); 156#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 155#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 154#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 153#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 152#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 151#L86-1 assume !(0 != main_~p1~0#1); 109#L92-1 assume !(0 != main_~p2~0#1); 108#L97-1 assume !(0 != main_~p3~0#1); 123#L102-1 assume !(0 != main_~p4~0#1); 129#L107-1 assume !(0 != main_~p5~0#1); 143#L112-1 assume !(0 != main_~p6~0#1); 137#L117-1 assume !(0 != main_~p7~0#1); 131#L122-1 assume !(0 != main_~p8~0#1); 113#L127-1 [2022-11-02 20:30:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-02 20:30:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758586616] [2022-11-02 20:30:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2022-11-02 20:30:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637722142] [2022-11-02 20:30:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:40,220 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:30:40,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:40,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637722142] [2022-11-02 20:30:40,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637722142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:40,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:40,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335370997] [2022-11-02 20:30:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:40,223 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:30:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:40,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:40,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:40,225 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:30:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:40,248 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2022-11-02 20:30:40,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2022-11-02 20:30:40,252 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-11-02 20:30:40,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2022-11-02 20:30:40,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2022-11-02 20:30:40,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2022-11-02 20:30:40,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2022-11-02 20:30:40,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:40,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-11-02 20:30:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2022-11-02 20:30:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-02 20:30:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 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:30:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2022-11-02 20:30:40,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-11-02 20:30:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:40,287 INFO L428 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-11-02 20:30:40,287 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:30:40,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2022-11-02 20:30:40,290 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-11-02 20:30:40,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:40,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:40,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:40,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:40,292 INFO L748 eck$LassoCheckResult]: Stem: 289#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(15, 2);call #Ultimate.allocInit(12, 3); 273#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_~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_~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;havoc main_~cond~0#1; 274#L127-1 [2022-11-02 20:30:40,293 INFO L750 eck$LassoCheckResult]: Loop: 274#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 325#L37 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; 323#L58 assume !(0 != main_~p1~0#1); 320#L58-2 assume !(0 != main_~p2~0#1); 318#L62-1 assume !(0 != main_~p3~0#1); 316#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 314#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 312#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 310#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 308#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 306#L86-1 assume !(0 != main_~p1~0#1); 307#L92-1 assume !(0 != main_~p2~0#1); 348#L97-1 assume !(0 != main_~p3~0#1); 345#L102-1 assume !(0 != main_~p4~0#1); 341#L107-1 assume !(0 != main_~p5~0#1); 336#L112-1 assume !(0 != main_~p6~0#1); 333#L117-1 assume !(0 != main_~p7~0#1); 329#L122-1 assume !(0 != main_~p8~0#1); 274#L127-1 [2022-11-02 20:30:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-02 20:30:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085422049] [2022-11-02 20:30:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2022-11-02 20:30:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409012584] [2022-11-02 20:30:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:40,378 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:30:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:40,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409012584] [2022-11-02 20:30:40,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409012584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:40,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:40,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50202006] [2022-11-02 20:30:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:40,382 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:30:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:40,383 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:30:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:40,408 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2022-11-02 20:30:40,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2022-11-02 20:30:40,413 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-11-02 20:30:40,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2022-11-02 20:30:40,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2022-11-02 20:30:40,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2022-11-02 20:30:40,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2022-11-02 20:30:40,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:40,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-11-02 20:30:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2022-11-02 20:30:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-02 20:30:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 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:30:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2022-11-02 20:30:40,443 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-11-02 20:30:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:40,444 INFO L428 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-11-02 20:30:40,445 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:30:40,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2022-11-02 20:30:40,448 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-11-02 20:30:40,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:40,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:40,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:40,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:40,450 INFO L748 eck$LassoCheckResult]: Stem: 597#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(15, 2);call #Ultimate.allocInit(12, 3); 580#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_~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_~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;havoc main_~cond~0#1; 581#L127-1 [2022-11-02 20:30:40,451 INFO L750 eck$LassoCheckResult]: Loop: 581#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 645#L37 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; 638#L58 assume !(0 != main_~p1~0#1); 639#L58-2 assume !(0 != main_~p2~0#1); 630#L62-1 assume !(0 != main_~p3~0#1); 631#L66-1 assume !(0 != main_~p4~0#1); 701#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 700#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 699#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 698#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 697#L86-1 assume !(0 != main_~p1~0#1); 694#L92-1 assume !(0 != main_~p2~0#1); 690#L97-1 assume !(0 != main_~p3~0#1); 688#L102-1 assume !(0 != main_~p4~0#1); 676#L107-1 assume !(0 != main_~p5~0#1); 675#L112-1 assume !(0 != main_~p6~0#1); 655#L117-1 assume !(0 != main_~p7~0#1); 654#L122-1 assume !(0 != main_~p8~0#1); 581#L127-1 [2022-11-02 20:30:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-02 20:30:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426512543] [2022-11-02 20:30:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2022-11-02 20:30:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990380145] [2022-11-02 20:30:40,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:40,510 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:30:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990380145] [2022-11-02 20:30:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990380145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:40,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:40,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308678272] [2022-11-02 20:30:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:40,513 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:30:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:40,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:40,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:40,515 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:30:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:40,543 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2022-11-02 20:30:40,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2022-11-02 20:30:40,549 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-11-02 20:30:40,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2022-11-02 20:30:40,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2022-11-02 20:30:40,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2022-11-02 20:30:40,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2022-11-02 20:30:40,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:40,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-11-02 20:30:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2022-11-02 20:30:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-02 20:30:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 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:30:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2022-11-02 20:30:40,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-11-02 20:30:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:40,603 INFO L428 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-11-02 20:30:40,604 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:30:40,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2022-11-02 20:30:40,608 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-11-02 20:30:40,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:40,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:40,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:40,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:40,610 INFO L748 eck$LassoCheckResult]: Stem: 1186#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(15, 2);call #Ultimate.allocInit(12, 3); 1169#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_~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_~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;havoc main_~cond~0#1; 1170#L127-1 [2022-11-02 20:30:40,610 INFO L750 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1273#L37 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; 1266#L58 assume !(0 != main_~p1~0#1); 1268#L58-2 assume !(0 != main_~p2~0#1); 1246#L62-1 assume !(0 != main_~p3~0#1); 1247#L66-1 assume !(0 != main_~p4~0#1); 1335#L70-1 assume !(0 != main_~p5~0#1); 1330#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1331#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1322#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1323#L86-1 assume !(0 != main_~p1~0#1); 1359#L92-1 assume !(0 != main_~p2~0#1); 1357#L97-1 assume !(0 != main_~p3~0#1); 1355#L102-1 assume !(0 != main_~p4~0#1); 1354#L107-1 assume !(0 != main_~p5~0#1); 1352#L112-1 assume !(0 != main_~p6~0#1); 1351#L117-1 assume !(0 != main_~p7~0#1); 1287#L122-1 assume !(0 != main_~p8~0#1); 1170#L127-1 [2022-11-02 20:30:40,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-02 20:30:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404747629] [2022-11-02 20:30:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2022-11-02 20:30:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494754674] [2022-11-02 20:30:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:40,665 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:30:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:40,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494754674] [2022-11-02 20:30:40,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494754674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:40,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:40,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:40,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68227081] [2022-11-02 20:30:40,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:40,668 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:30:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:40,670 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:30:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:40,696 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2022-11-02 20:30:40,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2022-11-02 20:30:40,705 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-11-02 20:30:40,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2022-11-02 20:30:40,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2022-11-02 20:30:40,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2022-11-02 20:30:40,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2022-11-02 20:30:40,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:40,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-11-02 20:30:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2022-11-02 20:30:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-11-02 20:30:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 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:30:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2022-11-02 20:30:40,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-11-02 20:30:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:40,758 INFO L428 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-11-02 20:30:40,758 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:30:40,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2022-11-02 20:30:40,764 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-11-02 20:30:40,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:40,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:40,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:40,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:40,765 INFO L748 eck$LassoCheckResult]: Stem: 2329#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(15, 2);call #Ultimate.allocInit(12, 3); 2315#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_~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_~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;havoc main_~cond~0#1; 2316#L127-1 [2022-11-02 20:30:40,766 INFO L750 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2415#L37 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; 2411#L58 assume !(0 != main_~p1~0#1); 2408#L58-2 assume !(0 != main_~p2~0#1); 2406#L62-1 assume !(0 != main_~p3~0#1); 2403#L66-1 assume !(0 != main_~p4~0#1); 2399#L70-1 assume !(0 != main_~p5~0#1); 2396#L74-1 assume !(0 != main_~p6~0#1); 2394#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2391#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2387#L86-1 assume !(0 != main_~p1~0#1); 2385#L92-1 assume !(0 != main_~p2~0#1); 2381#L97-1 assume !(0 != main_~p3~0#1); 2378#L102-1 assume !(0 != main_~p4~0#1); 2379#L107-1 assume !(0 != main_~p5~0#1); 2426#L112-1 assume !(0 != main_~p6~0#1); 2423#L117-1 assume !(0 != main_~p7~0#1); 2420#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2022-11-02 20:30:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-02 20:30:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309639630] [2022-11-02 20:30:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2022-11-02 20:30:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400961795] [2022-11-02 20:30:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:40,818 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:30:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:40,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400961795] [2022-11-02 20:30:40,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400961795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:40,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:40,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632573646] [2022-11-02 20:30:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:40,820 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:30:40,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:40,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:40,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:40,822 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:30:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:40,851 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2022-11-02 20:30:40,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2022-11-02 20:30:40,872 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-11-02 20:30:40,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-11-02 20:30:40,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2022-11-02 20:30:40,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2022-11-02 20:30:40,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2022-11-02 20:30:40,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:40,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-11-02 20:30:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2022-11-02 20:30:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2022-11-02 20:30:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 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:30:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-11-02 20:30:40,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-11-02 20:30:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:40,948 INFO L428 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-11-02 20:30:40,952 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 20:30:40,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2022-11-02 20:30:40,966 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-11-02 20:30:40,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:40,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:40,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:40,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:40,969 INFO L748 eck$LassoCheckResult]: Stem: 4564#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(15, 2);call #Ultimate.allocInit(12, 3); 4550#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_~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_~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;havoc main_~cond~0#1; 4551#L127-1 [2022-11-02 20:30:40,970 INFO L750 eck$LassoCheckResult]: Loop: 4551#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4806#L37 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; 4807#L58 assume !(0 != main_~p1~0#1); 4818#L58-2 assume !(0 != main_~p2~0#1); 4816#L62-1 assume !(0 != main_~p3~0#1); 4812#L66-1 assume !(0 != main_~p4~0#1); 4809#L70-1 assume !(0 != main_~p5~0#1); 4770#L74-1 assume !(0 != main_~p6~0#1); 4767#L78-1 assume !(0 != main_~p7~0#1); 4765#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4730#L86-1 assume !(0 != main_~p1~0#1); 4724#L92-1 assume !(0 != main_~p2~0#1); 4725#L97-1 assume !(0 != main_~p3~0#1); 4711#L102-1 assume !(0 != main_~p4~0#1); 4713#L107-1 assume !(0 != main_~p5~0#1); 4831#L112-1 assume !(0 != main_~p6~0#1); 4827#L117-1 assume !(0 != main_~p7~0#1); 4824#L122-1 assume !(0 != main_~p8~0#1); 4551#L127-1 [2022-11-02 20:30:40,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-02 20:30:40,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326363702] [2022-11-02 20:30:40,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:40,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2022-11-02 20:30:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:41,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745957655] [2022-11-02 20:30:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:41,031 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:30:41,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:41,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745957655] [2022-11-02 20:30:41,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745957655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:41,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:41,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:41,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827667865] [2022-11-02 20:30:41,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:41,033 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:30:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:41,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:41,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:41,035 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:30:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:41,063 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2022-11-02 20:30:41,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2022-11-02 20:30:41,089 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-11-02 20:30:41,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-11-02 20:30:41,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2022-11-02 20:30:41,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2022-11-02 20:30:41,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2022-11-02 20:30:41,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:41,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-11-02 20:30:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2022-11-02 20:30:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2022-11-02 20:30:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 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:30:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-11-02 20:30:41,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-11-02 20:30:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:41,210 INFO L428 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-11-02 20:30:41,211 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 20:30:41,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2022-11-02 20:30:41,231 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-11-02 20:30:41,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:30:41,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:30:41,232 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:30:41,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:41,232 INFO L748 eck$LassoCheckResult]: Stem: 8925#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(15, 2);call #Ultimate.allocInit(12, 3); 8910#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_~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_~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;havoc main_~cond~0#1; 8911#L127-1 [2022-11-02 20:30:41,233 INFO L750 eck$LassoCheckResult]: Loop: 8911#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9035#L37 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; 9033#L58 assume !(0 != main_~p1~0#1); 9027#L58-2 assume !(0 != main_~p2~0#1); 9029#L62-1 assume !(0 != main_~p3~0#1); 9017#L66-1 assume !(0 != main_~p4~0#1); 9019#L70-1 assume !(0 != main_~p5~0#1); 9005#L74-1 assume !(0 != main_~p6~0#1); 9007#L78-1 assume !(0 != main_~p7~0#1); 8993#L82-1 assume !(0 != main_~p8~0#1); 8995#L86-1 assume !(0 != main_~p1~0#1); 9058#L92-1 assume !(0 != main_~p2~0#1); 9056#L97-1 assume !(0 != main_~p3~0#1); 9053#L102-1 assume !(0 != main_~p4~0#1); 9051#L107-1 assume !(0 != main_~p5~0#1); 9047#L112-1 assume !(0 != main_~p6~0#1); 9043#L117-1 assume !(0 != main_~p7~0#1); 9039#L122-1 assume !(0 != main_~p8~0#1); 8911#L127-1 [2022-11-02 20:30:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:41,234 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-02 20:30:41,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:41,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005003909] [2022-11-02 20:30:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:41,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2022-11-02 20:30:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366724453] [2022-11-02 20:30:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2022-11-02 20:30:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:41,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996579502] [2022-11-02 20:30:41,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:41,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:30:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:30:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:30:41,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 08:30:41 BoogieIcfgContainer [2022-11-02 20:30:41,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 20:30:41,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:30:41,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:30:41,963 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:30:41,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:39" (3/4) ... [2022-11-02 20:30:41,967 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-02 20:30:42,016 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:30:42,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:30:42,018 INFO L158 Benchmark]: Toolchain (without parser) took 3647.90ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 83.1MB in the beginning and 68.8MB in the end (delta: 14.3MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2022-11-02 20:30:42,018 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 123.7MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:30:42,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.52ms. Allocated memory is still 123.7MB. Free memory was 82.9MB in the beginning and 97.1MB in the end (delta: -14.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:30:42,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.16ms. Allocated memory is still 123.7MB. Free memory was 96.7MB in the beginning and 95.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:30:42,020 INFO L158 Benchmark]: Boogie Preprocessor took 38.11ms. Allocated memory is still 123.7MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:30:42,021 INFO L158 Benchmark]: RCFGBuilder took 555.50ms. Allocated memory is still 123.7MB. Free memory was 94.1MB in the beginning and 82.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:30:42,022 INFO L158 Benchmark]: BuchiAutomizer took 2494.65ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 82.0MB in the beginning and 71.9MB in the end (delta: 10.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-11-02 20:30:42,022 INFO L158 Benchmark]: Witness Printer took 54.03ms. Allocated memory is still 153.1MB. Free memory was 70.9MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:30:42,025 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.26ms. Allocated memory is still 123.7MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.52ms. Allocated memory is still 123.7MB. Free memory was 82.9MB in the beginning and 97.1MB in the end (delta: -14.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.16ms. Allocated memory is still 123.7MB. Free memory was 96.7MB in the beginning and 95.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.11ms. Allocated memory is still 123.7MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 555.50ms. Allocated memory is still 123.7MB. Free memory was 94.1MB in the beginning and 82.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2494.65ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 82.0MB in the beginning and 71.9MB in the end (delta: 10.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Witness Printer took 54.03ms. Allocated memory is still 153.1MB. Free memory was 70.9MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.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, 236 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 459 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 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: 35]: 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; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:30:42,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae82edd5-85c9-40ab-ab46-f2ed61f99c74/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)