./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 35987657 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-?-3598765 [2022-07-22 01:48:39,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:48:39,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:48:39,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:48:39,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:48:39,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:48:39,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:48:39,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:48:39,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:48:39,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:48:39,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:48:39,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:48:39,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:48:39,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:48:39,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:48:39,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:48:39,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:48:39,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:48:39,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:48:39,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:48:39,087 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:48:39,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:48:39,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:48:39,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:48:39,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:48:39,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:48:39,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:48:39,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:48:39,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:48:39,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:48:39,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:48:39,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:48:39,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:48:39,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:48:39,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:48:39,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:48:39,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:48:39,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:48:39,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:48:39,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:48:39,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:48:39,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:48:39,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 01:48:39,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:48:39,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:48:39,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:48:39,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:48:39,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:48:39,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:48:39,151 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:48:39,151 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:48:39,151 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:48:39,152 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:48:39,152 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:48:39,152 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:48:39,152 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:48:39,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:48:39,153 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 01:48:39,153 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:48:39,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:48:39,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 01:48:39,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:48:39,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:48:39,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:48:39,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:48:39,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 01:48:39,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:48:39,155 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:48:39,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:48:39,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:48:39,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:48:39,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:48:39,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:48:39,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:48:39,158 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:48:39,158 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-22 01:48:39,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:48:39,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:48:39,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:48:39,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:48:39,487 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:48:39,489 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-22 01:48:39,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257e03411/4b0c3f32eb754084accbbf86e401678d/FLAG122cbbd59 [2022-07-22 01:48:39,900 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:48:39,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2022-07-22 01:48:39,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257e03411/4b0c3f32eb754084accbbf86e401678d/FLAG122cbbd59 [2022-07-22 01:48:40,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257e03411/4b0c3f32eb754084accbbf86e401678d [2022-07-22 01:48:40,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:48:40,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:48:40,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:48:40,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:48:40,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:48:40,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed6148c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40, skipping insertion in model container [2022-07-22 01:48:40,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:48:40,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:48:40,470 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-22 01:48:40,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:48:40,478 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:48:40,536 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-22 01:48:40,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:48:40,547 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:48:40,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40 WrapperNode [2022-07-22 01:48:40,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:48:40,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:48:40,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:48:40,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:48:40,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,575 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2022-07-22 01:48:40,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:48:40,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:48:40,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:48:40,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:48:40,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:48:40,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:48:40,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:48:40,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:48:40,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (1/1) ... [2022-07-22 01:48:40,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:48:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:48:40,620 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-22 01:48:40,648 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-22 01:48:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 01:48:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:48:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:48:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 01:48:40,735 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:48:40,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:48:40,919 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:48:40,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:48:40,925 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 01:48:40,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:40 BoogieIcfgContainer [2022-07-22 01:48:40,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:48:40,928 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:48:40,928 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:48:40,930 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:48:40,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:40,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:48:40" (1/3) ... [2022-07-22 01:48:40,932 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34b3c2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:48:40, skipping insertion in model container [2022-07-22 01:48:40,932 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:40,932 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:40" (2/3) ... [2022-07-22 01:48:40,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34b3c2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:48:40, skipping insertion in model container [2022-07-22 01:48:40,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:40,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:40" (3/3) ... [2022-07-22 01:48:40,934 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2022-07-22 01:48:41,009 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:48:41,009 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:48:41,009 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:48:41,009 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:48:41,009 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:48:41,009 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:48:41,009 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:48:41,010 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:48:41,029 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-22 01:48:41,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-22 01:48:41,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:41,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:41,055 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:41,061 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-22 01:48:41,061 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:48:41,062 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-22 01:48:41,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-22 01:48:41,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:41,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:41,067 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:41,067 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-22 01:48:41,084 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-22 01:48:41,100 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-22 01:48:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 01:48:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436411013] [2022-07-22 01:48:41,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2022-07-22 01:48:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105417277] [2022-07-22 01:48:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:41,374 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-22 01:48:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:41,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105417277] [2022-07-22 01:48:41,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105417277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:41,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:41,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260354047] [2022-07-22 01:48:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:41,383 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:41,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:41,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:41,420 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-22 01:48:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:41,474 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2022-07-22 01:48:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:41,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2022-07-22 01:48:41,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-07-22 01:48:41,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2022-07-22 01:48:41,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-07-22 01:48:41,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-07-22 01:48:41,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2022-07-22 01:48:41,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:41,502 INFO L369 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-07-22 01:48:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2022-07-22 01:48:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-22 01:48:41,529 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-22 01:48:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2022-07-22 01:48:41,532 INFO L392 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-07-22 01:48:41,532 INFO L374 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-07-22 01:48:41,533 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:48:41,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2022-07-22 01:48:41,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-07-22 01:48:41,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:41,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:41,537 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:41,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-22 01:48:41,538 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-22 01:48:41,538 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-22 01:48:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-22 01:48:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693617201] [2022-07-22 01:48:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2022-07-22 01:48:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343488945] [2022-07-22 01:48:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:41,589 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-22 01:48:41,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:41,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343488945] [2022-07-22 01:48:41,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343488945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:41,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:41,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900177781] [2022-07-22 01:48:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:41,592 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:41,594 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-22 01:48:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:41,619 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-07-22 01:48:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:41,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2022-07-22 01:48:41,622 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-07-22 01:48:41,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2022-07-22 01:48:41,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-07-22 01:48:41,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2022-07-22 01:48:41,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2022-07-22 01:48:41,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:41,630 INFO L369 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-07-22 01:48:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2022-07-22 01:48:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-22 01:48:41,640 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-22 01:48:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2022-07-22 01:48:41,643 INFO L392 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-07-22 01:48:41,643 INFO L374 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-07-22 01:48:41,643 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:48:41,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2022-07-22 01:48:41,648 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-07-22 01:48:41,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:41,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:41,649 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:41,649 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-22 01:48:41,649 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-22 01:48:41,649 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-22 01:48:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-22 01:48:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959016562] [2022-07-22 01:48:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2022-07-22 01:48:41,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074699347] [2022-07-22 01:48:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:41,731 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-22 01:48:41,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:41,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074699347] [2022-07-22 01:48:41,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074699347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:41,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:41,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:41,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105156042] [2022-07-22 01:48:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:41,733 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:41,735 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-22 01:48:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:41,760 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-07-22 01:48:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:41,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2022-07-22 01:48:41,765 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-07-22 01:48:41,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2022-07-22 01:48:41,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2022-07-22 01:48:41,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-07-22 01:48:41,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2022-07-22 01:48:41,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:41,775 INFO L369 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-07-22 01:48:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2022-07-22 01:48:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-07-22 01:48:41,788 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-22 01:48:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2022-07-22 01:48:41,789 INFO L392 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-07-22 01:48:41,789 INFO L374 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-07-22 01:48:41,789 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:48:41,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2022-07-22 01:48:41,791 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-07-22 01:48:41,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:41,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:41,792 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:41,793 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-22 01:48:41,793 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-22 01:48:41,794 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-22 01:48:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-22 01:48:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003956185] [2022-07-22 01:48:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2022-07-22 01:48:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912786967] [2022-07-22 01:48:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:41,850 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-22 01:48:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:41,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912786967] [2022-07-22 01:48:41,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912786967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:41,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:41,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82695315] [2022-07-22 01:48:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:41,852 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:41,853 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-22 01:48:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:41,877 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-07-22 01:48:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:41,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2022-07-22 01:48:41,882 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-07-22 01:48:41,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2022-07-22 01:48:41,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-07-22 01:48:41,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2022-07-22 01:48:41,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2022-07-22 01:48:41,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:41,892 INFO L369 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-07-22 01:48:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2022-07-22 01:48:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-07-22 01:48:41,923 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-22 01:48:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2022-07-22 01:48:41,925 INFO L392 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-07-22 01:48:41,925 INFO L374 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-07-22 01:48:41,925 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:48:41,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2022-07-22 01:48:41,932 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-07-22 01:48:41,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:41,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:41,933 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:41,933 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-22 01:48:41,934 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-22 01:48:41,934 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-22 01:48:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-22 01:48:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658903091] [2022-07-22 01:48:41,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:41,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2022-07-22 01:48:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:41,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205701794] [2022-07-22 01:48:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:42,001 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-22 01:48:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205701794] [2022-07-22 01:48:42,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205701794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:42,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:42,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104879653] [2022-07-22 01:48:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:42,004 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:42,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:42,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:42,005 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-22 01:48:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:42,025 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-07-22 01:48:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:42,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2022-07-22 01:48:42,036 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-07-22 01:48:42,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-07-22 01:48:42,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2022-07-22 01:48:42,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2022-07-22 01:48:42,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2022-07-22 01:48:42,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:42,045 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-07-22 01:48:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2022-07-22 01:48:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-07-22 01:48:42,064 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-22 01:48:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-07-22 01:48:42,067 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-07-22 01:48:42,067 INFO L374 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-07-22 01:48:42,067 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:48:42,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2022-07-22 01:48:42,072 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-07-22 01:48:42,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:42,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:42,073 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:42,073 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-22 01:48:42,073 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-22 01:48:42,074 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-22 01:48:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-22 01:48:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:42,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557836486] [2022-07-22 01:48:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:42,081 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:42,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2022-07-22 01:48:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:42,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802213234] [2022-07-22 01:48:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:42,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:42,130 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-22 01:48:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:42,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802213234] [2022-07-22 01:48:42,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802213234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:42,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:42,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:42,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803936089] [2022-07-22 01:48:42,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:42,132 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:42,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:42,133 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-22 01:48:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:42,157 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-07-22 01:48:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:42,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2022-07-22 01:48:42,182 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-07-22 01:48:42,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-07-22 01:48:42,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2022-07-22 01:48:42,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2022-07-22 01:48:42,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2022-07-22 01:48:42,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:42,197 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-07-22 01:48:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2022-07-22 01:48:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-07-22 01:48:42,235 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-22 01:48:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-07-22 01:48:42,241 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-07-22 01:48:42,242 INFO L374 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-07-22 01:48:42,242 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:48:42,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2022-07-22 01:48:42,254 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-07-22 01:48:42,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:42,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:42,256 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:42,256 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-22 01:48:42,256 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-22 01:48:42,256 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-22 01:48:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-22 01:48:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:42,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269636620] [2022-07-22 01:48:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:42,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:42,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2022-07-22 01:48:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:42,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145664302] [2022-07-22 01:48:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:42,297 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-22 01:48:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:42,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145664302] [2022-07-22 01:48:42,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145664302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:42,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:42,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444943475] [2022-07-22 01:48:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:42,299 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:42,299 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-22 01:48:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:42,331 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-07-22 01:48:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:42,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2022-07-22 01:48:42,382 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-07-22 01:48:42,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-07-22 01:48:42,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2022-07-22 01:48:42,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2022-07-22 01:48:42,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2022-07-22 01:48:42,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:42,410 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-07-22 01:48:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2022-07-22 01:48:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2022-07-22 01:48:42,477 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-22 01:48:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-07-22 01:48:42,489 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-07-22 01:48:42,489 INFO L374 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-07-22 01:48:42,489 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:48:42,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2022-07-22 01:48:42,507 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-07-22 01:48:42,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:42,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:42,508 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:42,508 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-22 01:48:42,508 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-22 01:48:42,508 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-22 01:48:42,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-22 01:48:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:42,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943382235] [2022-07-22 01:48:42,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:42,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:42,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2022-07-22 01:48:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615284262] [2022-07-22 01:48:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:42,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-22 01:48:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:42,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615284262] [2022-07-22 01:48:42,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615284262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:42,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:42,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:42,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132574935] [2022-07-22 01:48:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:42,555 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:42,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:42,556 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-22 01:48:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:42,597 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-07-22 01:48:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:42,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2022-07-22 01:48:42,671 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-07-22 01:48:42,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-07-22 01:48:42,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2022-07-22 01:48:42,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2022-07-22 01:48:42,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2022-07-22 01:48:42,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:42,743 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-07-22 01:48:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2022-07-22 01:48:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2022-07-22 01:48:42,872 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-22 01:48:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-07-22 01:48:42,950 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-07-22 01:48:42,950 INFO L374 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-07-22 01:48:42,950 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 01:48:42,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2022-07-22 01:48:42,983 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-07-22 01:48:42,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:42,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:42,984 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:42,985 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-22 01:48:42,985 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-22 01:48:42,985 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-22 01:48:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-22 01:48:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:42,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197555076] [2022-07-22 01:48:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:42,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:43,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2022-07-22 01:48:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:43,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797711394] [2022-07-22 01:48:43,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:43,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:43,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797711394] [2022-07-22 01:48:43,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797711394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:43,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:43,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891381252] [2022-07-22 01:48:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:43,032 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:43,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:43,033 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-22 01:48:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:43,118 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-07-22 01:48:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:43,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2022-07-22 01:48:43,234 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-07-22 01:48:43,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-07-22 01:48:43,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2022-07-22 01:48:43,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2022-07-22 01:48:43,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2022-07-22 01:48:43,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:43,343 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-07-22 01:48:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2022-07-22 01:48:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2022-07-22 01:48:43,693 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-22 01:48:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-07-22 01:48:43,738 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-07-22 01:48:43,738 INFO L374 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-07-22 01:48:43,738 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 01:48:43,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2022-07-22 01:48:43,797 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-07-22 01:48:43,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:43,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:43,799 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:43,799 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-22 01:48:43,799 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-22 01:48:43,800 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-22 01:48:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-07-22 01:48:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:43,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313483950] [2022-07-22 01:48:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:43,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:43,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2022-07-22 01:48:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:43,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266362828] [2022-07-22 01:48:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:43,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:43,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2022-07-22 01:48:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:43,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698743969] [2022-07-22 01:48:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:43,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:43,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:43,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:44,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:48:44 BoogieIcfgContainer [2022-07-22 01:48:44,114 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:48:44,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:48:44,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:48:44,115 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:48:44,115 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:40" (3/4) ... [2022-07-22 01:48:44,160 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 01:48:44,200 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 01:48:44,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:48:44,201 INFO L158 Benchmark]: Toolchain (without parser) took 3879.12ms. Allocated memory was 48.2MB in the beginning and 746.6MB in the end (delta: 698.4MB). Free memory was 23.4MB in the beginning and 634.0MB in the end (delta: -610.6MB). Peak memory consumption was 152.7MB. Max. memory is 16.1GB. [2022-07-22 01:48:44,202 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.1MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:48:44,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.18ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 23.2MB in the beginning and 43.7MB in the end (delta: -20.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-22 01:48:44,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.22ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:48:44,203 INFO L158 Benchmark]: Boogie Preprocessor took 17.74ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:48:44,204 INFO L158 Benchmark]: RCFGBuilder took 332.68ms. Allocated memory is still 60.8MB. Free memory was 40.7MB in the beginning and 41.9MB in the end (delta: -1.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-07-22 01:48:44,204 INFO L158 Benchmark]: BuchiAutomizer took 3186.23ms. Allocated memory was 60.8MB in the beginning and 276.8MB in the end (delta: 216.0MB). Free memory was 41.7MB in the beginning and 116.8MB in the end (delta: -75.1MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. [2022-07-22 01:48:44,204 INFO L158 Benchmark]: Witness Printer took 86.24ms. Allocated memory was 276.8MB in the beginning and 746.6MB in the end (delta: 469.8MB). Free memory was 116.8MB in the beginning and 634.0MB in the end (delta: -517.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-22 01:48:44,207 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.17ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.1MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.18ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 23.2MB in the beginning and 43.7MB in the end (delta: -20.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.22ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.74ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 332.68ms. Allocated memory is still 60.8MB. Free memory was 40.7MB in the beginning and 41.9MB in the end (delta: -1.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 3186.23ms. Allocated memory was 60.8MB in the beginning and 276.8MB in the end (delta: 216.0MB). Free memory was 41.7MB in the beginning and 116.8MB in the end (delta: -75.1MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. * Witness Printer took 86.24ms. Allocated memory was 276.8MB in the beginning and 746.6MB in the end (delta: 469.8MB). Free memory was 116.8MB in the beginning and 634.0MB in the end (delta: -517.2MB). Peak memory consumption was 18.6MB. 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 3.1s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.8s 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@5b28cedc=0, lk11=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75f1c900=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c8eaae1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3298b3cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ef43bdd=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4319ef20=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@482e8a97=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@556de360=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@206ab570=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fdf5873=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20590d88=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6580d530=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-22 01:48:44,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)