./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8 --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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- 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-e04fb08 [2022-11-16 12:25:15,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:25:15,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:25:15,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:25:15,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:25:15,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:25:15,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:25:15,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:25:15,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:25:15,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:25:15,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:25:15,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:25:15,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:25:15,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:25:15,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:25:15,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:25:15,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:25:15,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:25:15,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:25:15,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:25:15,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:25:15,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:25:15,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:25:15,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:25:15,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:25:15,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:25:15,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:25:15,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:25:15,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:25:15,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:25:15,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:25:15,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:25:15,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:25:15,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:25:15,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:25:15,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:25:15,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:25:15,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:25:15,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:25:15,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:25:15,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:25:15,257 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 12:25:15,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:25:15,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:25:15,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:25:15,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:25:15,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:25:15,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:25:15,311 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:25:15,311 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 12:25:15,312 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 12:25:15,312 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 12:25:15,313 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 12:25:15,314 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 12:25:15,314 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 12:25:15,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:25:15,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:25:15,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:25:15,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:25:15,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:25:15,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:25:15,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 12:25:15,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 12:25:15,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 12:25:15,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:25:15,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:25:15,317 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 12:25:15,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:25:15,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 12:25:15,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:25:15,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:25:15,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:25:15,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:25:15,321 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 12:25:15,322 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_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/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_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2022-11-16 12:25:15,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:25:15,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:25:15,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:25:15,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:25:15,682 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:25:15,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/locks/test_locks_7.c [2022-11-16 12:25:15,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/data/3a4f98203/7db843a8c2c44a2baa462f6d81cca7db/FLAG959fcfecf [2022-11-16 12:25:16,397 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:25:16,398 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/sv-benchmarks/c/locks/test_locks_7.c [2022-11-16 12:25:16,409 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/data/3a4f98203/7db843a8c2c44a2baa462f6d81cca7db/FLAG959fcfecf [2022-11-16 12:25:16,741 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/data/3a4f98203/7db843a8c2c44a2baa462f6d81cca7db [2022-11-16 12:25:16,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:25:16,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:25:16,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:25:16,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:25:16,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:25:16,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:16" (1/1) ... [2022-11-16 12:25:16,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6073c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:16, skipping insertion in model container [2022-11-16 12:25:16,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:16" (1/1) ... [2022-11-16 12:25:16,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:25:16,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:25:17,026 WARN L229 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_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-11-16 12:25:17,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:25:17,040 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:25:17,083 WARN L229 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_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-11-16 12:25:17,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:25:17,101 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:25:17,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17 WrapperNode [2022-11-16 12:25:17,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:25:17,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:25:17,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:25:17,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:25:17,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,148 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2022-11-16 12:25:17,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:25:17,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:25:17,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:25:17,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:25:17,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,196 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:25:17,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:25:17,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:25:17,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:25:17,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (1/1) ... [2022-11-16 12:25:17,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 12:25:17,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:25:17,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 12:25:17,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 12:25:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:25:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:25:17,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:25:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:25:17,393 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:25:17,395 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:25:17,649 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:25:17,655 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:25:17,655 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:25:17,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:17 BoogieIcfgContainer [2022-11-16 12:25:17,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:25:17,658 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 12:25:17,658 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 12:25:17,668 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 12:25:17,669 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:25:17,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:25:16" (1/3) ... [2022-11-16 12:25:17,670 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6245789d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:25:17, skipping insertion in model container [2022-11-16 12:25:17,670 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:25:17,670 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:17" (2/3) ... [2022-11-16 12:25:17,671 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6245789d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:25:17, skipping insertion in model container [2022-11-16 12:25:17,671 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:25:17,671 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:17" (3/3) ... [2022-11-16 12:25:17,672 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2022-11-16 12:25:17,805 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 12:25:17,805 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 12:25:17,805 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 12:25:17,805 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 12:25:17,806 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 12:25:17,806 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 12:25:17,806 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 12:25:17,806 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 12:25:17,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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-16 12:25:17,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-16 12:25:17,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:17,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:17,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:17,865 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:17,865 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 12:25:17,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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-16 12:25:17,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-16 12:25:17,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:17,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:17,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:17,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:17,882 INFO L748 eck$LassoCheckResult]: Stem: 20#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); 5#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_~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_~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;havoc main_~cond~0#1; 17#L113-1true [2022-11-16 12:25:17,883 INFO L750 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 28#L34true 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; 29#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 25#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 27#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 24#L77-1true assume !(0 != main_~p1~0#1); 30#L83-1true assume !(0 != main_~p2~0#1); 14#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 15#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 13#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2022-11-16 12:25:17,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-16 12:25:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:17,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39986184] [2022-11-16 12:25:17,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:18,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:18,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2022-11-16 12:25:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:18,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868162719] [2022-11-16 12:25:18,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:18,279 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-16 12:25:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:18,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868162719] [2022-11-16 12:25:18,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868162719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:18,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:18,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:25:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157084506] [2022-11-16 12:25:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:18,290 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:25:18,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:25:18,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:25:18,331 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 12:25:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:18,401 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2022-11-16 12:25:18,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2022-11-16 12:25:18,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-11-16 12:25:18,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2022-11-16 12:25:18,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-11-16 12:25:18,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-11-16 12:25:18,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2022-11-16 12:25:18,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:18,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-11-16 12:25:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2022-11-16 12:25:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-16 12:25:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 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-16 12:25:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2022-11-16 12:25:18,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-11-16 12:25:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:25:18,482 INFO L428 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-11-16 12:25:18,482 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 12:25:18,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2022-11-16 12:25:18,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-11-16 12:25:18,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:18,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:18,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:18,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:18,493 INFO L748 eck$LassoCheckResult]: Stem: 119#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); 100#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_~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_~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;havoc main_~cond~0#1; 101#L113-1 [2022-11-16 12:25:18,494 INFO L750 eck$LassoCheckResult]: Loop: 101#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 116#L34 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; 121#L53 assume !(0 != main_~p1~0#1); 123#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 142#L57-1 assume !(0 != main_~p3~0#1); 141#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 140#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 139#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 138#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 137#L77-1 assume !(0 != main_~p1~0#1); 136#L83-1 assume !(0 != main_~p2~0#1); 134#L88-1 assume !(0 != main_~p3~0#1); 132#L93-1 assume !(0 != main_~p4~0#1); 129#L98-1 assume !(0 != main_~p5~0#1); 104#L103-1 assume !(0 != main_~p6~0#1); 106#L108-1 assume !(0 != main_~p7~0#1); 101#L113-1 [2022-11-16 12:25:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-16 12:25:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:18,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535185349] [2022-11-16 12:25:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2022-11-16 12:25:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:18,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976653978] [2022-11-16 12:25:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:18,600 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-16 12:25:18,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:18,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976653978] [2022-11-16 12:25:18,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976653978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:18,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:18,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:25:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568607045] [2022-11-16 12:25:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:18,603 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:25:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:18,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:25:18,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:25:18,604 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 12:25:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:18,623 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2022-11-16 12:25:18,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2022-11-16 12:25:18,625 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2022-11-16 12:25:18,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2022-11-16 12:25:18,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2022-11-16 12:25:18,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2022-11-16 12:25:18,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2022-11-16 12:25:18,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:18,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-11-16 12:25:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2022-11-16 12:25:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-16 12:25:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 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-16 12:25:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2022-11-16 12:25:18,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-11-16 12:25:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:25:18,637 INFO L428 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-11-16 12:25:18,637 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 12:25:18,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2022-11-16 12:25:18,639 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2022-11-16 12:25:18,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:18,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:18,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:18,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:18,640 INFO L748 eck$LassoCheckResult]: Stem: 266#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); 243#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_~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_~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;havoc main_~cond~0#1; 244#L113-1 [2022-11-16 12:25:18,640 INFO L750 eck$LassoCheckResult]: Loop: 244#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 305#L34 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; 287#L53 assume !(0 != main_~p1~0#1); 289#L53-2 assume !(0 != main_~p2~0#1); 255#L57-1 assume !(0 != main_~p3~0#1); 250#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 251#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 269#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 293#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 292#L77-1 assume !(0 != main_~p1~0#1); 273#L83-1 assume !(0 != main_~p2~0#1); 274#L88-1 assume !(0 != main_~p3~0#1); 320#L93-1 assume !(0 != main_~p4~0#1); 317#L98-1 assume !(0 != main_~p5~0#1); 315#L103-1 assume !(0 != main_~p6~0#1); 311#L108-1 assume !(0 != main_~p7~0#1); 244#L113-1 [2022-11-16 12:25:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-16 12:25:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:18,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867397155] [2022-11-16 12:25:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2022-11-16 12:25:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:18,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432581263] [2022-11-16 12:25:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:18,712 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-16 12:25:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:18,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432581263] [2022-11-16 12:25:18,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432581263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:18,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:18,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:25:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952696090] [2022-11-16 12:25:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:18,715 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:25:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:25:18,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:25:18,738 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 12:25:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:18,782 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2022-11-16 12:25:18,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2022-11-16 12:25:18,787 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2022-11-16 12:25:18,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2022-11-16 12:25:18,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-11-16 12:25:18,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-11-16 12:25:18,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2022-11-16 12:25:18,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:18,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-11-16 12:25:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2022-11-16 12:25:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-11-16 12:25:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 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-16 12:25:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2022-11-16 12:25:18,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-11-16 12:25:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:25:18,833 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-11-16 12:25:18,834 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 12:25:18,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2022-11-16 12:25:18,840 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2022-11-16 12:25:18,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:18,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:18,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:18,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:18,841 INFO L748 eck$LassoCheckResult]: Stem: 536#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); 513#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_~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_~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;havoc main_~cond~0#1; 514#L113-1 [2022-11-16 12:25:18,842 INFO L750 eck$LassoCheckResult]: Loop: 514#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 575#L34 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; 558#L53 assume !(0 != main_~p1~0#1); 559#L53-2 assume !(0 != main_~p2~0#1); 632#L57-1 assume !(0 != main_~p3~0#1); 629#L61-1 assume !(0 != main_~p4~0#1); 627#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 625#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 623#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 621#L77-1 assume !(0 != main_~p1~0#1); 618#L83-1 assume !(0 != main_~p2~0#1); 615#L88-1 assume !(0 != main_~p3~0#1); 612#L93-1 assume !(0 != main_~p4~0#1); 608#L98-1 assume !(0 != main_~p5~0#1); 605#L103-1 assume !(0 != main_~p6~0#1); 580#L108-1 assume !(0 != main_~p7~0#1); 514#L113-1 [2022-11-16 12:25:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-16 12:25:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:18,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127175070] [2022-11-16 12:25:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:18,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:18,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2022-11-16 12:25:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:18,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471052237] [2022-11-16 12:25:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:18,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:18,961 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-16 12:25:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:18,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471052237] [2022-11-16 12:25:18,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471052237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:18,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:18,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:25:18,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286797903] [2022-11-16 12:25:18,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:18,964 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:25:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:25:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:25:18,966 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 12:25:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:19,001 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-11-16 12:25:19,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2022-11-16 12:25:19,005 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2022-11-16 12:25:19,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2022-11-16 12:25:19,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2022-11-16 12:25:19,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2022-11-16 12:25:19,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2022-11-16 12:25:19,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:19,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-11-16 12:25:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2022-11-16 12:25:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-11-16 12:25:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 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-16 12:25:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2022-11-16 12:25:19,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-11-16 12:25:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:25:19,080 INFO L428 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-11-16 12:25:19,081 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-16 12:25:19,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2022-11-16 12:25:19,084 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2022-11-16 12:25:19,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:19,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:19,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:19,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:19,085 INFO L748 eck$LassoCheckResult]: Stem: 1055#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); 1031#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_~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_~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;havoc main_~cond~0#1; 1032#L113-1 [2022-11-16 12:25:19,085 INFO L750 eck$LassoCheckResult]: Loop: 1032#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1129#L34 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; 1114#L53 assume !(0 != main_~p1~0#1); 1116#L53-2 assume !(0 != main_~p2~0#1); 1096#L57-1 assume !(0 != main_~p3~0#1); 1097#L61-1 assume !(0 != main_~p4~0#1); 1168#L65-1 assume !(0 != main_~p5~0#1); 1167#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1166#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1164#L77-1 assume !(0 != main_~p1~0#1); 1160#L83-1 assume !(0 != main_~p2~0#1); 1157#L88-1 assume !(0 != main_~p3~0#1); 1153#L93-1 assume !(0 != main_~p4~0#1); 1154#L98-1 assume !(0 != main_~p5~0#1); 1145#L103-1 assume !(0 != main_~p6~0#1); 1144#L108-1 assume !(0 != main_~p7~0#1); 1032#L113-1 [2022-11-16 12:25:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-16 12:25:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862121641] [2022-11-16 12:25:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:19,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2022-11-16 12:25:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:19,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69007476] [2022-11-16 12:25:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:19,156 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-16 12:25:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:19,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69007476] [2022-11-16 12:25:19,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69007476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:19,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:19,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:25:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778482816] [2022-11-16 12:25:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:19,158 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:25:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:25:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:25:19,160 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 12:25:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:19,190 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2022-11-16 12:25:19,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2022-11-16 12:25:19,200 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2022-11-16 12:25:19,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2022-11-16 12:25:19,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2022-11-16 12:25:19,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2022-11-16 12:25:19,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2022-11-16 12:25:19,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:19,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-11-16 12:25:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2022-11-16 12:25:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2022-11-16 12:25:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 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-16 12:25:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2022-11-16 12:25:19,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-11-16 12:25:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:25:19,253 INFO L428 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-11-16 12:25:19,253 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-16 12:25:19,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2022-11-16 12:25:19,257 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2022-11-16 12:25:19,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:19,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:19,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:19,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:19,258 INFO L748 eck$LassoCheckResult]: Stem: 2056#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); 2033#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_~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_~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;havoc main_~cond~0#1; 2034#L113-1 [2022-11-16 12:25:19,259 INFO L750 eck$LassoCheckResult]: Loop: 2034#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2163#L34 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; 2159#L53 assume !(0 != main_~p1~0#1); 2157#L53-2 assume !(0 != main_~p2~0#1); 2154#L57-1 assume !(0 != main_~p3~0#1); 2150#L61-1 assume !(0 != main_~p4~0#1); 2147#L65-1 assume !(0 != main_~p5~0#1); 2148#L69-1 assume !(0 != main_~p6~0#1); 2139#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L77-1 assume !(0 != main_~p1~0#1); 2128#L83-1 assume !(0 != main_~p2~0#1); 2130#L88-1 assume !(0 != main_~p3~0#1); 2118#L93-1 assume !(0 != main_~p4~0#1); 2119#L98-1 assume !(0 != main_~p5~0#1); 2172#L103-1 assume !(0 != main_~p6~0#1); 2169#L108-1 assume !(0 != main_~p7~0#1); 2034#L113-1 [2022-11-16 12:25:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-16 12:25:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:19,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454146603] [2022-11-16 12:25:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2022-11-16 12:25:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:19,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815442658] [2022-11-16 12:25:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:19,298 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-16 12:25:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:19,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815442658] [2022-11-16 12:25:19,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815442658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:19,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:19,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:25:19,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096323301] [2022-11-16 12:25:19,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:19,300 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:25:19,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:19,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:25:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:25:19,301 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-16 12:25:19,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:19,321 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2022-11-16 12:25:19,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2022-11-16 12:25:19,331 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2022-11-16 12:25:19,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2022-11-16 12:25:19,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2022-11-16 12:25:19,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2022-11-16 12:25:19,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2022-11-16 12:25:19,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:19,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-11-16 12:25:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2022-11-16 12:25:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2022-11-16 12:25:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 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-16 12:25:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2022-11-16 12:25:19,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-11-16 12:25:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:25:19,376 INFO L428 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-11-16 12:25:19,376 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-16 12:25:19,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2022-11-16 12:25:19,384 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2022-11-16 12:25:19,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:25:19,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:25:19,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 12:25:19,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:19,385 INFO L748 eck$LassoCheckResult]: Stem: 4003#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); 3979#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_~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_~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;havoc main_~cond~0#1; 3980#L113-1 [2022-11-16 12:25:19,386 INFO L750 eck$LassoCheckResult]: Loop: 3980#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4339#L34 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; 4336#L53 assume !(0 != main_~p1~0#1); 4332#L53-2 assume !(0 != main_~p2~0#1); 4329#L57-1 assume !(0 != main_~p3~0#1); 4326#L61-1 assume !(0 != main_~p4~0#1); 4322#L65-1 assume !(0 != main_~p5~0#1); 4323#L69-1 assume !(0 != main_~p6~0#1); 4367#L73-1 assume !(0 != main_~p7~0#1); 4361#L77-1 assume !(0 != main_~p1~0#1); 4356#L83-1 assume !(0 != main_~p2~0#1); 4352#L88-1 assume !(0 != main_~p3~0#1); 4348#L93-1 assume !(0 != main_~p4~0#1); 4346#L98-1 assume !(0 != main_~p5~0#1); 4345#L103-1 assume !(0 != main_~p6~0#1); 4343#L108-1 assume !(0 != main_~p7~0#1); 3980#L113-1 [2022-11-16 12:25:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-16 12:25:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:19,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556396361] [2022-11-16 12:25:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2022-11-16 12:25:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:19,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876908632] [2022-11-16 12:25:19,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:19,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2022-11-16 12:25:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148107156] [2022-11-16 12:25:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:19,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:25:19 BoogieIcfgContainer [2022-11-16 12:25:19,821 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-16 12:25:19,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:25:19,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:25:19,822 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:25:19,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:17" (3/4) ... [2022-11-16 12:25:19,826 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-16 12:25:19,891 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:25:19,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:25:19,900 INFO L158 Benchmark]: Toolchain (without parser) took 3153.35ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 85.6MB in the beginning and 49.9MB in the end (delta: 35.7MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2022-11-16 12:25:19,902 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:25:19,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.51ms. Allocated memory is still 123.7MB. Free memory was 85.3MB in the beginning and 97.2MB in the end (delta: -11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:25:19,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.72ms. Allocated memory is still 123.7MB. Free memory was 97.2MB in the beginning and 96.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:25:19,903 INFO L158 Benchmark]: Boogie Preprocessor took 60.88ms. Allocated memory is still 123.7MB. Free memory was 96.0MB in the beginning and 94.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:25:19,903 INFO L158 Benchmark]: RCFGBuilder took 445.47ms. Allocated memory is still 123.7MB. Free memory was 94.6MB in the beginning and 83.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:25:19,906 INFO L158 Benchmark]: BuchiAutomizer took 2163.46ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 83.1MB in the beginning and 52.0MB in the end (delta: 31.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2022-11-16 12:25:19,906 INFO L158 Benchmark]: Witness Printer took 77.54ms. Allocated memory is still 148.9MB. Free memory was 51.0MB in the beginning and 49.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:25:19,908 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.51ms. Allocated memory is still 123.7MB. Free memory was 85.3MB in the beginning and 97.2MB in the end (delta: -11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.72ms. Allocated memory is still 123.7MB. Free memory was 97.2MB in the beginning and 96.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.88ms. Allocated memory is still 123.7MB. Free memory was 96.0MB in the beginning and 94.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.47ms. Allocated memory is still 123.7MB. Free memory was 94.6MB in the beginning and 83.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2163.46ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 83.1MB in the beginning and 52.0MB in the end (delta: 31.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Witness Printer took 77.54ms. Allocated memory is still 148.9MB. Free memory was 51.0MB in the beginning and 49.9MB in the end (delta: 1.0MB). There was no memory consumed. 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s 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, 179 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 558 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 350 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:25:19,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8525f39-ebe5-4d61-95eb-c6b4d9fbc880/bin/uautomizer-tPACEb0tL8/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)