./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:29:46,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:29:46,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:29:46,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:29:46,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:29:46,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:29:46,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:29:46,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:29:46,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:29:46,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:29:46,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:29:46,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:29:46,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:29:46,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:29:46,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:29:46,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:29:46,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:29:46,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:29:46,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:29:46,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:29:46,752 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:29:46,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:29:46,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:29:46,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:29:46,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:29:46,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:29:46,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:29:46,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:29:46,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:29:46,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:29:46,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:29:46,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:29:46,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:29:46,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:29:46,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:29:46,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:29:46,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:29:46,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:29:46,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:29:46,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:29:46,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:29:46,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:29:46,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:29:46,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:29:46,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:29:46,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:29:46,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:29:46,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:29:46,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:29:46,807 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:29:46,807 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:29:46,807 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:29:46,808 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:29:46,808 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:29:46,808 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:29:46,809 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:29:46,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:29:46,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:29:46,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:29:46,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:29:46,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:29:46,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:29:46,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:29:46,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:29:46,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:29:46,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:29:46,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:29:46,811 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:29:46,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:29:46,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:29:46,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:29:46,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:29:46,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:29:46,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:29:46,814 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:29:46,814 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2022-07-13 03:29:47,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:29:47,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:29:47,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:29:47,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:29:47,063 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:29:47,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2022-07-13 03:29:47,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b56dd9d/cedcc7fa971c489c924a7ce9c5f06d0f/FLAG82fb18a1e [2022-07-13 03:29:47,573 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:29:47,576 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2022-07-13 03:29:47,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b56dd9d/cedcc7fa971c489c924a7ce9c5f06d0f/FLAG82fb18a1e [2022-07-13 03:29:47,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b56dd9d/cedcc7fa971c489c924a7ce9c5f06d0f [2022-07-13 03:29:47,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:29:47,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:29:47,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:47,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:29:47,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:29:47,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:47" (1/1) ... [2022-07-13 03:29:47,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2029bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:47, skipping insertion in model container [2022-07-13 03:29:47,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:47" (1/1) ... [2022-07-13 03:29:47,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:29:48,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:29:48,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-07-13 03:29:48,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:48,185 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:29:48,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-07-13 03:29:48,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:48,219 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:29:48,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48 WrapperNode [2022-07-13 03:29:48,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:48,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:48,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:29:48,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:29:48,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,264 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-07-13 03:29:48,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:48,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:29:48,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:29:48,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:29:48,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:29:48,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:29:48,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:29:48,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:29:48,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:29:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:29:48,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:29:48,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:29:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:29:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:29:48,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:29:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:29:48,460 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:29:48,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:29:48,672 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:29:48,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:29:48,678 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:29:48,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:48 BoogieIcfgContainer [2022-07-13 03:29:48,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:29:48,681 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:29:48,681 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:29:48,696 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:29:48,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:48,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:29:47" (1/3) ... [2022-07-13 03:29:48,711 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b28766b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:48, skipping insertion in model container [2022-07-13 03:29:48,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:48,711 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (2/3) ... [2022-07-13 03:29:48,711 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b28766b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:48, skipping insertion in model container [2022-07-13 03:29:48,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:48,712 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:48" (3/3) ... [2022-07-13 03:29:48,713 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2022-07-13 03:29:48,768 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:29:48,769 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:29:48,769 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:29:48,769 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:29:48,769 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:29:48,769 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:29:48,769 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:29:48,770 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:29:48,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:48,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-07-13 03:29:48,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:48,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:48,804 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:48,804 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:48,804 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:29:48,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:48,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-07-13 03:29:48,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:48,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:48,833 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:48,834 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:48,840 INFO L752 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 33#L183-1true [2022-07-13 03:29:48,842 INFO L754 eck$LassoCheckResult]: Loop: 33#L183-1true assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 17#L49true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 34#L78true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L78-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L82-1true assume !(0 != main_~p3~0#1); 8#L86-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 35#L90-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 11#L94-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 19#L98-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 32#L102-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 15#L106-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 25#L110-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 41#L114-1true assume !(0 != main_~p11~0#1); 30#L118-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13#L122-1true assume !(0 != main_~p1~0#1); 27#L128-1true assume !(0 != main_~p2~0#1); 4#L133-1true assume !(0 != main_~p3~0#1); 3#L138-1true assume !(0 != main_~p4~0#1); 26#L143-1true assume !(0 != main_~p5~0#1); 5#L148-1true assume !(0 != main_~p6~0#1); 21#L153-1true assume !(0 != main_~p7~0#1); 38#L158-1true assume !(0 != main_~p8~0#1); 23#L163-1true assume !(0 != main_~p9~0#1); 40#L168-1true assume !(0 != main_~p10~0#1); 18#L173-1true assume !(0 != main_~p11~0#1); 7#L178-1true assume !(0 != main_~p12~0#1); 33#L183-1true [2022-07-13 03:29:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:29:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:48,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703522434] [2022-07-13 03:29:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:48,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2022-07-13 03:29:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172488685] [2022-07-13 03:29:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172488685] [2022-07-13 03:29:49,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172488685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93235964] [2022-07-13 03:29:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,147 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,185 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,232 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2022-07-13 03:29:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2022-07-13 03:29:49,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-07-13 03:29:49,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2022-07-13 03:29:49,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-07-13 03:29:49,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-07-13 03:29:49,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2022-07-13 03:29:49,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,255 INFO L369 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-07-13 03:29:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2022-07-13 03:29:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-13 03:29:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 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-07-13 03:29:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2022-07-13 03:29:49,285 INFO L392 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-07-13 03:29:49,286 INFO L374 stractBuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-07-13 03:29:49,286 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:29:49,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2022-07-13 03:29:49,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-07-13 03:29:49,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,289 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,289 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:49,289 INFO L752 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 151#L183-1 [2022-07-13 03:29:49,290 INFO L754 eck$LassoCheckResult]: Loop: 151#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 167#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 168#L78 assume !(0 != main_~p1~0#1); 196#L78-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 195#L82-1 assume !(0 != main_~p3~0#1); 153#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 154#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 194#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 193#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 192#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 191#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 187#L114-1 assume !(0 != main_~p11~0#1); 188#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 189#L122-1 assume !(0 != main_~p1~0#1); 179#L128-1 assume !(0 != main_~p2~0#1); 144#L133-1 assume !(0 != main_~p3~0#1); 141#L138-1 assume !(0 != main_~p4~0#1); 142#L143-1 assume !(0 != main_~p5~0#1); 146#L148-1 assume !(0 != main_~p6~0#1); 148#L153-1 assume !(0 != main_~p7~0#1); 156#L158-1 assume !(0 != main_~p8~0#1); 205#L163-1 assume !(0 != main_~p9~0#1); 185#L168-1 assume !(0 != main_~p10~0#1); 169#L173-1 assume !(0 != main_~p11~0#1); 149#L178-1 assume !(0 != main_~p12~0#1); 151#L183-1 [2022-07-13 03:29:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:29:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019818252] [2022-07-13 03:29:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2022-07-13 03:29:49,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422844863] [2022-07-13 03:29:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422844863] [2022-07-13 03:29:49,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422844863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451217104] [2022-07-13 03:29:49,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,346 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,348 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,366 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2022-07-13 03:29:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2022-07-13 03:29:49,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-07-13 03:29:49,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2022-07-13 03:29:49,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2022-07-13 03:29:49,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2022-07-13 03:29:49,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2022-07-13 03:29:49,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,374 INFO L369 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-07-13 03:29:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2022-07-13 03:29:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-13 03:29:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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-07-13 03:29:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2022-07-13 03:29:49,385 INFO L392 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-07-13 03:29:49,385 INFO L374 stractBuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-07-13 03:29:49,386 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:29:49,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2022-07-13 03:29:49,388 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-07-13 03:29:49,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,389 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,389 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:49,389 INFO L752 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 387#L183-1 [2022-07-13 03:29:49,389 INFO L754 eck$LassoCheckResult]: Loop: 387#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 405#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 406#L78 assume !(0 != main_~p1~0#1); 483#L78-2 assume !(0 != main_~p2~0#1); 396#L82-1 assume !(0 != main_~p3~0#1); 390#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 391#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 475#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 471#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 469#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 466#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 464#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 427#L114-1 assume !(0 != main_~p11~0#1); 419#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 420#L122-1 assume !(0 != main_~p1~0#1); 458#L128-1 assume !(0 != main_~p2~0#1); 377#L133-1 assume !(0 != main_~p3~0#1); 379#L138-1 assume !(0 != main_~p4~0#1); 448#L143-1 assume !(0 != main_~p5~0#1); 446#L148-1 assume !(0 != main_~p6~0#1); 444#L153-1 assume !(0 != main_~p7~0#1); 424#L158-1 assume !(0 != main_~p8~0#1); 409#L163-1 assume !(0 != main_~p9~0#1); 411#L168-1 assume !(0 != main_~p10~0#1); 439#L173-1 assume !(0 != main_~p11~0#1); 434#L178-1 assume !(0 != main_~p12~0#1); 387#L183-1 [2022-07-13 03:29:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:29:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464707941] [2022-07-13 03:29:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2022-07-13 03:29:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662966843] [2022-07-13 03:29:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662966843] [2022-07-13 03:29:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662966843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581354812] [2022-07-13 03:29:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,441 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,445 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,466 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2022-07-13 03:29:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2022-07-13 03:29:49,471 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-07-13 03:29:49,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2022-07-13 03:29:49,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2022-07-13 03:29:49,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2022-07-13 03:29:49,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2022-07-13 03:29:49,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,477 INFO L369 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-07-13 03:29:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2022-07-13 03:29:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-07-13 03:29:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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-07-13 03:29:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2022-07-13 03:29:49,493 INFO L392 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-07-13 03:29:49,493 INFO L374 stractBuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-07-13 03:29:49,493 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:29:49,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2022-07-13 03:29:49,496 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-07-13 03:29:49,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,497 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,497 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:49,497 INFO L752 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 832#L183-1 [2022-07-13 03:29:49,497 INFO L754 eck$LassoCheckResult]: Loop: 832#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 936#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 930#L78 assume !(0 != main_~p1~0#1); 931#L78-2 assume !(0 != main_~p2~0#1); 1011#L82-1 assume !(0 != main_~p3~0#1); 1007#L86-1 assume !(0 != main_~p4~0#1); 1004#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1001#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 998#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 995#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 992#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 989#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 986#L114-1 assume !(0 != main_~p11~0#1); 981#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 932#L122-1 assume !(0 != main_~p1~0#1); 933#L128-1 assume !(0 != main_~p2~0#1); 977#L133-1 assume !(0 != main_~p3~0#1); 972#L138-1 assume !(0 != main_~p4~0#1); 969#L143-1 assume !(0 != main_~p5~0#1); 965#L148-1 assume !(0 != main_~p6~0#1); 961#L153-1 assume !(0 != main_~p7~0#1); 957#L158-1 assume !(0 != main_~p8~0#1); 953#L163-1 assume !(0 != main_~p9~0#1); 949#L168-1 assume !(0 != main_~p10~0#1); 944#L173-1 assume !(0 != main_~p11~0#1); 941#L178-1 assume !(0 != main_~p12~0#1); 832#L183-1 [2022-07-13 03:29:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:29:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887319296] [2022-07-13 03:29:49,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2022-07-13 03:29:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271687577] [2022-07-13 03:29:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271687577] [2022-07-13 03:29:49,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271687577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603040361] [2022-07-13 03:29:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,538 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,539 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,555 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2022-07-13 03:29:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2022-07-13 03:29:49,561 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-07-13 03:29:49,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2022-07-13 03:29:49,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-07-13 03:29:49,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-07-13 03:29:49,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2022-07-13 03:29:49,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,569 INFO L369 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-07-13 03:29:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2022-07-13 03:29:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-07-13 03:29:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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-07-13 03:29:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2022-07-13 03:29:49,588 INFO L392 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-07-13 03:29:49,588 INFO L374 stractBuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-07-13 03:29:49,588 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:29:49,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2022-07-13 03:29:49,591 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-07-13 03:29:49,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,592 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,592 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:49,592 INFO L752 eck$LassoCheckResult]: Stem: 1741#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 1710#L183-1 [2022-07-13 03:29:49,593 INFO L754 eck$LassoCheckResult]: Loop: 1710#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1939#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 1938#L78 assume !(0 != main_~p1~0#1); 1937#L78-2 assume !(0 != main_~p2~0#1); 1928#L82-1 assume !(0 != main_~p3~0#1); 1929#L86-1 assume !(0 != main_~p4~0#1); 1910#L90-1 assume !(0 != main_~p5~0#1); 1912#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1894#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1895#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1878#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1879#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1862#L114-1 assume !(0 != main_~p11~0#1); 1863#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1846#L122-1 assume !(0 != main_~p1~0#1); 1847#L128-1 assume !(0 != main_~p2~0#1); 1967#L133-1 assume !(0 != main_~p3~0#1); 1964#L138-1 assume !(0 != main_~p4~0#1); 1961#L143-1 assume !(0 != main_~p5~0#1); 1960#L148-1 assume !(0 != main_~p6~0#1); 1958#L153-1 assume !(0 != main_~p7~0#1); 1956#L158-1 assume !(0 != main_~p8~0#1); 1953#L163-1 assume !(0 != main_~p9~0#1); 1951#L168-1 assume !(0 != main_~p10~0#1); 1945#L173-1 assume !(0 != main_~p11~0#1); 1942#L178-1 assume !(0 != main_~p12~0#1); 1710#L183-1 [2022-07-13 03:29:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-13 03:29:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508189225] [2022-07-13 03:29:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2022-07-13 03:29:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419074050] [2022-07-13 03:29:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419074050] [2022-07-13 03:29:49,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419074050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120576253] [2022-07-13 03:29:49,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,668 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,670 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,711 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2022-07-13 03:29:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2022-07-13 03:29:49,720 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-07-13 03:29:49,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-07-13 03:29:49,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2022-07-13 03:29:49,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2022-07-13 03:29:49,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2022-07-13 03:29:49,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,764 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-07-13 03:29:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2022-07-13 03:29:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2022-07-13 03:29:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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-07-13 03:29:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-07-13 03:29:49,787 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-07-13 03:29:49,787 INFO L374 stractBuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-07-13 03:29:49,787 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:29:49,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2022-07-13 03:29:49,796 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-07-13 03:29:49,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,798 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,798 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:49,798 INFO L752 eck$LassoCheckResult]: Stem: 3463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3431#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 3432#L183-1 [2022-07-13 03:29:49,799 INFO L754 eck$LassoCheckResult]: Loop: 3432#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3657#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 3654#L78 assume !(0 != main_~p1~0#1); 3651#L78-2 assume !(0 != main_~p2~0#1); 3644#L82-1 assume !(0 != main_~p3~0#1); 3645#L86-1 assume !(0 != main_~p4~0#1); 3627#L90-1 assume !(0 != main_~p5~0#1); 3629#L94-1 assume !(0 != main_~p6~0#1); 3613#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3614#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3599#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3600#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3585#L114-1 assume !(0 != main_~p11~0#1); 3586#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3567#L122-1 assume !(0 != main_~p1~0#1); 3568#L128-1 assume !(0 != main_~p2~0#1); 3691#L133-1 assume !(0 != main_~p3~0#1); 3688#L138-1 assume !(0 != main_~p4~0#1); 3686#L143-1 assume !(0 != main_~p5~0#1); 3684#L148-1 assume !(0 != main_~p6~0#1); 3681#L153-1 assume !(0 != main_~p7~0#1); 3677#L158-1 assume !(0 != main_~p8~0#1); 3673#L163-1 assume !(0 != main_~p9~0#1); 3669#L168-1 assume !(0 != main_~p10~0#1); 3664#L173-1 assume !(0 != main_~p11~0#1); 3661#L178-1 assume !(0 != main_~p12~0#1); 3432#L183-1 [2022-07-13 03:29:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-13 03:29:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739182033] [2022-07-13 03:29:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,815 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2022-07-13 03:29:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831511247] [2022-07-13 03:29:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831511247] [2022-07-13 03:29:49,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831511247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630293815] [2022-07-13 03:29:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,858 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,859 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,878 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2022-07-13 03:29:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2022-07-13 03:29:49,907 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-07-13 03:29:49,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-07-13 03:29:49,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2022-07-13 03:29:49,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2022-07-13 03:29:49,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2022-07-13 03:29:49,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,925 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-07-13 03:29:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2022-07-13 03:29:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2022-07-13 03:29:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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-07-13 03:29:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-07-13 03:29:49,970 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-07-13 03:29:49,971 INFO L374 stractBuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-07-13 03:29:49,973 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:29:49,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2022-07-13 03:29:49,987 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-07-13 03:29:49,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,989 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,990 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:49,990 INFO L752 eck$LassoCheckResult]: Stem: 6848#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6817#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 6818#L183-1 [2022-07-13 03:29:49,990 INFO L754 eck$LassoCheckResult]: Loop: 6818#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 7040#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 7037#L78 assume !(0 != main_~p1~0#1); 7034#L78-2 assume !(0 != main_~p2~0#1); 7026#L82-1 assume !(0 != main_~p3~0#1); 7027#L86-1 assume !(0 != main_~p4~0#1); 7010#L90-1 assume !(0 != main_~p5~0#1); 7011#L94-1 assume !(0 != main_~p6~0#1); 6994#L98-1 assume !(0 != main_~p7~0#1); 6996#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6982#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6983#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6970#L114-1 assume !(0 != main_~p11~0#1); 6971#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6953#L122-1 assume !(0 != main_~p1~0#1); 6954#L128-1 assume !(0 != main_~p2~0#1); 7073#L133-1 assume !(0 != main_~p3~0#1); 7070#L138-1 assume !(0 != main_~p4~0#1); 7068#L143-1 assume !(0 != main_~p5~0#1); 7066#L148-1 assume !(0 != main_~p6~0#1); 7064#L153-1 assume !(0 != main_~p7~0#1); 7061#L158-1 assume !(0 != main_~p8~0#1); 7057#L163-1 assume !(0 != main_~p9~0#1); 7053#L168-1 assume !(0 != main_~p10~0#1); 7048#L173-1 assume !(0 != main_~p11~0#1); 7045#L178-1 assume !(0 != main_~p12~0#1); 6818#L183-1 [2022-07-13 03:29:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-13 03:29:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113665851] [2022-07-13 03:29:49,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2022-07-13 03:29:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509537731] [2022-07-13 03:29:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509537731] [2022-07-13 03:29:50,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509537731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323667138] [2022-07-13 03:29:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,051 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,052 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,091 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2022-07-13 03:29:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2022-07-13 03:29:50,132 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-07-13 03:29:50,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-07-13 03:29:50,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2022-07-13 03:29:50,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2022-07-13 03:29:50,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2022-07-13 03:29:50,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:50,169 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-07-13 03:29:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2022-07-13 03:29:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2022-07-13 03:29:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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-07-13 03:29:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-07-13 03:29:50,264 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-07-13 03:29:50,264 INFO L374 stractBuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-07-13 03:29:50,265 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:29:50,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2022-07-13 03:29:50,290 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-07-13 03:29:50,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,292 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,307 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:50,308 INFO L752 eck$LassoCheckResult]: Stem: 13515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 13482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 13483#L183-1 [2022-07-13 03:29:50,308 INFO L754 eck$LassoCheckResult]: Loop: 13483#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 13834#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 13830#L78 assume !(0 != main_~p1~0#1); 13827#L78-2 assume !(0 != main_~p2~0#1); 13712#L82-1 assume !(0 != main_~p3~0#1); 13713#L86-1 assume !(0 != main_~p4~0#1); 13693#L90-1 assume !(0 != main_~p5~0#1); 13694#L94-1 assume !(0 != main_~p6~0#1); 13674#L98-1 assume !(0 != main_~p7~0#1); 13676#L102-1 assume !(0 != main_~p8~0#1); 13653#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 13654#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 13637#L114-1 assume !(0 != main_~p11~0#1); 13638#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13618#L122-1 assume !(0 != main_~p1~0#1); 13619#L128-1 assume !(0 != main_~p2~0#1); 13867#L133-1 assume !(0 != main_~p3~0#1); 13862#L138-1 assume !(0 != main_~p4~0#1); 13858#L143-1 assume !(0 != main_~p5~0#1); 13824#L148-1 assume !(0 != main_~p6~0#1); 13826#L153-1 assume !(0 != main_~p7~0#1); 13853#L158-1 assume !(0 != main_~p8~0#1); 13850#L163-1 assume !(0 != main_~p9~0#1); 13846#L168-1 assume !(0 != main_~p10~0#1); 13841#L173-1 assume !(0 != main_~p11~0#1); 13838#L178-1 assume !(0 != main_~p12~0#1); 13483#L183-1 [2022-07-13 03:29:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,309 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-13 03:29:50,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399925772] [2022-07-13 03:29:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2022-07-13 03:29:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721892503] [2022-07-13 03:29:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721892503] [2022-07-13 03:29:50,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721892503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980333627] [2022-07-13 03:29:50,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,385 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,386 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,438 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2022-07-13 03:29:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2022-07-13 03:29:50,503 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-07-13 03:29:50,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-07-13 03:29:50,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2022-07-13 03:29:50,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2022-07-13 03:29:50,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2022-07-13 03:29:50,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:50,586 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-07-13 03:29:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2022-07-13 03:29:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2022-07-13 03:29:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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-07-13 03:29:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-07-13 03:29:50,806 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-07-13 03:29:50,806 INFO L374 stractBuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-07-13 03:29:50,806 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:29:50,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2022-07-13 03:29:50,843 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-07-13 03:29:50,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,846 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,846 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:50,846 INFO L752 eck$LassoCheckResult]: Stem: 26646#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 26612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 26613#L183-1 [2022-07-13 03:29:50,847 INFO L754 eck$LassoCheckResult]: Loop: 26613#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 27025#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 27021#L78 assume !(0 != main_~p1~0#1); 27018#L78-2 assume !(0 != main_~p2~0#1); 27019#L82-1 assume !(0 != main_~p3~0#1); 27063#L86-1 assume !(0 != main_~p4~0#1); 26838#L90-1 assume !(0 != main_~p5~0#1); 26839#L94-1 assume !(0 != main_~p6~0#1); 26819#L98-1 assume !(0 != main_~p7~0#1); 26821#L102-1 assume !(0 != main_~p8~0#1); 26795#L106-1 assume !(0 != main_~p9~0#1); 26797#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26778#L114-1 assume !(0 != main_~p11~0#1); 26779#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26759#L122-1 assume !(0 != main_~p1~0#1); 26760#L128-1 assume !(0 != main_~p2~0#1); 27053#L133-1 assume !(0 != main_~p3~0#1); 26987#L138-1 assume !(0 != main_~p4~0#1); 26988#L143-1 assume !(0 != main_~p5~0#1); 27049#L148-1 assume !(0 != main_~p6~0#1); 27047#L153-1 assume !(0 != main_~p7~0#1); 27044#L158-1 assume !(0 != main_~p8~0#1); 27040#L163-1 assume !(0 != main_~p9~0#1); 27037#L168-1 assume !(0 != main_~p10~0#1); 27032#L173-1 assume !(0 != main_~p11~0#1); 27029#L178-1 assume !(0 != main_~p12~0#1); 26613#L183-1 [2022-07-13 03:29:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-13 03:29:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783004] [2022-07-13 03:29:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2022-07-13 03:29:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780546175] [2022-07-13 03:29:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780546175] [2022-07-13 03:29:50,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780546175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253399109] [2022-07-13 03:29:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,876 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,876 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,940 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2022-07-13 03:29:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2022-07-13 03:29:51,130 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-07-13 03:29:51,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-07-13 03:29:51,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2022-07-13 03:29:51,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2022-07-13 03:29:51,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2022-07-13 03:29:51,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:51,339 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-07-13 03:29:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2022-07-13 03:29:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2022-07-13 03:29:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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-07-13 03:29:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-07-13 03:29:51,780 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-07-13 03:29:51,780 INFO L374 stractBuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-07-13 03:29:51,781 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:29:51,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2022-07-13 03:29:51,841 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-07-13 03:29:51,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:51,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:51,842 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:51,842 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:51,842 INFO L752 eck$LassoCheckResult]: Stem: 52512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 52479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 52480#L183-1 [2022-07-13 03:29:51,842 INFO L754 eck$LassoCheckResult]: Loop: 52480#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 53075#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 53070#L78 assume !(0 != main_~p1~0#1); 53071#L78-2 assume !(0 != main_~p2~0#1); 53058#L82-1 assume !(0 != main_~p3~0#1); 53059#L86-1 assume !(0 != main_~p4~0#1); 53047#L90-1 assume !(0 != main_~p5~0#1); 53049#L94-1 assume !(0 != main_~p6~0#1); 53158#L98-1 assume !(0 != main_~p7~0#1); 53150#L102-1 assume !(0 != main_~p8~0#1); 53145#L106-1 assume !(0 != main_~p9~0#1); 53142#L110-1 assume !(0 != main_~p10~0#1); 53137#L114-1 assume !(0 != main_~p11~0#1); 53132#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 53127#L122-1 assume !(0 != main_~p1~0#1); 53121#L128-1 assume !(0 != main_~p2~0#1); 53120#L133-1 assume !(0 != main_~p3~0#1); 53116#L138-1 assume !(0 != main_~p4~0#1); 53113#L143-1 assume !(0 != main_~p5~0#1); 53109#L148-1 assume !(0 != main_~p6~0#1); 53105#L153-1 assume !(0 != main_~p7~0#1); 53101#L158-1 assume !(0 != main_~p8~0#1); 53097#L163-1 assume !(0 != main_~p9~0#1); 53089#L168-1 assume !(0 != main_~p10~0#1); 53087#L173-1 assume !(0 != main_~p11~0#1); 53086#L178-1 assume !(0 != main_~p12~0#1); 52480#L183-1 [2022-07-13 03:29:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-07-13 03:29:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276416162] [2022-07-13 03:29:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2022-07-13 03:29:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117527623] [2022-07-13 03:29:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:51,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:51,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117527623] [2022-07-13 03:29:51,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117527623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:51,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:51,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:29:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952064207] [2022-07-13 03:29:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:51,884 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:51,885 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-07-13 03:29:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:52,098 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2022-07-13 03:29:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:52,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2022-07-13 03:29:52,265 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2022-07-13 03:29:52,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2022-07-13 03:29:52,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2022-07-13 03:29:52,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2022-07-13 03:29:52,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2022-07-13 03:29:52,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:52,535 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-07-13 03:29:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2022-07-13 03:29:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2022-07-13 03:29:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33794 states, 33794 states have (on average 1.4242173166834349) internal successors, (48130), 33793 states have internal predecessors, (48130), 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-07-13 03:29:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2022-07-13 03:29:53,118 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-07-13 03:29:53,118 INFO L374 stractBuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-07-13 03:29:53,118 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:29:53,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2022-07-13 03:29:53,415 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2022-07-13 03:29:53,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:53,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:53,420 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:53,420 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:53,420 INFO L752 eck$LassoCheckResult]: Stem: 103466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 103432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 103433#L183-1 [2022-07-13 03:29:53,420 INFO L754 eck$LassoCheckResult]: Loop: 103433#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 103596#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 103594#L78 assume !(0 != main_~p1~0#1); 103590#L78-2 assume !(0 != main_~p2~0#1); 103588#L82-1 assume !(0 != main_~p3~0#1); 103584#L86-1 assume !(0 != main_~p4~0#1); 103580#L90-1 assume !(0 != main_~p5~0#1); 103576#L94-1 assume !(0 != main_~p6~0#1); 103572#L98-1 assume !(0 != main_~p7~0#1); 103568#L102-1 assume !(0 != main_~p8~0#1); 103564#L106-1 assume !(0 != main_~p9~0#1); 103560#L110-1 assume !(0 != main_~p10~0#1); 103558#L114-1 assume !(0 != main_~p11~0#1); 103554#L118-1 assume !(0 != main_~p12~0#1); 103551#L122-1 assume !(0 != main_~p1~0#1); 103552#L128-1 assume !(0 != main_~p2~0#1); 103636#L133-1 assume !(0 != main_~p3~0#1); 103631#L138-1 assume !(0 != main_~p4~0#1); 103627#L143-1 assume !(0 != main_~p5~0#1); 103623#L148-1 assume !(0 != main_~p6~0#1); 103619#L153-1 assume !(0 != main_~p7~0#1); 103615#L158-1 assume !(0 != main_~p8~0#1); 103611#L163-1 assume !(0 != main_~p9~0#1); 103607#L168-1 assume !(0 != main_~p10~0#1); 103603#L173-1 assume !(0 != main_~p11~0#1); 103599#L178-1 assume !(0 != main_~p12~0#1); 103433#L183-1 [2022-07-13 03:29:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-07-13 03:29:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:53,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394250999] [2022-07-13 03:29:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2022-07-13 03:29:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:53,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768095798] [2022-07-13 03:29:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2022-07-13 03:29:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:53,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902314819] [2022-07-13 03:29:53,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:53,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:53,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:29:53 BoogieIcfgContainer [2022-07-13 03:29:53,797 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:29:53,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:29:53,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:29:53,798 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:29:53,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:48" (3/4) ... [2022-07-13 03:29:53,800 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:29:53,833 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:29:53,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:29:53,834 INFO L158 Benchmark]: Toolchain (without parser) took 5858.90ms. Allocated memory was 90.2MB in the beginning and 681.6MB in the end (delta: 591.4MB). Free memory was 48.1MB in the beginning and 397.5MB in the end (delta: -349.4MB). Peak memory consumption was 241.5MB. Max. memory is 16.1GB. [2022-07-13 03:29:53,834 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:29:53,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.22ms. Allocated memory is still 90.2MB. Free memory was 47.9MB in the beginning and 59.3MB in the end (delta: -11.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 03:29:53,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.97ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 57.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:29:53,835 INFO L158 Benchmark]: Boogie Preprocessor took 49.02ms. Allocated memory is still 90.2MB. Free memory was 57.5MB in the beginning and 56.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:29:53,835 INFO L158 Benchmark]: RCFGBuilder took 363.16ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 44.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 03:29:53,835 INFO L158 Benchmark]: BuchiAutomizer took 5116.33ms. Allocated memory was 90.2MB in the beginning and 681.6MB in the end (delta: 591.4MB). Free memory was 44.1MB in the beginning and 399.5MB in the end (delta: -355.3MB). Peak memory consumption was 237.7MB. Max. memory is 16.1GB. [2022-07-13 03:29:53,836 INFO L158 Benchmark]: Witness Printer took 35.51ms. Allocated memory is still 681.6MB. Free memory was 399.5MB in the beginning and 397.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:29:53,837 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.21ms. Allocated memory is still 90.2MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.22ms. Allocated memory is still 90.2MB. Free memory was 47.9MB in the beginning and 59.3MB in the end (delta: -11.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.97ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 57.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.02ms. Allocated memory is still 90.2MB. Free memory was 57.5MB in the beginning and 56.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.16ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 44.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5116.33ms. Allocated memory was 90.2MB in the beginning and 681.6MB in the end (delta: 591.4MB). Free memory was 44.1MB in the beginning and 399.5MB in the end (delta: -355.3MB). Peak memory consumption was 237.7MB. Max. memory is 16.1GB. * Witness Printer took 35.51ms. Allocated memory is still 681.6MB. Free memory was 399.5MB in the beginning and 397.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33794 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.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, 496 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 1552 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 595 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 957 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 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 - FixpointNonTerminationResult [Line: 47]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, lk5=0, p1=0, NULL=0, p9=0, lk9=0, NULL=1, lk12=0, cond=4, p5=0, p12=0, p10=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27fb9dd4=0, lk11=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30a8716=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@710caaa2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@333668aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fc0fabd=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7701617e=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3830d93c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43dee6d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@701e9c0a=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@384385a6=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d29d3e1=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4724dc6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63ee0f99=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 47]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:29:53,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)