./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:10:43,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:10:43,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:10:43,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:10:43,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:10:43,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:10:43,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:10:43,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:10:43,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:10:43,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:10:43,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:10:43,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:10:43,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:10:43,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:10:43,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:10:43,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:10:43,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:10:43,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:10:43,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:10:43,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:10:43,763 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:10:43,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:10:43,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:10:43,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:10:43,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:10:43,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:10:43,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:10:43,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:10:43,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:10:43,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:10:43,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:10:43,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:10:43,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:10:43,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:10:43,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:10:43,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:10:43,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:10:43,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:10:43,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:10:43,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:10:43,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:10:43,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:10:43,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:10:43,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:10:43,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:10:43,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:10:43,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:10:43,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:10:43,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:10:43,807 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:10:43,807 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:10:43,807 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:10:43,808 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:10:43,808 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:10:43,808 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:10:43,808 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:10:43,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:10:43,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:10:43,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:10:43,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:10:43,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:10:43,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:10:43,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:10:43,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:10:43,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:10:43,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:10:43,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:10:43,811 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:10:43,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:10:43,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:10:43,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:10:43,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:10:43,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:10:43,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:10:43,813 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:10:43,813 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-07-14 15:10:44,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:10:44,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:10:44,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:10:44,056 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:10:44,056 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:10:44,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2022-07-14 15:10:44,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93d3d90c/6c4288cb337f4600a1f4308b59ffa445/FLAGc3393ada6 [2022-07-14 15:10:44,443 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:10:44,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2022-07-14 15:10:44,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93d3d90c/6c4288cb337f4600a1f4308b59ffa445/FLAGc3393ada6 [2022-07-14 15:10:44,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93d3d90c/6c4288cb337f4600a1f4308b59ffa445 [2022-07-14 15:10:44,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:10:44,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:10:44,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:10:44,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:10:44,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:10:44,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:10:44" (1/1) ... [2022-07-14 15:10:44,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7e1f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:44, skipping insertion in model container [2022-07-14 15:10:44,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:10:44" (1/1) ... [2022-07-14 15:10:44,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:10:44,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:10:44,997 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_11.c[4246,4259] [2022-07-14 15:10:44,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:10:45,004 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:10:45,025 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_11.c[4246,4259] [2022-07-14 15:10:45,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:10:45,035 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:10:45,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45 WrapperNode [2022-07-14 15:10:45,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:10:45,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:10:45,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:10:45,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:10:45,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,083 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2022-07-14 15:10:45,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:10:45,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:10:45,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:10:45,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:10:45,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:10:45,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:10:45,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:10:45,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:10:45,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (1/1) ... [2022-07-14 15:10:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:10:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:10:45,173 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-14 15:10:45,192 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-14 15:10:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:10:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:10:45,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:10:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:10:45,262 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:10:45,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:10:45,434 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:10:45,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:10:45,438 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 15:10:45,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:10:45 BoogieIcfgContainer [2022-07-14 15:10:45,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:10:45,440 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:10:45,440 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:10:45,453 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:10:45,454 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:10:45,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:10:44" (1/3) ... [2022-07-14 15:10:45,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46ecbc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:10:45, skipping insertion in model container [2022-07-14 15:10:45,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:10:45,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:45" (2/3) ... [2022-07-14 15:10:45,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46ecbc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:10:45, skipping insertion in model container [2022-07-14 15:10:45,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:10:45,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:10:45" (3/3) ... [2022-07-14 15:10:45,463 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2022-07-14 15:10:45,512 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:10:45,512 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:10:45,512 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:10:45,512 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:10:45,512 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:10:45,512 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:10:45,512 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:10:45,512 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:10:45,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:45,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-14 15:10:45,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:45,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:45,532 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:45,533 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] [2022-07-14 15:10:45,533 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:10:45,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:45,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-14 15:10:45,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:45,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:45,536 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:45,537 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] [2022-07-14 15:10:45,541 INFO L752 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 27#L169-1true [2022-07-14 15:10:45,542 INFO L754 eck$LassoCheckResult]: Loop: 27#L169-1true assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14#L46true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 40#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 41#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L77-1true assume !(0 != main_~p3~0#1); 5#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 18#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 21#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 29#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 35#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 25#L109-1true assume !(0 != main_~p11~0#1); 20#L113-1true assume !(0 != main_~p1~0#1); 36#L119-1true assume !(0 != main_~p2~0#1); 8#L124-1true assume !(0 != main_~p3~0#1); 11#L129-1true assume !(0 != main_~p4~0#1); 19#L134-1true assume !(0 != main_~p5~0#1); 10#L139-1true assume !(0 != main_~p6~0#1); 3#L144-1true assume !(0 != main_~p7~0#1); 34#L149-1true assume !(0 != main_~p8~0#1); 17#L154-1true assume !(0 != main_~p9~0#1); 7#L159-1true assume !(0 != main_~p10~0#1); 38#L164-1true assume !(0 != main_~p11~0#1); 27#L169-1true [2022-07-14 15:10:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:10:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:45,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792555920] [2022-07-14 15:10:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:45,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:45,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:45,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:45,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2022-07-14 15:10:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:45,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480340375] [2022-07-14 15:10:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:45,808 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-14 15:10:45,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:45,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480340375] [2022-07-14 15:10:45,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480340375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:45,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:45,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:45,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124126929] [2022-07-14 15:10:45,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:45,814 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:45,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:45,844 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:45,890 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2022-07-14 15:10:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:45,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2022-07-14 15:10:45,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-07-14 15:10:45,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2022-07-14 15:10:45,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-07-14 15:10:45,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-07-14 15:10:45,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2022-07-14 15:10:45,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:45,914 INFO L369 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-07-14 15:10:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2022-07-14 15:10:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-14 15:10:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2022-07-14 15:10:45,941 INFO L392 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-07-14 15:10:45,941 INFO L374 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-07-14 15:10:45,941 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:10:45,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2022-07-14 15:10:45,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-07-14 15:10:45,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:45,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:45,945 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:45,945 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] [2022-07-14 15:10:45,945 INFO L752 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 146#L169-1 [2022-07-14 15:10:45,946 INFO L754 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 179#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 178#L73 assume !(0 != main_~p1~0#1); 174#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 168#L77-1 assume !(0 != main_~p3~0#1); 135#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 136#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 159#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 149#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 150#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 169#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 170#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 177#L109-1 assume !(0 != main_~p11~0#1); 175#L113-1 assume !(0 != main_~p1~0#1); 176#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 194#L129-1 assume !(0 != main_~p4~0#1); 192#L134-1 assume !(0 != main_~p5~0#1); 190#L139-1 assume !(0 != main_~p6~0#1); 188#L144-1 assume !(0 != main_~p7~0#1); 186#L149-1 assume !(0 != main_~p8~0#1); 157#L154-1 assume !(0 != main_~p9~0#1); 139#L159-1 assume !(0 != main_~p10~0#1); 141#L164-1 assume !(0 != main_~p11~0#1); 146#L169-1 [2022-07-14 15:10:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 15:10:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:45,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667791682] [2022-07-14 15:10:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:45,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:45,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2022-07-14 15:10:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:45,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435528286] [2022-07-14 15:10:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:46,019 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-14 15:10:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:46,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435528286] [2022-07-14 15:10:46,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435528286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:46,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:46,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:46,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115602869] [2022-07-14 15:10:46,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:46,024 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:46,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:46,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:46,026 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:46,046 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-07-14 15:10:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:46,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2022-07-14 15:10:46,051 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-07-14 15:10:46,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2022-07-14 15:10:46,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-07-14 15:10:46,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2022-07-14 15:10:46,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2022-07-14 15:10:46,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:46,058 INFO L369 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-07-14 15:10:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2022-07-14 15:10:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-14 15:10:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2022-07-14 15:10:46,065 INFO L392 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-07-14 15:10:46,065 INFO L374 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-07-14 15:10:46,065 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:10:46,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2022-07-14 15:10:46,067 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-07-14 15:10:46,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:46,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:46,068 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:46,068 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] [2022-07-14 15:10:46,068 INFO L752 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 361#L169-1 [2022-07-14 15:10:46,069 INFO L754 eck$LassoCheckResult]: Loop: 361#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 369#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 370#L73 assume !(0 != main_~p1~0#1); 425#L73-2 assume !(0 != main_~p2~0#1); 424#L77-1 assume !(0 != main_~p3~0#1); 421#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 418#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 415#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 412#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 409#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 406#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 404#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 395#L109-1 assume !(0 != main_~p11~0#1); 396#L113-1 assume !(0 != main_~p1~0#1); 400#L119-1 assume !(0 != main_~p2~0#1); 357#L124-1 assume !(0 != main_~p3~0#1); 358#L129-1 assume !(0 != main_~p4~0#1); 353#L134-1 assume !(0 != main_~p5~0#1); 362#L139-1 assume !(0 != main_~p6~0#1); 363#L144-1 assume !(0 != main_~p7~0#1); 456#L149-1 assume !(0 != main_~p8~0#1); 454#L154-1 assume !(0 != main_~p9~0#1); 452#L159-1 assume !(0 != main_~p10~0#1); 388#L164-1 assume !(0 != main_~p11~0#1); 361#L169-1 [2022-07-14 15:10:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 15:10:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933907921] [2022-07-14 15:10:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2022-07-14 15:10:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688243501] [2022-07-14 15:10:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:46,107 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-14 15:10:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:46,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688243501] [2022-07-14 15:10:46,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688243501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:46,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:46,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306868655] [2022-07-14 15:10:46,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:46,109 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:46,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:46,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:46,111 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:46,129 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-07-14 15:10:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:46,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2022-07-14 15:10:46,133 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-07-14 15:10:46,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2022-07-14 15:10:46,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2022-07-14 15:10:46,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-07-14 15:10:46,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2022-07-14 15:10:46,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:46,140 INFO L369 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-07-14 15:10:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2022-07-14 15:10:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-07-14 15:10:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2022-07-14 15:10:46,152 INFO L392 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-07-14 15:10:46,152 INFO L374 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-07-14 15:10:46,152 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:10:46,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2022-07-14 15:10:46,153 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-07-14 15:10:46,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:46,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:46,154 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:46,154 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] [2022-07-14 15:10:46,154 INFO L752 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 774#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 775#L169-1 [2022-07-14 15:10:46,155 INFO L754 eck$LassoCheckResult]: Loop: 775#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 917#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 916#L73 assume !(0 != main_~p1~0#1); 914#L73-2 assume !(0 != main_~p2~0#1); 910#L77-1 assume !(0 != main_~p3~0#1); 906#L81-1 assume !(0 != main_~p4~0#1); 902#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 898#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 894#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 890#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 886#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 882#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 878#L109-1 assume !(0 != main_~p11~0#1); 872#L113-1 assume !(0 != main_~p1~0#1); 873#L119-1 assume !(0 != main_~p2~0#1); 940#L124-1 assume !(0 != main_~p3~0#1); 937#L129-1 assume !(0 != main_~p4~0#1); 936#L134-1 assume !(0 != main_~p5~0#1); 933#L139-1 assume !(0 != main_~p6~0#1); 848#L144-1 assume !(0 != main_~p7~0#1); 843#L149-1 assume !(0 != main_~p8~0#1); 842#L154-1 assume !(0 != main_~p9~0#1); 831#L159-1 assume !(0 != main_~p10~0#1); 830#L164-1 assume !(0 != main_~p11~0#1); 775#L169-1 [2022-07-14 15:10:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-14 15:10:46,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437521938] [2022-07-14 15:10:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2022-07-14 15:10:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228553212] [2022-07-14 15:10:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:46,180 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-14 15:10:46,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:46,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228553212] [2022-07-14 15:10:46,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228553212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:46,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:46,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674418850] [2022-07-14 15:10:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:46,181 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:46,182 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:46,201 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-07-14 15:10:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:46,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2022-07-14 15:10:46,205 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-07-14 15:10:46,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2022-07-14 15:10:46,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-07-14 15:10:46,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2022-07-14 15:10:46,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2022-07-14 15:10:46,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:46,211 INFO L369 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-07-14 15:10:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2022-07-14 15:10:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-07-14 15:10:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2022-07-14 15:10:46,232 INFO L392 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-07-14 15:10:46,232 INFO L374 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-07-14 15:10:46,233 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:10:46,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2022-07-14 15:10:46,234 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-07-14 15:10:46,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:46,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:46,235 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:46,235 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] [2022-07-14 15:10:46,236 INFO L752 eck$LassoCheckResult]: Stem: 1600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 1581#L169-1 [2022-07-14 15:10:46,236 INFO L754 eck$LassoCheckResult]: Loop: 1581#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1663#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 1661#L73 assume !(0 != main_~p1~0#1); 1657#L73-2 assume !(0 != main_~p2~0#1); 1655#L77-1 assume !(0 != main_~p3~0#1); 1651#L81-1 assume !(0 != main_~p4~0#1); 1647#L85-1 assume !(0 != main_~p5~0#1); 1645#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1643#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1641#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1639#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1637#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1635#L109-1 assume !(0 != main_~p11~0#1); 1632#L113-1 assume !(0 != main_~p1~0#1); 1633#L119-1 assume !(0 != main_~p2~0#1); 1699#L124-1 assume !(0 != main_~p3~0#1); 1694#L129-1 assume !(0 != main_~p4~0#1); 1690#L134-1 assume !(0 != main_~p5~0#1); 1687#L139-1 assume !(0 != main_~p6~0#1); 1683#L144-1 assume !(0 != main_~p7~0#1); 1679#L149-1 assume !(0 != main_~p8~0#1); 1675#L154-1 assume !(0 != main_~p9~0#1); 1671#L159-1 assume !(0 != main_~p10~0#1); 1667#L164-1 assume !(0 != main_~p11~0#1); 1581#L169-1 [2022-07-14 15:10:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-14 15:10:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846374896] [2022-07-14 15:10:46,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:46,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2022-07-14 15:10:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551642513] [2022-07-14 15:10:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:46,273 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-14 15:10:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:46,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551642513] [2022-07-14 15:10:46,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551642513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:46,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:46,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:46,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247893832] [2022-07-14 15:10:46,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:46,275 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:46,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:46,276 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:46,295 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-07-14 15:10:46,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:46,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2022-07-14 15:10:46,302 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-07-14 15:10:46,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-07-14 15:10:46,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2022-07-14 15:10:46,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2022-07-14 15:10:46,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2022-07-14 15:10:46,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:46,313 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-07-14 15:10:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2022-07-14 15:10:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-07-14 15:10:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-07-14 15:10:46,339 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-07-14 15:10:46,339 INFO L374 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-07-14 15:10:46,339 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:10:46,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2022-07-14 15:10:46,342 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-07-14 15:10:46,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:46,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:46,343 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:46,343 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] [2022-07-14 15:10:46,343 INFO L752 eck$LassoCheckResult]: Stem: 3176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 3159#L169-1 [2022-07-14 15:10:46,343 INFO L754 eck$LassoCheckResult]: Loop: 3159#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3298#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 3294#L73 assume !(0 != main_~p1~0#1); 3290#L73-2 assume !(0 != main_~p2~0#1); 3288#L77-1 assume !(0 != main_~p3~0#1); 3286#L81-1 assume !(0 != main_~p4~0#1); 3282#L85-1 assume !(0 != main_~p5~0#1); 3278#L89-1 assume !(0 != main_~p6~0#1); 3276#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3274#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3272#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3270#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3268#L109-1 assume !(0 != main_~p11~0#1); 3264#L113-1 assume !(0 != main_~p1~0#1); 3260#L119-1 assume !(0 != main_~p2~0#1); 3257#L124-1 assume !(0 != main_~p3~0#1); 3253#L129-1 assume !(0 != main_~p4~0#1); 3254#L134-1 assume !(0 != main_~p5~0#1); 3321#L139-1 assume !(0 != main_~p6~0#1); 3318#L144-1 assume !(0 != main_~p7~0#1); 3314#L149-1 assume !(0 != main_~p8~0#1); 3310#L154-1 assume !(0 != main_~p9~0#1); 3306#L159-1 assume !(0 != main_~p10~0#1); 3302#L164-1 assume !(0 != main_~p11~0#1); 3159#L169-1 [2022-07-14 15:10:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-14 15:10:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851922844] [2022-07-14 15:10:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2022-07-14 15:10:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680881169] [2022-07-14 15:10:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:46,380 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-14 15:10:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680881169] [2022-07-14 15:10:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680881169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:46,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:46,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483547437] [2022-07-14 15:10:46,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:46,381 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:46,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:46,382 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:46,419 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-07-14 15:10:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:46,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2022-07-14 15:10:46,449 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-07-14 15:10:46,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-07-14 15:10:46,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2022-07-14 15:10:46,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2022-07-14 15:10:46,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2022-07-14 15:10:46,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:46,461 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-07-14 15:10:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2022-07-14 15:10:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-07-14 15:10:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-07-14 15:10:46,488 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-07-14 15:10:46,490 INFO L374 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-07-14 15:10:46,490 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:10:46,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2022-07-14 15:10:46,499 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-07-14 15:10:46,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:46,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:46,501 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:46,501 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] [2022-07-14 15:10:46,501 INFO L752 eck$LassoCheckResult]: Stem: 6275#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6256#L169-1 [2022-07-14 15:10:46,501 INFO L754 eck$LassoCheckResult]: Loop: 6256#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6363#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 6361#L73 assume !(0 != main_~p1~0#1); 6357#L73-2 assume !(0 != main_~p2~0#1); 6355#L77-1 assume !(0 != main_~p3~0#1); 6351#L81-1 assume !(0 != main_~p4~0#1); 6347#L85-1 assume !(0 != main_~p5~0#1); 6343#L89-1 assume !(0 != main_~p6~0#1); 6339#L93-1 assume !(0 != main_~p7~0#1); 6337#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6335#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6333#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6331#L109-1 assume !(0 != main_~p11~0#1); 6328#L113-1 assume !(0 != main_~p1~0#1); 6329#L119-1 assume !(0 != main_~p2~0#1); 6399#L124-1 assume !(0 != main_~p3~0#1); 6394#L129-1 assume !(0 != main_~p4~0#1); 6390#L134-1 assume !(0 != main_~p5~0#1); 6386#L139-1 assume !(0 != main_~p6~0#1); 6382#L144-1 assume !(0 != main_~p7~0#1); 6379#L149-1 assume !(0 != main_~p8~0#1); 6375#L154-1 assume !(0 != main_~p9~0#1); 6371#L159-1 assume !(0 != main_~p10~0#1); 6367#L164-1 assume !(0 != main_~p11~0#1); 6256#L169-1 [2022-07-14 15:10:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-14 15:10:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246560509] [2022-07-14 15:10:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,511 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2022-07-14 15:10:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792689756] [2022-07-14 15:10:46,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:46,553 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-14 15:10:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792689756] [2022-07-14 15:10:46,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792689756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:46,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:46,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494141564] [2022-07-14 15:10:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:46,554 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:46,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:46,555 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:46,576 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-07-14 15:10:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:46,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2022-07-14 15:10:46,599 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-07-14 15:10:46,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-07-14 15:10:46,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2022-07-14 15:10:46,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2022-07-14 15:10:46,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2022-07-14 15:10:46,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:46,623 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-07-14 15:10:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2022-07-14 15:10:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2022-07-14 15:10:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-07-14 15:10:46,712 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-07-14 15:10:46,712 INFO L374 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-07-14 15:10:46,712 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:10:46,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2022-07-14 15:10:46,731 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-07-14 15:10:46,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:46,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:46,731 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:46,731 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] [2022-07-14 15:10:46,732 INFO L752 eck$LassoCheckResult]: Stem: 12367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 12345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 12346#L169-1 [2022-07-14 15:10:46,732 INFO L754 eck$LassoCheckResult]: Loop: 12346#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12506#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 12500#L73 assume !(0 != main_~p1~0#1); 12494#L73-2 assume !(0 != main_~p2~0#1); 12495#L77-1 assume !(0 != main_~p3~0#1); 12689#L81-1 assume !(0 != main_~p4~0#1); 12687#L85-1 assume !(0 != main_~p5~0#1); 12685#L89-1 assume !(0 != main_~p6~0#1); 12450#L93-1 assume !(0 != main_~p7~0#1); 12452#L97-1 assume !(0 != main_~p8~0#1); 12638#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12634#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12630#L109-1 assume !(0 != main_~p11~0#1); 12626#L113-1 assume !(0 != main_~p1~0#1); 12627#L119-1 assume !(0 != main_~p2~0#1); 12684#L124-1 assume !(0 != main_~p3~0#1); 12681#L129-1 assume !(0 != main_~p4~0#1); 12679#L134-1 assume !(0 != main_~p5~0#1); 12677#L139-1 assume !(0 != main_~p6~0#1); 12675#L144-1 assume !(0 != main_~p7~0#1); 12672#L149-1 assume !(0 != main_~p8~0#1); 12670#L154-1 assume !(0 != main_~p9~0#1); 12532#L159-1 assume !(0 != main_~p10~0#1); 12518#L164-1 assume !(0 != main_~p11~0#1); 12346#L169-1 [2022-07-14 15:10:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,732 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-14 15:10:46,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563791753] [2022-07-14 15:10:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:46,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2022-07-14 15:10:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:46,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272005265] [2022-07-14 15:10:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:46,774 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-14 15:10:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:46,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272005265] [2022-07-14 15:10:46,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272005265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:46,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:46,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243482262] [2022-07-14 15:10:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:46,777 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:46,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:46,778 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:46,807 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-07-14 15:10:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:46,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2022-07-14 15:10:46,849 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-07-14 15:10:46,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-07-14 15:10:46,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2022-07-14 15:10:46,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2022-07-14 15:10:46,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2022-07-14 15:10:46,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:46,892 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-07-14 15:10:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2022-07-14 15:10:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2022-07-14 15:10:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-07-14 15:10:47,039 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-07-14 15:10:47,039 INFO L374 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-07-14 15:10:47,040 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:10:47,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2022-07-14 15:10:47,064 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-07-14 15:10:47,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:47,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:47,068 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:47,068 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] [2022-07-14 15:10:47,068 INFO L752 eck$LassoCheckResult]: Stem: 24342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 24323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 24324#L169-1 [2022-07-14 15:10:47,068 INFO L754 eck$LassoCheckResult]: Loop: 24324#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24735#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 24728#L73 assume !(0 != main_~p1~0#1); 24720#L73-2 assume !(0 != main_~p2~0#1); 24716#L77-1 assume !(0 != main_~p3~0#1); 24714#L81-1 assume !(0 != main_~p4~0#1); 24712#L85-1 assume !(0 != main_~p5~0#1); 24710#L89-1 assume !(0 != main_~p6~0#1); 24709#L93-1 assume !(0 != main_~p7~0#1); 24707#L97-1 assume !(0 != main_~p8~0#1); 24706#L101-1 assume !(0 != main_~p9~0#1); 24702#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24699#L109-1 assume !(0 != main_~p11~0#1); 24695#L113-1 assume !(0 != main_~p1~0#1); 24681#L119-1 assume !(0 != main_~p2~0#1); 24678#L124-1 assume !(0 != main_~p3~0#1); 24669#L129-1 assume !(0 != main_~p4~0#1); 24659#L134-1 assume !(0 != main_~p5~0#1); 24649#L139-1 assume !(0 != main_~p6~0#1); 24639#L144-1 assume !(0 != main_~p7~0#1); 24630#L149-1 assume !(0 != main_~p8~0#1); 24631#L154-1 assume !(0 != main_~p9~0#1); 24832#L159-1 assume !(0 != main_~p10~0#1); 24746#L164-1 assume !(0 != main_~p11~0#1); 24324#L169-1 [2022-07-14 15:10:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-14 15:10:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:47,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651417002] [2022-07-14 15:10:47,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2022-07-14 15:10:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:47,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936689076] [2022-07-14 15:10:47,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:10:47,101 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-14 15:10:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:10:47,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936689076] [2022-07-14 15:10:47,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936689076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:10:47,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:10:47,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:10:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139224178] [2022-07-14 15:10:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:10:47,103 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:10:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:10:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:10:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:10:47,120 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:10:47,198 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-07-14 15:10:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:10:47,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2022-07-14 15:10:47,306 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-07-14 15:10:47,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-07-14 15:10:47,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2022-07-14 15:10:47,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2022-07-14 15:10:47,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2022-07-14 15:10:47,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:10:47,452 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-07-14 15:10:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2022-07-14 15:10:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2022-07-14 15:10:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:10:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-07-14 15:10:47,712 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-07-14 15:10:47,713 INFO L374 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-07-14 15:10:47,713 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 15:10:47,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2022-07-14 15:10:47,757 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-07-14 15:10:47,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:10:47,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:10:47,759 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:10:47,759 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] [2022-07-14 15:10:47,760 INFO L752 eck$LassoCheckResult]: Stem: 47906#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 47884#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 47885#L169-1 [2022-07-14 15:10:47,760 INFO L754 eck$LassoCheckResult]: Loop: 47885#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48601#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 48598#L73 assume !(0 != main_~p1~0#1); 48594#L73-2 assume !(0 != main_~p2~0#1); 48591#L77-1 assume !(0 != main_~p3~0#1); 48588#L81-1 assume !(0 != main_~p4~0#1); 48584#L85-1 assume !(0 != main_~p5~0#1); 48580#L89-1 assume !(0 != main_~p6~0#1); 48576#L93-1 assume !(0 != main_~p7~0#1); 48572#L97-1 assume !(0 != main_~p8~0#1); 48568#L101-1 assume !(0 != main_~p9~0#1); 48569#L105-1 assume !(0 != main_~p10~0#1); 48527#L109-1 assume !(0 != main_~p11~0#1); 48528#L113-1 assume !(0 != main_~p1~0#1); 48643#L119-1 assume !(0 != main_~p2~0#1); 48637#L124-1 assume !(0 != main_~p3~0#1); 48631#L129-1 assume !(0 != main_~p4~0#1); 48626#L134-1 assume !(0 != main_~p5~0#1); 48622#L139-1 assume !(0 != main_~p6~0#1); 48617#L144-1 assume !(0 != main_~p7~0#1); 48612#L149-1 assume !(0 != main_~p8~0#1); 48609#L154-1 assume !(0 != main_~p9~0#1); 48607#L159-1 assume !(0 != main_~p10~0#1); 48606#L164-1 assume !(0 != main_~p11~0#1); 47885#L169-1 [2022-07-14 15:10:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-07-14 15:10:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:47,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822777515] [2022-07-14 15:10:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2022-07-14 15:10:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:47,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576693405] [2022-07-14 15:10:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:10:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2022-07-14 15:10:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:10:47,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026071646] [2022-07-14 15:10:47,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:10:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:10:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:10:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:10:47,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:10:48,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:10:48 BoogieIcfgContainer [2022-07-14 15:10:48,060 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:10:48,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:10:48,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:10:48,061 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:10:48,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:10:45" (3/4) ... [2022-07-14 15:10:48,063 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 15:10:48,125 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 15:10:48,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:10:48,126 INFO L158 Benchmark]: Toolchain (without parser) took 3259.27ms. Allocated memory was 102.8MB in the beginning and 302.0MB in the end (delta: 199.2MB). Free memory was 62.4MB in the beginning and 185.9MB in the end (delta: -123.5MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2022-07-14 15:10:48,126 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 69.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:10:48,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.84ms. Allocated memory is still 102.8MB. Free memory was 62.1MB in the beginning and 51.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 15:10:48,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 51.6MB in the beginning and 107.6MB in the end (delta: -56.0MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-14 15:10:48,127 INFO L158 Benchmark]: Boogie Preprocessor took 38.56ms. Allocated memory is still 130.0MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:10:48,127 INFO L158 Benchmark]: RCFGBuilder took 316.05ms. Allocated memory is still 130.0MB. Free memory was 106.2MB in the beginning and 96.9MB in the end (delta: 9.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-07-14 15:10:48,127 INFO L158 Benchmark]: BuchiAutomizer took 2620.29ms. Allocated memory was 130.0MB in the beginning and 302.0MB in the end (delta: 172.0MB). Free memory was 96.9MB in the beginning and 136.9MB in the end (delta: -40.0MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2022-07-14 15:10:48,127 INFO L158 Benchmark]: Witness Printer took 64.82ms. Allocated memory is still 302.0MB. Free memory was 136.9MB in the beginning and 185.9MB in the end (delta: -49.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2022-07-14 15:10:48,128 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.15ms. Allocated memory is still 102.8MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 69.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.84ms. Allocated memory is still 102.8MB. Free memory was 62.1MB in the beginning and 51.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 51.6MB in the beginning and 107.6MB in the end (delta: -56.0MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.56ms. Allocated memory is still 130.0MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.05ms. Allocated memory is still 130.0MB. Free memory was 106.2MB in the beginning and 96.9MB in the end (delta: 9.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 2620.29ms. Allocated memory was 130.0MB in the beginning and 302.0MB in the end (delta: 172.0MB). Free memory was 96.9MB in the beginning and 136.9MB in the end (delta: -40.0MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. * Witness Printer took 64.82ms. Allocated memory is still 302.0MB. Free memory was 136.9MB in the beginning and 185.9MB in the end (delta: -49.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 796 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 44]: 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, cond=4, p5=0, p10=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e6800be=0, lk11=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e264b2b=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c3b5d43=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@82f95bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f5867dc=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@752c598b=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a176a57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24a4f85b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52db7f4b=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ee1944b=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d0ceaa3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f4d6085=4} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 15:10:48,162 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)