./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/systemc/pc_sfifo_1.cil-2.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 a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 16:30:18,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:30:18,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:30:18,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:30:18,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:30:18,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:30:18,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:30:18,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:30:18,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:30:18,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:30:18,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:30:18,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:30:18,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:30:18,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:30:18,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:30:18,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:30:18,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:30:18,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:30:18,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:30:18,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:30:18,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:30:18,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:30:18,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:30:18,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:30:18,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:30:18,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:30:18,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:30:18,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:30:18,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:30:18,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:30:18,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:30:18,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:30:18,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:30:18,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:30:18,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:30:18,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:30:18,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:30:18,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:30:18,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:30:18,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:30:18,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:30:18,188 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:30:18,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:30:18,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:30:18,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:30:18,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:30:18,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:30:18,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:30:18,206 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:30:18,206 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:30:18,206 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:30:18,206 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:30:18,207 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:30:18,207 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:30:18,207 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:30:18,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:30:18,207 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:30:18,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:30:18,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:30:18,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:30:18,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:30:18,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:30:18,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:30:18,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:30:18,209 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:30:18,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:30:18,209 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:30:18,209 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:30:18,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:30:18,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:30:18,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:30:18,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:30:18,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:30:18,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:30:18,211 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:30:18,211 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 -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2021-08-27 16:30:18,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:30:18,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:30:18,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:30:18,483 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:30:18,484 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:30:18,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-08-27 16:30:18,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8694295b1/623e0f73ff564adb9bfcaf78910239ab/FLAG56afe8d38 [2021-08-27 16:30:18,881 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:30:18,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-08-27 16:30:18,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8694295b1/623e0f73ff564adb9bfcaf78910239ab/FLAG56afe8d38 [2021-08-27 16:30:18,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8694295b1/623e0f73ff564adb9bfcaf78910239ab [2021-08-27 16:30:18,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:30:18,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:30:18,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:30:18,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:30:18,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:30:18,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:30:18" (1/1) ... [2021-08-27 16:30:18,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686a1386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:18, skipping insertion in model container [2021-08-27 16:30:18,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:30:18" (1/1) ... [2021-08-27 16:30:18,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:30:18,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:30:19,018 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-08-27 16:30:19,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:30:19,044 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:30:19,073 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-08-27 16:30:19,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:30:19,114 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:30:19,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19 WrapperNode [2021-08-27 16:30:19,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:30:19,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:30:19,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:30:19,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:30:19,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:30:19,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:30:19,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:30:19,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:30:19,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:30:19,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:30:19,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:30:19,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:30:19,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (1/1) ... [2021-08-27 16:30:19,232 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:19,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:19,250 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) [2021-08-27 16:30:19,270 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 [2021-08-27 16:30:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:30:19,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:30:19,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:30:19,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:30:19,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:30:19,612 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2021-08-27 16:30:19,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:19 BoogieIcfgContainer [2021-08-27 16:30:19,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:30:19,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:30:19,614 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:30:19,616 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:30:19,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:19,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:30:18" (1/3) ... [2021-08-27 16:30:19,617 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ca9459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:30:19, skipping insertion in model container [2021-08-27 16:30:19,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:19,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:19" (2/3) ... [2021-08-27 16:30:19,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ca9459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:30:19, skipping insertion in model container [2021-08-27 16:30:19,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:19,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:19" (3/3) ... [2021-08-27 16:30:19,619 INFO L389 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-08-27 16:30:19,649 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:30:19,649 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:30:19,649 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:30:19,649 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:30:19,649 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:30:19,649 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:30:19,649 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:30:19,649 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:30:19,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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) [2021-08-27 16:30:19,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-08-27 16:30:19,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:19,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:19,681 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 16:30:19,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:19,681 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:30:19,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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) [2021-08-27 16:30:19,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-08-27 16:30:19,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:19,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:19,693 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 16:30:19,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:19,697 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 41#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 48#L348true havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 8#L198true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 14#L198-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 55#L315-1true [2021-08-27 16:30:19,699 INFO L793 eck$LassoCheckResult]: Loop: 55#L315-1true assume !false; 50#L316true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 70#L264true assume false; 30#L280true havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 68#L216-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 63#L228-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 69#L229-1true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 47#L294true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 26#L301true stop_simulation_#res := stop_simulation_~__retres2~0; 16#L302true start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 22#L322true assume !(0 != start_simulation_~tmp~3); 55#L315-1true [2021-08-27 16:30:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2021-08-27 16:30:19,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:19,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321997765] [2021-08-27 16:30:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:19,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:19,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:19,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321997765] [2021-08-27 16:30:19,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321997765] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:19,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:19,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:19,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818695679] [2021-08-27 16:30:19,886 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash -168076210, now seen corresponding path program 1 times [2021-08-27 16:30:19,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:19,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969590358] [2021-08-27 16:30:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:19,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:19,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:19,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969590358] [2021-08-27 16:30:19,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969590358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:19,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:19,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:30:19,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975898540] [2021-08-27 16:30:19,904 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:19,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:19,919 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2021-08-27 16:30:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:19,946 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2021-08-27 16:30:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:19,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2021-08-27 16:30:19,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-27 16:30:19,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2021-08-27 16:30:19,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-08-27 16:30:19,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-08-27 16:30:19,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2021-08-27 16:30:19,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:19,960 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-08-27 16:30:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2021-08-27 16:30:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-08-27 16:30:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 states have internal predecessors, (97), 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) [2021-08-27 16:30:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2021-08-27 16:30:19,985 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-08-27 16:30:19,985 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-08-27 16:30:19,985 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:30:19,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2021-08-27 16:30:19,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-27 16:30:19,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:19,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:19,990 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 16:30:19,990 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:19,990 INFO L791 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 212#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 213#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 167#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 168#L198-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 180#L315-1 [2021-08-27 16:30:19,990 INFO L793 eck$LassoCheckResult]: Loop: 180#L315-1 assume !false; 219#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 169#L264 assume !false; 202#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 203#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 192#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 193#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 175#L244 assume !(0 != eval_~tmp___1~0); 177#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 204#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 217#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 224#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 218#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 200#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 183#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 184#L322 assume !(0 != start_simulation_~tmp~3); 180#L315-1 [2021-08-27 16:30:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2021-08-27 16:30:19,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:19,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620255085] [2021-08-27 16:30:19,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:19,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:20,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:20,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620255085] [2021-08-27 16:30:20,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620255085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:20,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:20,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:30:20,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074041504] [2021-08-27 16:30:20,058 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 1 times [2021-08-27 16:30:20,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506303953] [2021-08-27 16:30:20,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:20,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:20,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506303953] [2021-08-27 16:30:20,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506303953] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:20,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:20,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:20,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463976476] [2021-08-27 16:30:20,113 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:20,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:20,114 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2021-08-27 16:30:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:20,123 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2021-08-27 16:30:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:20,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2021-08-27 16:30:20,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-27 16:30:20,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2021-08-27 16:30:20,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-08-27 16:30:20,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-08-27 16:30:20,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2021-08-27 16:30:20,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:20,126 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-08-27 16:30:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2021-08-27 16:30:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-08-27 16:30:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.411764705882353) internal successors, (96), 67 states have internal predecessors, (96), 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) [2021-08-27 16:30:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2021-08-27 16:30:20,128 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-08-27 16:30:20,129 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-08-27 16:30:20,129 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:30:20,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2021-08-27 16:30:20,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-27 16:30:20,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:20,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:20,129 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 16:30:20,130 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:20,130 INFO L791 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 357#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 358#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 312#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 313#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 325#L315-1 [2021-08-27 16:30:20,130 INFO L793 eck$LassoCheckResult]: Loop: 325#L315-1 assume !false; 364#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 314#L264 assume !false; 347#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 348#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 337#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 338#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 322#L244 assume !(0 != eval_~tmp___1~0); 324#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 349#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 361#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 369#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 363#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 342#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 328#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 329#L322 assume !(0 != start_simulation_~tmp~3); 325#L315-1 [2021-08-27 16:30:20,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2021-08-27 16:30:20,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029052593] [2021-08-27 16:30:20,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,151 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 2 times [2021-08-27 16:30:20,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773115241] [2021-08-27 16:30:20,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:20,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:20,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773115241] [2021-08-27 16:30:20,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773115241] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:20,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:20,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:20,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062227320] [2021-08-27 16:30:20,240 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:20,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:30:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:30:20,241 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:20,345 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2021-08-27 16:30:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 16:30:20,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2021-08-27 16:30:20,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2021-08-27 16:30:20,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2021-08-27 16:30:20,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2021-08-27 16:30:20,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2021-08-27 16:30:20,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2021-08-27 16:30:20,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:20,348 INFO L681 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2021-08-27 16:30:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2021-08-27 16:30:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2021-08-27 16:30:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 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) [2021-08-27 16:30:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2021-08-27 16:30:20,351 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-08-27 16:30:20,351 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-08-27 16:30:20,351 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:30:20,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2021-08-27 16:30:20,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-27 16:30:20,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:20,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:20,352 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 16:30:20,352 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:20,352 INFO L791 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 575#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 576#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 530#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 531#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 542#L315-1 [2021-08-27 16:30:20,353 INFO L793 eck$LassoCheckResult]: Loop: 542#L315-1 assume !false; 582#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 532#L264 assume !false; 564#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 565#L216 assume !(0 == ~p_dw_st~0); 574#L220 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 588#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 590#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 589#L244 assume !(0 != eval_~tmp___1~0); 566#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 567#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 580#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 587#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 581#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 559#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 545#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 546#L322 assume !(0 != start_simulation_~tmp~3); 542#L315-1 [2021-08-27 16:30:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2021-08-27 16:30:20,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846215541] [2021-08-27 16:30:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,373 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash 616414076, now seen corresponding path program 1 times [2021-08-27 16:30:20,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510826973] [2021-08-27 16:30:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:20,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:20,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510826973] [2021-08-27 16:30:20,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510826973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:20,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:20,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:20,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345842123] [2021-08-27 16:30:20,419 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:20,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:20,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:20,420 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2021-08-27 16:30:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:20,456 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2021-08-27 16:30:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:20,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2021-08-27 16:30:20,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2021-08-27 16:30:20,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2021-08-27 16:30:20,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-27 16:30:20,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-27 16:30:20,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2021-08-27 16:30:20,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:20,459 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2021-08-27 16:30:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2021-08-27 16:30:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2021-08-27 16:30:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 103 states have internal predecessors, (142), 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) [2021-08-27 16:30:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2021-08-27 16:30:20,477 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2021-08-27 16:30:20,477 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2021-08-27 16:30:20,477 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:30:20,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2021-08-27 16:30:20,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2021-08-27 16:30:20,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:20,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:20,479 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:20,479 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:20,479 INFO L791 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 776#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 777#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 728#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 729#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 742#L315-1 assume !false; 783#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 731#L264 [2021-08-27 16:30:20,479 INFO L793 eck$LassoCheckResult]: Loop: 731#L264 assume !false; 792#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 800#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 797#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 796#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 795#L244 assume 0 != eval_~tmp___1~0; 794#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 752#L253 assume !(0 != eval_~tmp~1); 730#L249 assume !(0 == ~c_dr_st~0); 731#L264 [2021-08-27 16:30:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2021-08-27 16:30:20,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182119853] [2021-08-27 16:30:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,486 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489344, now seen corresponding path program 1 times [2021-08-27 16:30:20,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241280883] [2021-08-27 16:30:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,516 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037256, now seen corresponding path program 1 times [2021-08-27 16:30:20,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986413307] [2021-08-27 16:30:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:20,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:20,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986413307] [2021-08-27 16:30:20,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986413307] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:20,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:20,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:30:20,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982001949] [2021-08-27 16:30:20,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:20,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:20,621 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:20,643 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2021-08-27 16:30:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:20,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2021-08-27 16:30:20,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2021-08-27 16:30:20,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2021-08-27 16:30:20,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2021-08-27 16:30:20,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2021-08-27 16:30:20,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2021-08-27 16:30:20,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:20,649 INFO L681 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2021-08-27 16:30:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2021-08-27 16:30:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2021-08-27 16:30:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 145 states have internal predecessors, (197), 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) [2021-08-27 16:30:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2021-08-27 16:30:20,656 INFO L704 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2021-08-27 16:30:20,657 INFO L587 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2021-08-27 16:30:20,657 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 16:30:20,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2021-08-27 16:30:20,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2021-08-27 16:30:20,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:20,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:20,658 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:20,659 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:20,659 INFO L791 eck$LassoCheckResult]: Stem: 1088#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1075#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1076#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1024#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1025#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1038#L315-1 assume !false; 1141#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1139#L264 [2021-08-27 16:30:20,659 INFO L793 eck$LassoCheckResult]: Loop: 1139#L264 assume !false; 1138#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1137#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1135#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1134#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 1110#L244 assume 0 != eval_~tmp___1~0; 1111#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 1114#L253 assume !(0 != eval_~tmp~1); 1116#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 1140#L268 assume !(0 != eval_~tmp___0~1); 1139#L264 [2021-08-27 16:30:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2021-08-27 16:30:20,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530827807] [2021-08-27 16:30:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,697 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395562, now seen corresponding path program 1 times [2021-08-27 16:30:20,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592671347] [2021-08-27 16:30:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,725 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,728 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:20,729 INFO L82 PathProgramCache]: Analyzing trace with hash 560416882, now seen corresponding path program 1 times [2021-08-27 16:30:20,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:20,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053031023] [2021-08-27 16:30:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:20,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,735 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:20,756 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:21,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:30:21 BoogieIcfgContainer [2021-08-27 16:30:21,415 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:30:21,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:30:21,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:30:21,415 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:30:21,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:19" (3/4) ... [2021-08-27 16:30:21,417 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 16:30:21,446 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 16:30:21,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:30:21,448 INFO L168 Benchmark]: Toolchain (without parser) took 2546.62 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 38.2 MB in the beginning and 60.4 MB in the end (delta: -22.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:21,448 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 41.4 MB in the beginning and 41.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:30:21,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.37 ms. Allocated memory is still 58.7 MB. Free memory was 38.0 MB in the beginning and 41.4 MB in the end (delta: -3.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:21,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 58.7 MB. Free memory was 41.4 MB in the beginning and 39.3 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:30:21,449 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 58.7 MB. Free memory was 39.3 MB in the beginning and 37.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:21,450 INFO L168 Benchmark]: RCFGBuilder took 390.83 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.6 MB in the beginning and 39.7 MB in the end (delta: -2.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:21,450 INFO L168 Benchmark]: BuchiAutomizer took 1800.34 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 39.7 MB in the beginning and 62.5 MB in the end (delta: -22.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:21,450 INFO L168 Benchmark]: Witness Printer took 31.60 ms. Allocated memory is still 104.9 MB. Free memory was 62.5 MB in the beginning and 60.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:21,452 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.15 ms. Allocated memory is still 58.7 MB. Free memory was 41.4 MB in the beginning and 41.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 212.37 ms. Allocated memory is still 58.7 MB. Free memory was 38.0 MB in the beginning and 41.4 MB in the end (delta: -3.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 58.7 MB. Free memory was 41.4 MB in the beginning and 39.3 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 58.7 MB. Free memory was 39.3 MB in the beginning and 37.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 390.83 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.6 MB in the beginning and 39.7 MB in the end (delta: -2.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1800.34 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 39.7 MB in the beginning and 62.5 MB in the end (delta: -22.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. * Witness Printer took 31.60 ms. Allocated memory is still 104.9 MB. Free memory was 62.5 MB in the beginning and 60.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 146 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 47.4ms AutomataMinimizationTime, 5 MinimizatonAttempts, 118 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 146 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 537 SDtfs, 571 SDslu, 420 SDs, 0 SdLazy, 55 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.8ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 239]: 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 {p_last_write=0, c_dr_i=1, c_dr_pc=0, NULL=3, a_t=0, NULL=0, \result=0, NULL=1, c_num_read=0, tmp=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, NULL=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46c530a0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62dcf297=0, p_dw_pc=0, NULL=0, NULL=0, NULL=0, tmp=0, q_free=1, NULL=4, p_dw_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7efb0baf=0, c_last_read=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72ce64b1=0, p_num_write=0, q_buf_0=0, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 239]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int q_buf_0 ; [L17] int q_free ; [L18] int q_read_ev ; [L19] int q_write_ev ; [L20] int p_num_write ; [L21] int p_last_write ; [L22] int p_dw_st ; [L23] int p_dw_pc ; [L24] int p_dw_i ; [L25] int c_num_read ; [L26] int c_last_read ; [L27] int c_dr_st ; [L28] int c_dr_pc ; [L29] int c_dr_i ; [L136] static int a_t ; [L352] int __retres1 ; [L338] q_free = 1 [L339] q_write_ev = 2 [L340] q_read_ev = q_write_ev [L341] p_num_write = 0 [L342] p_dw_pc = 0 [L343] p_dw_i = 1 [L344] c_num_read = 0 [L345] c_dr_pc = 0 [L346] c_dr_i = 1 [L306] int kernel_st ; [L307] int tmp ; [L311] kernel_st = 0 [L198] COND TRUE (int )p_dw_i == 1 [L199] p_dw_st = 0 [L203] COND TRUE (int )c_dr_i == 1 [L204] c_dr_st = 0 [L315] COND TRUE 1 [L318] kernel_st = 1 [L233] int tmp ; [L234] int tmp___0 ; [L235] int tmp___1 ; Loop: [L239] COND TRUE 1 [L213] int __retres1 ; [L216] COND TRUE (int )p_dw_st == 0 [L217] __retres1 = 1 [L229] return (__retres1); [L242] tmp___1 = exists_runnable_thread() [L244] COND TRUE \read(tmp___1) [L249] COND TRUE (int )p_dw_st == 0 [L251] tmp = __VERIFIER_nondet_int() [L253] COND FALSE !(\read(tmp)) [L264] COND TRUE (int )c_dr_st == 0 [L266] tmp___0 = __VERIFIER_nondet_int() [L268] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 16:30:21,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...