./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_7.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 d2a1f90505878c0035f7701a954d17ca4375eb05 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 02:02:56,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:02:56,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:02:57,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:02:57,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:02:57,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:02:57,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:02:57,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:02:57,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:02:57,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:02:57,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:02:57,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:02:57,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:02:57,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:02:57,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:02:57,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:02:57,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:02:57,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:02:57,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:02:57,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:02:57,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:02:57,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:02:57,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:02:57,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:02:57,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:02:57,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:02:57,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:02:57,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:02:57,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:02:57,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:02:57,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:02:57,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:02:57,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:02:57,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:02:57,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:02:57,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:02:57,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:02:57,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:02:57,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:02:57,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:02:57,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:02:57,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 02:02:57,131 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:02:57,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:02:57,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:02:57,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:02:57,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:02:57,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:02:57,139 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:02:57,139 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:02:57,139 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:02:57,139 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:02:57,140 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:02:57,140 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:02:57,141 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:02:57,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:02:57,141 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:02:57,141 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:02:57,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:02:57,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:02:57,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:02:57,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:02:57,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:02:57,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:02:57,142 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:02:57,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:02:57,143 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:02:57,143 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:02:57,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:02:57,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:02:57,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:02:57,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:02:57,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:02:57,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:02:57,145 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:02:57,145 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 -> d2a1f90505878c0035f7701a954d17ca4375eb05 [2021-08-31 02:02:57,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:02:57,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:02:57,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:02:57,492 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:02:57,492 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:02:57,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2021-08-31 02:02:57,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a14c863/d3666a5aa7a84ecbb121ca9170a53a2d/FLAGbb41940f8 [2021-08-31 02:02:57,965 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:02:57,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2021-08-31 02:02:57,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a14c863/d3666a5aa7a84ecbb121ca9170a53a2d/FLAGbb41940f8 [2021-08-31 02:02:57,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a14c863/d3666a5aa7a84ecbb121ca9170a53a2d [2021-08-31 02:02:57,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:02:58,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:02:58,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:58,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:02:58,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:02:58,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:58,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd16969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58, skipping insertion in model container [2021-08-31 02:02:58,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:58,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:02:58,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:02:58,195 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/locks/test_locks_7.c[2881,2894] [2021-08-31 02:02:58,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:58,203 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:02:58,279 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/locks/test_locks_7.c[2881,2894] [2021-08-31 02:02:58,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:58,297 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:02:58,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58 WrapperNode [2021-08-31 02:02:58,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:58,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:58,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:02:58,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:02:58,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:58,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:02:58,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:02:58,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:02:58,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:02:58,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:02:58,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:02:58,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:02:58,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (1/1) ... [2021-08-31 02:02:58,379 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:02:58,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:02:58,406 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-31 02:02:58,432 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-31 02:02:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:02:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:02:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:02:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:02:58,622 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:02:58,622 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 02:02:58,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:58 BoogieIcfgContainer [2021-08-31 02:02:58,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:02:58,626 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:02:58,627 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:02:58,630 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:02:58,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:58,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:02:57" (1/3) ... [2021-08-31 02:02:58,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7688c982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:58, skipping insertion in model container [2021-08-31 02:02:58,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:58,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:58" (2/3) ... [2021-08-31 02:02:58,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7688c982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:58, skipping insertion in model container [2021-08-31 02:02:58,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:58,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:58" (3/3) ... [2021-08-31 02:02:58,634 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2021-08-31 02:02:58,688 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:02:58,688 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:02:58,689 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:02:58,689 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:02:58,689 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:02:58,689 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:02:58,689 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:02:58,689 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:02:58,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:58,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-31 02:02:58,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:58,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:58,745 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:58,745 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:58,745 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:02:58,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:58,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-31 02:02:58,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:58,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:58,750 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:58,751 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:58,758 INFO L791 eck$LassoCheckResult]: Stem: 21#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 18#L113-1true [2021-08-31 02:02:58,760 INFO L793 eck$LassoCheckResult]: Loop: 18#L113-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 29#L34true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 30#L53true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L53-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 13#L57-1true assume !(0 != main_~p3~0); 10#L61-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 26#L65-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 28#L69-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 12#L73-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 25#L77-1true assume !(0 != main_~p1~0); 31#L83-1true assume !(0 != main_~p2~0); 15#L88-1true assume !(0 != main_~p3~0); 11#L93-1true assume !(0 != main_~p4~0); 16#L98-1true assume !(0 != main_~p5~0); 8#L103-1true assume !(0 != main_~p6~0); 14#L108-1true assume !(0 != main_~p7~0); 18#L113-1true [2021-08-31 02:02:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:02:58,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478076230] [2021-08-31 02:02:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,862 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2021-08-31 02:02:58,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158492882] [2021-08-31 02:02:58,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:59,035 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-31 02:02:59,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:59,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158492882] [2021-08-31 02:02:59,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158492882] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:59,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:59,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:59,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300529727] [2021-08-31 02:02:59,041 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:59,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:59,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:59,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:59,090 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:59,244 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2021-08-31 02:02:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:59,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2021-08-31 02:02:59,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-08-31 02:02:59,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2021-08-31 02:02:59,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-08-31 02:02:59,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-08-31 02:02:59,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2021-08-31 02:02:59,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:59,257 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-08-31 02:02:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2021-08-31 02:02:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-08-31 02:02:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2021-08-31 02:02:59,282 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-08-31 02:02:59,282 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-08-31 02:02:59,282 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:02:59,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2021-08-31 02:02:59,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-08-31 02:02:59,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:59,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:59,284 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:59,284 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:59,284 INFO L791 eck$LassoCheckResult]: Stem: 119#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 100#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 101#L113-1 [2021-08-31 02:02:59,285 INFO L793 eck$LassoCheckResult]: Loop: 101#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 116#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 121#L53 assume !(0 != main_~p1~0); 123#L53-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 142#L57-1 assume !(0 != main_~p3~0); 141#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 140#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 139#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 138#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 137#L77-1 assume !(0 != main_~p1~0); 136#L83-1 assume !(0 != main_~p2~0); 134#L88-1 assume !(0 != main_~p3~0); 132#L93-1 assume !(0 != main_~p4~0); 129#L98-1 assume !(0 != main_~p5~0); 104#L103-1 assume !(0 != main_~p6~0); 106#L108-1 assume !(0 != main_~p7~0); 101#L113-1 [2021-08-31 02:02:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 02:02:59,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914554484] [2021-08-31 02:02:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,295 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,304 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2021-08-31 02:02:59,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028295817] [2021-08-31 02:02:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:59,325 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-31 02:02:59,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:59,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028295817] [2021-08-31 02:02:59,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028295817] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:59,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:59,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:59,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393668196] [2021-08-31 02:02:59,327 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:59,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:59,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:59,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:59,328 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:59,444 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2021-08-31 02:02:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:59,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2021-08-31 02:02:59,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-08-31 02:02:59,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2021-08-31 02:02:59,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-08-31 02:02:59,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-08-31 02:02:59,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2021-08-31 02:02:59,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:59,453 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-08-31 02:02:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2021-08-31 02:02:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-08-31 02:02:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2021-08-31 02:02:59,463 INFO L704 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-08-31 02:02:59,463 INFO L587 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-08-31 02:02:59,463 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:02:59,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2021-08-31 02:02:59,465 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-08-31 02:02:59,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:59,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:59,466 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:59,466 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:59,466 INFO L791 eck$LassoCheckResult]: Stem: 266#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 243#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 244#L113-1 [2021-08-31 02:02:59,467 INFO L793 eck$LassoCheckResult]: Loop: 244#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 305#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 287#L53 assume !(0 != main_~p1~0); 289#L53-2 assume !(0 != main_~p2~0); 255#L57-1 assume !(0 != main_~p3~0); 250#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 251#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 269#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 293#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 292#L77-1 assume !(0 != main_~p1~0); 273#L83-1 assume !(0 != main_~p2~0); 274#L88-1 assume !(0 != main_~p3~0); 320#L93-1 assume !(0 != main_~p4~0); 317#L98-1 assume !(0 != main_~p5~0); 315#L103-1 assume !(0 != main_~p6~0); 311#L108-1 assume !(0 != main_~p7~0); 244#L113-1 [2021-08-31 02:02:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 02:02:59,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455971909] [2021-08-31 02:02:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,477 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,487 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2021-08-31 02:02:59,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121496487] [2021-08-31 02:02:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:59,507 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-31 02:02:59,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:59,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121496487] [2021-08-31 02:02:59,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121496487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:59,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:59,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:59,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397415004] [2021-08-31 02:02:59,509 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:59,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:59,510 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:59,622 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2021-08-31 02:02:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:59,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2021-08-31 02:02:59,632 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-08-31 02:02:59,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2021-08-31 02:02:59,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-08-31 02:02:59,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-08-31 02:02:59,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2021-08-31 02:02:59,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:59,644 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-08-31 02:02:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2021-08-31 02:02:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-08-31 02:02:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2021-08-31 02:02:59,666 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-08-31 02:02:59,667 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-08-31 02:02:59,667 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:02:59,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2021-08-31 02:02:59,672 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-08-31 02:02:59,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:59,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:59,673 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:59,673 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:59,674 INFO L791 eck$LassoCheckResult]: Stem: 536#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 513#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 514#L113-1 [2021-08-31 02:02:59,674 INFO L793 eck$LassoCheckResult]: Loop: 514#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 575#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 558#L53 assume !(0 != main_~p1~0); 559#L53-2 assume !(0 != main_~p2~0); 632#L57-1 assume !(0 != main_~p3~0); 629#L61-1 assume !(0 != main_~p4~0); 627#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 625#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 623#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 621#L77-1 assume !(0 != main_~p1~0); 618#L83-1 assume !(0 != main_~p2~0); 615#L88-1 assume !(0 != main_~p3~0); 612#L93-1 assume !(0 != main_~p4~0); 608#L98-1 assume !(0 != main_~p5~0); 605#L103-1 assume !(0 != main_~p6~0); 580#L108-1 assume !(0 != main_~p7~0); 514#L113-1 [2021-08-31 02:02:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,674 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 02:02:59,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300789060] [2021-08-31 02:02:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,685 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,702 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2021-08-31 02:02:59,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974713136] [2021-08-31 02:02:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:59,731 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-31 02:02:59,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:59,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974713136] [2021-08-31 02:02:59,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974713136] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:59,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:59,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:59,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255511017] [2021-08-31 02:02:59,733 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:59,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:59,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:59,734 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:59,806 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2021-08-31 02:02:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:59,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2021-08-31 02:02:59,810 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-08-31 02:02:59,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2021-08-31 02:02:59,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2021-08-31 02:02:59,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2021-08-31 02:02:59,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2021-08-31 02:02:59,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:59,815 INFO L681 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-08-31 02:02:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2021-08-31 02:02:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2021-08-31 02:02:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2021-08-31 02:02:59,836 INFO L704 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-08-31 02:02:59,836 INFO L587 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-08-31 02:02:59,836 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:02:59,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2021-08-31 02:02:59,838 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-08-31 02:02:59,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:59,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:59,839 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:59,839 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:59,839 INFO L791 eck$LassoCheckResult]: Stem: 1055#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1031#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 1032#L113-1 [2021-08-31 02:02:59,839 INFO L793 eck$LassoCheckResult]: Loop: 1032#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1129#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 1114#L53 assume !(0 != main_~p1~0); 1116#L53-2 assume !(0 != main_~p2~0); 1096#L57-1 assume !(0 != main_~p3~0); 1097#L61-1 assume !(0 != main_~p4~0); 1168#L65-1 assume !(0 != main_~p5~0); 1167#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1166#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1164#L77-1 assume !(0 != main_~p1~0); 1160#L83-1 assume !(0 != main_~p2~0); 1157#L88-1 assume !(0 != main_~p3~0); 1153#L93-1 assume !(0 != main_~p4~0); 1154#L98-1 assume !(0 != main_~p5~0); 1145#L103-1 assume !(0 != main_~p6~0); 1144#L108-1 assume !(0 != main_~p7~0); 1032#L113-1 [2021-08-31 02:02:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-31 02:02:59,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238657777] [2021-08-31 02:02:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,856 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,864 INFO L82 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2021-08-31 02:02:59,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408639461] [2021-08-31 02:02:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:59,882 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-31 02:02:59,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:59,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408639461] [2021-08-31 02:02:59,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408639461] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:59,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:59,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:59,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283916530] [2021-08-31 02:02:59,884 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:59,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:59,889 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:59,976 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2021-08-31 02:02:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:59,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2021-08-31 02:02:59,991 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-08-31 02:02:59,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2021-08-31 02:02:59,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2021-08-31 02:03:00,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2021-08-31 02:03:00,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2021-08-31 02:03:00,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:00,006 INFO L681 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-08-31 02:03:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2021-08-31 02:03:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2021-08-31 02:03:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:03:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2021-08-31 02:03:00,063 INFO L704 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-08-31 02:03:00,063 INFO L587 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-08-31 02:03:00,063 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:03:00,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2021-08-31 02:03:00,067 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-08-31 02:03:00,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:00,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:00,068 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:00,068 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:03:00,068 INFO L791 eck$LassoCheckResult]: Stem: 2056#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2033#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 2034#L113-1 [2021-08-31 02:03:00,068 INFO L793 eck$LassoCheckResult]: Loop: 2034#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2163#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 2159#L53 assume !(0 != main_~p1~0); 2157#L53-2 assume !(0 != main_~p2~0); 2154#L57-1 assume !(0 != main_~p3~0); 2150#L61-1 assume !(0 != main_~p4~0); 2147#L65-1 assume !(0 != main_~p5~0); 2148#L69-1 assume !(0 != main_~p6~0); 2139#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2140#L77-1 assume !(0 != main_~p1~0); 2128#L83-1 assume !(0 != main_~p2~0); 2130#L88-1 assume !(0 != main_~p3~0); 2118#L93-1 assume !(0 != main_~p4~0); 2119#L98-1 assume !(0 != main_~p5~0); 2172#L103-1 assume !(0 != main_~p6~0); 2169#L108-1 assume !(0 != main_~p7~0); 2034#L113-1 [2021-08-31 02:03:00,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:00,072 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-31 02:03:00,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:00,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504048923] [2021-08-31 02:03:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:00,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,088 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2021-08-31 02:03:00,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:00,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471569746] [2021-08-31 02:03:00,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:00,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:00,131 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-31 02:03:00,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:00,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471569746] [2021-08-31 02:03:00,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471569746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:00,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:00,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 02:03:00,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292176389] [2021-08-31 02:03:00,133 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:00,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:00,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:00,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:00,134 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:03:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:00,202 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2021-08-31 02:03:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:00,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2021-08-31 02:03:00,213 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-08-31 02:03:00,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-08-31 02:03:00,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2021-08-31 02:03:00,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2021-08-31 02:03:00,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2021-08-31 02:03:00,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:00,226 INFO L681 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-08-31 02:03:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2021-08-31 02:03:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2021-08-31 02:03:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:03:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-08-31 02:03:00,253 INFO L704 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-08-31 02:03:00,253 INFO L587 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-08-31 02:03:00,253 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 02:03:00,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2021-08-31 02:03:00,260 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-08-31 02:03:00,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:00,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:00,261 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:00,261 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:03:00,261 INFO L791 eck$LassoCheckResult]: Stem: 4003#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3979#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 3980#L113-1 [2021-08-31 02:03:00,262 INFO L793 eck$LassoCheckResult]: Loop: 3980#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4339#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 4336#L53 assume !(0 != main_~p1~0); 4332#L53-2 assume !(0 != main_~p2~0); 4329#L57-1 assume !(0 != main_~p3~0); 4326#L61-1 assume !(0 != main_~p4~0); 4322#L65-1 assume !(0 != main_~p5~0); 4323#L69-1 assume !(0 != main_~p6~0); 4367#L73-1 assume !(0 != main_~p7~0); 4361#L77-1 assume !(0 != main_~p1~0); 4356#L83-1 assume !(0 != main_~p2~0); 4352#L88-1 assume !(0 != main_~p3~0); 4348#L93-1 assume !(0 != main_~p4~0); 4346#L98-1 assume !(0 != main_~p5~0); 4345#L103-1 assume !(0 != main_~p6~0); 4343#L108-1 assume !(0 != main_~p7~0); 3980#L113-1 [2021-08-31 02:03:00,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-31 02:03:00,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:00,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016431899] [2021-08-31 02:03:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:00,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,270 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,277 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2021-08-31 02:03:00,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:00,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476380539] [2021-08-31 02:03:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:00,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,283 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:00,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2021-08-31 02:03:00,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:00,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315358577] [2021-08-31 02:03:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:00,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,331 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:00,352 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:00,780 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 02:03:00,783 INFO L158 Benchmark]: Toolchain (without parser) took 2782.60ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 39.7MB in the beginning and 35.1MB in the end (delta: 4.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2021-08-31 02:03:00,784 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:03:00,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.95ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 43.8MB in the end (delta: -4.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 02:03:00,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.11ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:03:00,785 INFO L158 Benchmark]: Boogie Preprocessor took 37.49ms. Allocated memory is still 60.8MB. Free memory was 42.3MB in the beginning and 41.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:03:00,786 INFO L158 Benchmark]: RCFGBuilder took 252.15ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 31.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-31 02:03:00,786 INFO L158 Benchmark]: BuchiAutomizer took 2155.68ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 35.1MB in the end (delta: -3.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2021-08-31 02:03:00,788 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.19ms. Allocated memory is still 60.8MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.95ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 43.8MB in the end (delta: -4.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.11ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.49ms. Allocated memory is still 60.8MB. Free memory was 42.3MB in the beginning and 41.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 252.15ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 31.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2155.68ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 35.1MB in the end (delta: -3.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 02:03:00,824 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...