./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 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_13.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 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 19:03:39,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 19:03:39,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 19:03:39,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 19:03:39,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 19:03:39,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 19:03:39,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 19:03:39,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 19:03:39,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 19:03:39,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 19:03:39,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 19:03:39,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 19:03:39,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 19:03:39,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 19:03:39,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 19:03:39,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 19:03:39,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 19:03:39,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 19:03:39,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 19:03:39,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 19:03:39,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 19:03:39,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 19:03:39,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 19:03:39,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 19:03:39,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 19:03:39,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 19:03:39,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 19:03:39,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 19:03:39,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 19:03:39,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 19:03:39,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 19:03:39,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 19:03:39,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 19:03:39,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 19:03:39,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 19:03:39,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 19:03:39,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 19:03:39,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 19:03:39,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 19:03:39,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 19:03:39,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 19:03:39,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 19:03:39,976 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 19:03:39,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 19:03:39,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 19:03:39,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 19:03:39,979 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 19:03:39,979 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 19:03:39,979 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 19:03:39,979 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 19:03:39,979 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 19:03:39,979 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 19:03:39,980 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 19:03:39,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 19:03:39,980 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 19:03:39,981 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 19:03:39,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 19:03:39,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 19:03:39,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 19:03:39,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 19:03:39,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 19:03:39,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 19:03:39,982 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 19:03:39,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 19:03:39,982 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 19:03:39,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 19:03:39,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 19:03:39,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 19:03:39,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 19:03:39,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 19:03:39,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 19:03:39,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 19:03:39,984 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 19:03:39,984 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 -> 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 [2021-07-06 19:03:40,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 19:03:40,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 19:03:40,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 19:03:40,236 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 19:03:40,237 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 19:03:40,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2021-07-06 19:03:40,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0e2815b/a4aa4ae6632e4827850b69958a59cf92/FLAGb33111254 [2021-07-06 19:03:40,608 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 19:03:40,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2021-07-06 19:03:40,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0e2815b/a4aa4ae6632e4827850b69958a59cf92/FLAGb33111254 [2021-07-06 19:03:41,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0e2815b/a4aa4ae6632e4827850b69958a59cf92 [2021-07-06 19:03:41,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 19:03:41,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 19:03:41,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:41,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 19:03:41,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 19:03:41,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c263543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41, skipping insertion in model container [2021-07-06 19:03:41,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 19:03:41,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 19:03:41,166 WARN L224 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_13.c[4936,4949] [2021-07-06 19:03:41,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:41,173 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 19:03:41,224 WARN L224 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_13.c[4936,4949] [2021-07-06 19:03:41,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:41,234 INFO L208 MainTranslator]: Completed translation [2021-07-06 19:03:41,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41 WrapperNode [2021-07-06 19:03:41,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:41,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:41,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 19:03:41,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 19:03:41,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:41,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 19:03:41,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 19:03:41,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 19:03:41,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 19:03:41,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 19:03:41,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 19:03:41,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 19:03:41,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (1/1) ... [2021-07-06 19:03:41,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 19:03:41,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 19:03:41,326 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-07-06 19:03:41,342 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-07-06 19:03:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 19:03:41,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 19:03:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 19:03:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 19:03:41,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 19:03:41,757 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-07-06 19:03:41,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:41 BoogieIcfgContainer [2021-07-06 19:03:41,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 19:03:41,759 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 19:03:41,759 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 19:03:41,761 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 19:03:41,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:41,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 07:03:41" (1/3) ... [2021-07-06 19:03:41,762 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18782067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:41, skipping insertion in model container [2021-07-06 19:03:41,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:41,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:41" (2/3) ... [2021-07-06 19:03:41,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18782067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:41, skipping insertion in model container [2021-07-06 19:03:41,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:41,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:41" (3/3) ... [2021-07-06 19:03:41,764 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2021-07-06 19:03:41,805 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 19:03:41,805 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 19:03:41,805 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 19:03:41,805 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 19:03:41,805 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 19:03:41,805 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 19:03:41,805 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 19:03:41,805 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 19:03:41,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-07-06 19:03:41,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-07-06 19:03:41,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:41,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:41,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:41,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:41,844 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 19:03:41,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-07-06 19:03:41,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-07-06 19:03:41,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:41,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:41,851 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:41,851 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:41,856 INFO L791 eck$LassoCheckResult]: Stem: 43#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 12#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 27#L197-1true [2021-07-06 19:03:41,859 INFO L793 eck$LassoCheckResult]: Loop: 27#L197-1true assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 41#L52true 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 38#L83true assume 0 != main_~p1~0;main_~lk1~0 := 1; 35#L83-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 16#L87-1true assume !(0 != main_~p3~0); 3#L91-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 10#L95-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 49#L99-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 32#L103-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 13#L107-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 25#L111-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 7#L115-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 46#L119-1true assume !(0 != main_~p11~0); 29#L123-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 39#L127-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 20#L131-1true assume !(0 != main_~p1~0); 8#L137-1true assume !(0 != main_~p2~0); 21#L142-1true assume !(0 != main_~p3~0); 36#L147-1true assume !(0 != main_~p4~0); 47#L152-1true assume !(0 != main_~p5~0); 5#L157-1true assume !(0 != main_~p6~0); 17#L162-1true assume !(0 != main_~p7~0); 33#L167-1true assume !(0 != main_~p8~0); 45#L172-1true assume !(0 != main_~p9~0); 4#L177-1true assume !(0 != main_~p10~0); 15#L182-1true assume !(0 != main_~p11~0); 30#L187-1true assume !(0 != main_~p12~0); 42#L192-1true assume !(0 != main_~p13~0); 27#L197-1true [2021-07-06 19:03:41,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:41,867 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-07-06 19:03:41,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:41,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129155869] [2021-07-06 19:03:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:41,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:41,952 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:41,980 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,001 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,005 INFO L82 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2021-07-06 19:03:42,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313078935] [2021-07-06 19:03:42,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:42,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:42,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:42,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:42,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313078935] [2021-07-06 19:03:42,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313078935] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:42,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:42,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:42,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643649416] [2021-07-06 19:03:42,093 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:42,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:42,103 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:42,144 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2021-07-06 19:03:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:42,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2021-07-06 19:03:42,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-07-06 19:03:42,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2021-07-06 19:03:42,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2021-07-06 19:03:42,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2021-07-06 19:03:42,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2021-07-06 19:03:42,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:42,153 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-07-06 19:03:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2021-07-06 19:03:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-07-06 19:03:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 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-07-06 19:03:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2021-07-06 19:03:42,178 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-07-06 19:03:42,178 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-07-06 19:03:42,178 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 19:03:42,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2021-07-06 19:03:42,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-07-06 19:03:42,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:42,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:42,183 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:42,183 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:42,183 INFO L791 eck$LassoCheckResult]: Stem: 201#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 170#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 171#L197-1 [2021-07-06 19:03:42,183 INFO L793 eck$LassoCheckResult]: Loop: 171#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 198#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 199#L83 assume !(0 != main_~p1~0); 192#L83-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 177#L87-1 assume !(0 != main_~p3~0); 150#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 151#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 167#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 229#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 228#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 227#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 226#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 225#L119-1 assume !(0 != main_~p11~0); 224#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 223#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 222#L131-1 assume !(0 != main_~p1~0); 162#L137-1 assume !(0 != main_~p2~0); 163#L142-1 assume !(0 != main_~p3~0); 194#L147-1 assume !(0 != main_~p4~0); 185#L152-1 assume !(0 != main_~p5~0); 157#L157-1 assume !(0 != main_~p6~0); 159#L162-1 assume !(0 != main_~p7~0); 166#L167-1 assume !(0 != main_~p8~0); 183#L172-1 assume !(0 != main_~p9~0); 209#L177-1 assume !(0 != main_~p10~0); 176#L182-1 assume !(0 != main_~p11~0); 156#L187-1 assume !(0 != main_~p12~0); 179#L192-1 assume !(0 != main_~p13~0); 171#L197-1 [2021-07-06 19:03:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-07-06 19:03:42,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846328552] [2021-07-06 19:03:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,191 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,204 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,207 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2021-07-06 19:03:42,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978529409] [2021-07-06 19:03:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:42,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:42,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:42,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:42,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978529409] [2021-07-06 19:03:42,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978529409] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:42,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:42,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:42,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773528637] [2021-07-06 19:03:42,249 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:42,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:42,252 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:42,281 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2021-07-06 19:03:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:42,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2021-07-06 19:03:42,283 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-07-06 19:03:42,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2021-07-06 19:03:42,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2021-07-06 19:03:42,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2021-07-06 19:03:42,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2021-07-06 19:03:42,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:42,286 INFO L681 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-07-06 19:03:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2021-07-06 19:03:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-07-06 19:03:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 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-07-06 19:03:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2021-07-06 19:03:42,292 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-07-06 19:03:42,292 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-07-06 19:03:42,292 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 19:03:42,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2021-07-06 19:03:42,294 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-07-06 19:03:42,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:42,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:42,294 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:42,294 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:42,294 INFO L791 eck$LassoCheckResult]: Stem: 448#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 420#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 421#L197-1 [2021-07-06 19:03:42,294 INFO L793 eck$LassoCheckResult]: Loop: 421#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 472#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 470#L83 assume !(0 != main_~p1~0); 468#L83-2 assume !(0 != main_~p2~0); 466#L87-1 assume !(0 != main_~p3~0); 465#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 464#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 463#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 462#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 461#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 460#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 459#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 458#L119-1 assume !(0 != main_~p11~0); 457#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 456#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 453#L131-1 assume !(0 != main_~p1~0); 454#L137-1 assume !(0 != main_~p2~0); 499#L142-1 assume !(0 != main_~p3~0); 496#L147-1 assume !(0 != main_~p4~0); 493#L152-1 assume !(0 != main_~p5~0); 490#L157-1 assume !(0 != main_~p6~0); 487#L162-1 assume !(0 != main_~p7~0); 485#L167-1 assume !(0 != main_~p8~0); 482#L172-1 assume !(0 != main_~p9~0); 480#L177-1 assume !(0 != main_~p10~0); 478#L182-1 assume !(0 != main_~p11~0); 475#L187-1 assume !(0 != main_~p12~0); 474#L192-1 assume !(0 != main_~p13~0); 421#L197-1 [2021-07-06 19:03:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,295 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-07-06 19:03:42,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704530390] [2021-07-06 19:03:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,304 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,317 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,320 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2021-07-06 19:03:42,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032208812] [2021-07-06 19:03:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:42,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:42,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:42,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:42,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032208812] [2021-07-06 19:03:42,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032208812] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:42,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:42,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:42,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744762660] [2021-07-06 19:03:42,347 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:42,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:42,347 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:42,360 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2021-07-06 19:03:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:42,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2021-07-06 19:03:42,362 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-07-06 19:03:42,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2021-07-06 19:03:42,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2021-07-06 19:03:42,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2021-07-06 19:03:42,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2021-07-06 19:03:42,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:42,366 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-07-06 19:03:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2021-07-06 19:03:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2021-07-06 19:03:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 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-07-06 19:03:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2021-07-06 19:03:42,381 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-07-06 19:03:42,381 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-07-06 19:03:42,381 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 19:03:42,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2021-07-06 19:03:42,382 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-07-06 19:03:42,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:42,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:42,383 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:42,383 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:42,383 INFO L791 eck$LassoCheckResult]: Stem: 942#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 907#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 908#L197-1 [2021-07-06 19:03:42,383 INFO L793 eck$LassoCheckResult]: Loop: 908#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 986#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 983#L83 assume !(0 != main_~p1~0); 979#L83-2 assume !(0 != main_~p2~0); 976#L87-1 assume !(0 != main_~p3~0); 974#L91-1 assume !(0 != main_~p4~0); 970#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 971#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 966#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 967#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 962#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 963#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 958#L119-1 assume !(0 != main_~p11~0); 959#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 954#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 955#L131-1 assume !(0 != main_~p1~0); 1031#L137-1 assume !(0 != main_~p2~0); 1028#L142-1 assume !(0 != main_~p3~0); 1025#L147-1 assume !(0 != main_~p4~0); 1023#L152-1 assume !(0 != main_~p5~0); 1019#L157-1 assume !(0 != main_~p6~0); 1015#L162-1 assume !(0 != main_~p7~0); 1011#L167-1 assume !(0 != main_~p8~0); 1006#L172-1 assume !(0 != main_~p9~0); 1003#L177-1 assume !(0 != main_~p10~0); 999#L182-1 assume !(0 != main_~p11~0); 994#L187-1 assume !(0 != main_~p12~0); 991#L192-1 assume !(0 != main_~p13~0); 908#L197-1 [2021-07-06 19:03:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-07-06 19:03:42,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277868178] [2021-07-06 19:03:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,390 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,396 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,398 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2021-07-06 19:03:42,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933520813] [2021-07-06 19:03:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:42,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:42,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:42,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:42,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933520813] [2021-07-06 19:03:42,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933520813] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:42,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:42,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:42,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429365499] [2021-07-06 19:03:42,422 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:42,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:42,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:42,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:42,423 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:42,447 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2021-07-06 19:03:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:42,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2021-07-06 19:03:42,453 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-07-06 19:03:42,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2021-07-06 19:03:42,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2021-07-06 19:03:42,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2021-07-06 19:03:42,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2021-07-06 19:03:42,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:42,461 INFO L681 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-07-06 19:03:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2021-07-06 19:03:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2021-07-06 19:03:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 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-07-06 19:03:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2021-07-06 19:03:42,487 INFO L704 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-07-06 19:03:42,487 INFO L587 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-07-06 19:03:42,488 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-07-06 19:03:42,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2021-07-06 19:03:42,490 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-07-06 19:03:42,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:42,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:42,491 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:42,491 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:42,491 INFO L791 eck$LassoCheckResult]: Stem: 1884#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1857#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 1858#L197-1 [2021-07-06 19:03:42,491 INFO L793 eck$LassoCheckResult]: Loop: 1858#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 1938#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1933#L83 assume !(0 != main_~p1~0); 1925#L83-2 assume !(0 != main_~p2~0); 1918#L87-1 assume !(0 != main_~p3~0); 1913#L91-1 assume !(0 != main_~p4~0); 1914#L95-1 assume !(0 != main_~p5~0); 2054#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2052#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2049#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2047#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2041#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2039#L119-1 assume !(0 != main_~p11~0); 2033#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2029#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2026#L131-1 assume !(0 != main_~p1~0); 2021#L137-1 assume !(0 != main_~p2~0); 2016#L142-1 assume !(0 != main_~p3~0); 2009#L147-1 assume !(0 != main_~p4~0); 2004#L152-1 assume !(0 != main_~p5~0); 2001#L157-1 assume !(0 != main_~p6~0); 1997#L162-1 assume !(0 != main_~p7~0); 1995#L167-1 assume !(0 != main_~p8~0); 1991#L172-1 assume !(0 != main_~p9~0); 1989#L177-1 assume !(0 != main_~p10~0); 1975#L182-1 assume !(0 != main_~p11~0); 1962#L187-1 assume !(0 != main_~p12~0); 1949#L192-1 assume !(0 != main_~p13~0); 1858#L197-1 [2021-07-06 19:03:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-07-06 19:03:42,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507697391] [2021-07-06 19:03:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,498 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,502 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2021-07-06 19:03:42,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353390677] [2021-07-06 19:03:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:42,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:42,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:42,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:42,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353390677] [2021-07-06 19:03:42,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353390677] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:42,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:42,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:42,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460261589] [2021-07-06 19:03:42,527 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:42,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:42,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:42,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:42,528 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:42,540 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2021-07-06 19:03:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:42,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2021-07-06 19:03:42,550 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-07-06 19:03:42,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-07-06 19:03:42,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2021-07-06 19:03:42,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2021-07-06 19:03:42,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2021-07-06 19:03:42,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:42,560 INFO L681 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-07-06 19:03:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2021-07-06 19:03:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2021-07-06 19:03:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 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-07-06 19:03:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-07-06 19:03:42,579 INFO L704 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-07-06 19:03:42,579 INFO L587 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-07-06 19:03:42,579 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-07-06 19:03:42,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2021-07-06 19:03:42,589 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-07-06 19:03:42,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:42,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:42,591 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:42,591 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:42,591 INFO L791 eck$LassoCheckResult]: Stem: 3754#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3721#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 3722#L197-1 [2021-07-06 19:03:42,592 INFO L793 eck$LassoCheckResult]: Loop: 3722#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 3847#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3844#L83 assume !(0 != main_~p1~0); 3840#L83-2 assume !(0 != main_~p2~0); 3837#L87-1 assume !(0 != main_~p3~0); 3802#L91-1 assume !(0 != main_~p4~0); 3803#L95-1 assume !(0 != main_~p5~0); 4060#L99-1 assume !(0 != main_~p6~0); 4061#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4037#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4032#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4020#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4018#L119-1 assume !(0 != main_~p11~0); 4011#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4005#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 3999#L131-1 assume !(0 != main_~p1~0); 3993#L137-1 assume !(0 != main_~p2~0); 3972#L142-1 assume !(0 != main_~p3~0); 3967#L147-1 assume !(0 != main_~p4~0); 3965#L152-1 assume !(0 != main_~p5~0); 3961#L157-1 assume !(0 != main_~p6~0); 3958#L162-1 assume !(0 != main_~p7~0); 3929#L167-1 assume !(0 != main_~p8~0); 3924#L172-1 assume !(0 != main_~p9~0); 3922#L177-1 assume !(0 != main_~p10~0); 3919#L182-1 assume !(0 != main_~p11~0); 3914#L187-1 assume !(0 != main_~p12~0); 3852#L192-1 assume !(0 != main_~p13~0); 3722#L197-1 [2021-07-06 19:03:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,592 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-07-06 19:03:42,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108173877] [2021-07-06 19:03:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,608 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,622 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,631 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2021-07-06 19:03:42,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771887262] [2021-07-06 19:03:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:42,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:42,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:42,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:42,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771887262] [2021-07-06 19:03:42,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771887262] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:42,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:42,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:42,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431166624] [2021-07-06 19:03:42,661 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:42,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:42,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:42,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:42,664 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:42,678 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2021-07-06 19:03:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:42,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2021-07-06 19:03:42,693 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-07-06 19:03:42,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-07-06 19:03:42,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2021-07-06 19:03:42,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2021-07-06 19:03:42,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2021-07-06 19:03:42,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:42,706 INFO L681 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-07-06 19:03:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2021-07-06 19:03:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-07-06 19:03:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 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-07-06 19:03:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-07-06 19:03:42,752 INFO L704 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-07-06 19:03:42,752 INFO L587 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-07-06 19:03:42,752 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-07-06 19:03:42,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2021-07-06 19:03:42,761 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-07-06 19:03:42,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:42,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:42,762 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:42,762 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:42,763 INFO L791 eck$LassoCheckResult]: Stem: 7434#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7395#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 7396#L197-1 [2021-07-06 19:03:42,763 INFO L793 eck$LassoCheckResult]: Loop: 7396#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 7873#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 7869#L83 assume !(0 != main_~p1~0); 7867#L83-2 assume !(0 != main_~p2~0); 7603#L87-1 assume !(0 != main_~p3~0); 7604#L91-1 assume !(0 != main_~p4~0); 7586#L95-1 assume !(0 != main_~p5~0); 7576#L99-1 assume !(0 != main_~p6~0); 7566#L103-1 assume !(0 != main_~p7~0); 7559#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7553#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7547#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7541#L119-1 assume !(0 != main_~p11~0); 7534#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7535#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 7834#L131-1 assume !(0 != main_~p1~0); 7832#L137-1 assume !(0 != main_~p2~0); 7816#L142-1 assume !(0 != main_~p3~0); 7805#L147-1 assume !(0 != main_~p4~0); 7794#L152-1 assume !(0 != main_~p5~0); 7795#L157-1 assume !(0 != main_~p6~0); 7912#L162-1 assume !(0 != main_~p7~0); 7909#L167-1 assume !(0 != main_~p8~0); 7904#L172-1 assume !(0 != main_~p9~0); 7901#L177-1 assume !(0 != main_~p10~0); 7899#L182-1 assume !(0 != main_~p11~0); 7883#L187-1 assume !(0 != main_~p12~0); 7877#L192-1 assume !(0 != main_~p13~0); 7396#L197-1 [2021-07-06 19:03:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-07-06 19:03:42,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309404819] [2021-07-06 19:03:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,773 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:42,785 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:42,790 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2021-07-06 19:03:42,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:42,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785431036] [2021-07-06 19:03:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:42,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:42,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:42,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:42,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:42,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:42,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785431036] [2021-07-06 19:03:42,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785431036] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:42,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:42,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:42,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309102363] [2021-07-06 19:03:42,814 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:42,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:42,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:42,815 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:42,851 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2021-07-06 19:03:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:42,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2021-07-06 19:03:42,880 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-07-06 19:03:42,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-07-06 19:03:42,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2021-07-06 19:03:42,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2021-07-06 19:03:42,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2021-07-06 19:03:42,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:42,909 INFO L681 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-07-06 19:03:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2021-07-06 19:03:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2021-07-06 19:03:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 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-07-06 19:03:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-07-06 19:03:42,987 INFO L704 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-07-06 19:03:42,987 INFO L587 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-07-06 19:03:42,987 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-07-06 19:03:42,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2021-07-06 19:03:43,016 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-07-06 19:03:43,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:43,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:43,018 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:43,018 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:43,019 INFO L791 eck$LassoCheckResult]: Stem: 14679#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14638#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 14639#L197-1 [2021-07-06 19:03:43,019 INFO L793 eck$LassoCheckResult]: Loop: 14639#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 14941#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 14937#L83 assume !(0 != main_~p1~0); 14934#L83-2 assume !(0 != main_~p2~0); 14935#L87-1 assume !(0 != main_~p3~0); 14873#L91-1 assume !(0 != main_~p4~0); 14874#L95-1 assume !(0 != main_~p5~0); 14854#L99-1 assume !(0 != main_~p6~0); 14856#L103-1 assume !(0 != main_~p7~0); 14830#L107-1 assume !(0 != main_~p8~0); 14832#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 14813#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 14814#L119-1 assume !(0 != main_~p11~0); 14797#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 14798#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 14778#L131-1 assume !(0 != main_~p1~0); 14780#L137-1 assume !(0 != main_~p2~0); 14981#L142-1 assume !(0 != main_~p3~0); 14977#L147-1 assume !(0 != main_~p4~0); 14975#L152-1 assume !(0 != main_~p5~0); 14972#L157-1 assume !(0 != main_~p6~0); 14968#L162-1 assume !(0 != main_~p7~0); 14964#L167-1 assume !(0 != main_~p8~0); 14960#L172-1 assume !(0 != main_~p9~0); 14957#L177-1 assume !(0 != main_~p10~0); 14953#L182-1 assume !(0 != main_~p11~0); 14948#L187-1 assume !(0 != main_~p12~0); 14945#L192-1 assume !(0 != main_~p13~0); 14639#L197-1 [2021-07-06 19:03:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-07-06 19:03:43,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:43,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441811102] [2021-07-06 19:03:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:43,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:43,030 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:43,041 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:43,047 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:43,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2021-07-06 19:03:43,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:43,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109046989] [2021-07-06 19:03:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:43,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:43,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:43,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:43,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:43,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:43,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:43,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:43,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:43,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109046989] [2021-07-06 19:03:43,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109046989] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:43,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:43,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:43,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198592481] [2021-07-06 19:03:43,071 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:43,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:43,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:43,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:43,071 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:43,107 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2021-07-06 19:03:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:43,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2021-07-06 19:03:43,182 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-07-06 19:03:43,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-07-06 19:03:43,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2021-07-06 19:03:43,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2021-07-06 19:03:43,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2021-07-06 19:03:43,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:43,292 INFO L681 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-07-06 19:03:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2021-07-06 19:03:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2021-07-06 19:03:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 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-07-06 19:03:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-07-06 19:03:43,448 INFO L704 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-07-06 19:03:43,448 INFO L587 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-07-06 19:03:43,448 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-07-06 19:03:43,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2021-07-06 19:03:43,496 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-07-06 19:03:43,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:43,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:43,497 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:43,497 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:43,497 INFO L791 eck$LassoCheckResult]: Stem: 28954#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 28920#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 28921#L197-1 [2021-07-06 19:03:43,498 INFO L793 eck$LassoCheckResult]: Loop: 28921#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 29081#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29077#L83 assume !(0 != main_~p1~0); 29073#L83-2 assume !(0 != main_~p2~0); 29071#L87-1 assume !(0 != main_~p3~0); 29067#L91-1 assume !(0 != main_~p4~0); 29064#L95-1 assume !(0 != main_~p5~0); 29060#L99-1 assume !(0 != main_~p6~0); 29056#L103-1 assume !(0 != main_~p7~0); 29057#L107-1 assume !(0 != main_~p8~0); 29446#L111-1 assume !(0 != main_~p9~0); 29443#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29440#L119-1 assume !(0 != main_~p11~0); 29436#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29432#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29427#L131-1 assume !(0 != main_~p1~0); 29422#L137-1 assume !(0 != main_~p2~0); 29353#L142-1 assume !(0 != main_~p3~0); 29348#L147-1 assume !(0 != main_~p4~0); 29344#L152-1 assume !(0 != main_~p5~0); 29340#L157-1 assume !(0 != main_~p6~0); 29338#L162-1 assume !(0 != main_~p7~0); 29337#L167-1 assume !(0 != main_~p8~0); 29336#L172-1 assume !(0 != main_~p9~0); 29335#L177-1 assume !(0 != main_~p10~0); 29331#L182-1 assume !(0 != main_~p11~0); 29089#L187-1 assume !(0 != main_~p12~0); 29086#L192-1 assume !(0 != main_~p13~0); 28921#L197-1 [2021-07-06 19:03:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:43,498 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-07-06 19:03:43,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:43,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85826237] [2021-07-06 19:03:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:43,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:43,512 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:43,517 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:43,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2021-07-06 19:03:43,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:43,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85646251] [2021-07-06 19:03:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:43,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:43,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:43,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:43,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:43,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:43,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:43,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:43,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:43,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85646251] [2021-07-06 19:03:43,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85646251] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:43,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:43,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:43,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155756710] [2021-07-06 19:03:43,550 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:43,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:43,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:43,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:43,551 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:43,628 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2021-07-06 19:03:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:43,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2021-07-06 19:03:43,710 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-07-06 19:03:43,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-07-06 19:03:43,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2021-07-06 19:03:43,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2021-07-06 19:03:43,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2021-07-06 19:03:43,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:43,789 INFO L681 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-07-06 19:03:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2021-07-06 19:03:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2021-07-06 19:03:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 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-07-06 19:03:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-07-06 19:03:44,037 INFO L704 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-07-06 19:03:44,037 INFO L587 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-07-06 19:03:44,037 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-07-06 19:03:44,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2021-07-06 19:03:44,134 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-07-06 19:03:44,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:44,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:44,135 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:44,135 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:44,135 INFO L791 eck$LassoCheckResult]: Stem: 57130#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 57089#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 57090#L197-1 [2021-07-06 19:03:44,135 INFO L793 eck$LassoCheckResult]: Loop: 57090#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 57226#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57223#L83 assume !(0 != main_~p1~0); 57219#L83-2 assume !(0 != main_~p2~0); 57216#L87-1 assume !(0 != main_~p3~0); 57213#L91-1 assume !(0 != main_~p4~0); 57209#L95-1 assume !(0 != main_~p5~0); 57205#L99-1 assume !(0 != main_~p6~0); 57201#L103-1 assume !(0 != main_~p7~0); 57202#L107-1 assume !(0 != main_~p8~0); 57289#L111-1 assume !(0 != main_~p9~0); 57285#L115-1 assume !(0 != main_~p10~0); 57283#L119-1 assume !(0 != main_~p11~0); 57281#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57279#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57275#L131-1 assume !(0 != main_~p1~0); 57271#L137-1 assume !(0 != main_~p2~0); 57268#L142-1 assume !(0 != main_~p3~0); 57263#L147-1 assume !(0 != main_~p4~0); 57259#L152-1 assume !(0 != main_~p5~0); 57255#L157-1 assume !(0 != main_~p6~0); 57253#L162-1 assume !(0 != main_~p7~0); 57250#L167-1 assume !(0 != main_~p8~0); 57246#L172-1 assume !(0 != main_~p9~0); 57242#L177-1 assume !(0 != main_~p10~0); 57239#L182-1 assume !(0 != main_~p11~0); 57234#L187-1 assume !(0 != main_~p12~0); 57231#L192-1 assume !(0 != main_~p13~0); 57090#L197-1 [2021-07-06 19:03:44,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:44,136 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-07-06 19:03:44,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:44,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710680035] [2021-07-06 19:03:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:44,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:44,139 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:44,142 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:44,143 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2021-07-06 19:03:44,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:44,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983121651] [2021-07-06 19:03:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:44,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:44,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:44,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:44,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:44,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:44,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:44,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:44,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:44,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983121651] [2021-07-06 19:03:44,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983121651] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:44,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:44,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:44,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036049359] [2021-07-06 19:03:44,158 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:44,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:44,159 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:44,245 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2021-07-06 19:03:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:44,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2021-07-06 19:03:44,483 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-07-06 19:03:44,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-07-06 19:03:44,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2021-07-06 19:03:44,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2021-07-06 19:03:44,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2021-07-06 19:03:44,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:44,691 INFO L681 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-07-06 19:03:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2021-07-06 19:03:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2021-07-06 19:03:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 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-07-06 19:03:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-07-06 19:03:45,237 INFO L704 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-07-06 19:03:45,237 INFO L587 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-07-06 19:03:45,237 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-07-06 19:03:45,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2021-07-06 19:03:45,338 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-07-06 19:03:45,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:45,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:45,339 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:45,339 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:45,339 INFO L791 eck$LassoCheckResult]: Stem: 112690#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 112651#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 112652#L197-1 [2021-07-06 19:03:45,339 INFO L793 eck$LassoCheckResult]: Loop: 112652#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 113135#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113132#L83 assume !(0 != main_~p1~0); 113128#L83-2 assume !(0 != main_~p2~0); 113125#L87-1 assume !(0 != main_~p3~0); 113118#L91-1 assume !(0 != main_~p4~0); 113106#L95-1 assume !(0 != main_~p5~0); 113096#L99-1 assume !(0 != main_~p6~0); 113088#L103-1 assume !(0 != main_~p7~0); 113078#L107-1 assume !(0 != main_~p8~0); 113075#L111-1 assume !(0 != main_~p9~0); 113071#L115-1 assume !(0 != main_~p10~0); 113068#L119-1 assume !(0 != main_~p11~0); 113065#L123-1 assume !(0 != main_~p12~0); 113066#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113040#L131-1 assume !(0 != main_~p1~0); 113042#L137-1 assume !(0 != main_~p2~0); 113028#L142-1 assume !(0 != main_~p3~0); 113027#L147-1 assume !(0 != main_~p4~0); 112987#L152-1 assume !(0 != main_~p5~0); 112988#L157-1 assume !(0 != main_~p6~0); 112977#L162-1 assume !(0 != main_~p7~0); 112979#L167-1 assume !(0 != main_~p8~0); 113152#L172-1 assume !(0 != main_~p9~0); 113149#L177-1 assume !(0 != main_~p10~0); 113143#L182-1 assume !(0 != main_~p11~0); 113141#L187-1 assume !(0 != main_~p12~0); 113140#L192-1 assume !(0 != main_~p13~0); 112652#L197-1 [2021-07-06 19:03:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-07-06 19:03:45,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:45,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775407384] [2021-07-06 19:03:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:45,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:45,343 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:45,345 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:45,346 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2021-07-06 19:03:45,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:45,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343546366] [2021-07-06 19:03:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:45,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:45,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:45,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:45,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:45,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:45,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:45,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343546366] [2021-07-06 19:03:45,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343546366] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:45,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:45,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 19:03:45,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565070972] [2021-07-06 19:03:45,356 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:45,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:45,357 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-07-06 19:03:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:45,512 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2021-07-06 19:03:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:45,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2021-07-06 19:03:45,975 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-07-06 19:03:46,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-07-06 19:03:46,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2021-07-06 19:03:46,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2021-07-06 19:03:46,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2021-07-06 19:03:46,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:46,335 INFO L681 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-07-06 19:03:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2021-07-06 19:03:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2021-07-06 19:03:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 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-07-06 19:03:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-07-06 19:03:47,197 INFO L704 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-07-06 19:03:47,197 INFO L587 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-07-06 19:03:47,198 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-07-06 19:03:47,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2021-07-06 19:03:47,589 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-07-06 19:03:47,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:47,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:47,590 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:47,590 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:47,590 INFO L791 eck$LassoCheckResult]: Stem: 222271#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 222228#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_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 222229#L197-1 [2021-07-06 19:03:47,590 INFO L793 eck$LassoCheckResult]: Loop: 222229#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 222720#L52 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 222715#L83 assume !(0 != main_~p1~0); 222708#L83-2 assume !(0 != main_~p2~0); 222702#L87-1 assume !(0 != main_~p3~0); 222697#L91-1 assume !(0 != main_~p4~0); 222690#L95-1 assume !(0 != main_~p5~0); 222681#L99-1 assume !(0 != main_~p6~0); 222683#L103-1 assume !(0 != main_~p7~0); 222858#L107-1 assume !(0 != main_~p8~0); 222856#L111-1 assume !(0 != main_~p9~0); 222801#L115-1 assume !(0 != main_~p10~0); 222799#L119-1 assume !(0 != main_~p11~0); 222796#L123-1 assume !(0 != main_~p12~0); 222794#L127-1 assume !(0 != main_~p13~0); 222790#L131-1 assume !(0 != main_~p1~0); 222787#L137-1 assume !(0 != main_~p2~0); 222784#L142-1 assume !(0 != main_~p3~0); 222779#L147-1 assume !(0 != main_~p4~0); 222775#L152-1 assume !(0 != main_~p5~0); 222771#L157-1 assume !(0 != main_~p6~0); 222767#L162-1 assume !(0 != main_~p7~0); 222768#L167-1 assume !(0 != main_~p8~0); 222805#L172-1 assume !(0 != main_~p9~0); 222803#L177-1 assume !(0 != main_~p10~0); 222739#L182-1 assume !(0 != main_~p11~0); 222736#L187-1 assume !(0 != main_~p12~0); 222729#L192-1 assume !(0 != main_~p13~0); 222229#L197-1 [2021-07-06 19:03:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-07-06 19:03:47,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:47,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30876097] [2021-07-06 19:03:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:47,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:47,595 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:47,597 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:47,598 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2021-07-06 19:03:47,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:47,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214361697] [2021-07-06 19:03:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:47,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:47,601 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:47,603 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:47,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:47,608 INFO L82 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2021-07-06 19:03:47,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:47,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054885574] [2021-07-06 19:03:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:47,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:47,612 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:47,615 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:47,618 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:47,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:47,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-07-06 19:03:47,818 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-07-06 19:03:47,979 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2021-07-06 19:03:47,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:48,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-06 19:03:48,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 07:03:48 BoogieIcfgContainer [2021-07-06 19:03:48,077 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 19:03:48,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 19:03:48,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 19:03:48,078 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 19:03:48,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:41" (3/4) ... [2021-07-06 19:03:48,080 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 19:03:48,106 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 19:03:48,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 19:03:48,117 INFO L168 Benchmark]: Toolchain (without parser) took 7089.09 ms. Allocated memory was 52.4 MB in the beginning and 2.9 GB in the end (delta: 2.9 GB). Free memory was 29.4 MB in the beginning and 2.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 528.0 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:48,118 INFO L168 Benchmark]: CDTParser took 1.21 ms. Allocated memory is still 52.4 MB. Free memory was 32.9 MB in the beginning and 32.9 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:03:48,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.20 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 29.3 MB in the beginning and 49.6 MB in the end (delta: -20.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:48,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 67.1 MB. Free memory was 49.6 MB in the beginning and 48.0 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:03:48,119 INFO L168 Benchmark]: Boogie Preprocessor took 14.44 ms. Allocated memory is still 67.1 MB. Free memory was 48.0 MB in the beginning and 46.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:48,119 INFO L168 Benchmark]: RCFGBuilder took 482.11 ms. Allocated memory is still 67.1 MB. Free memory was 46.5 MB in the beginning and 37.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:48,119 INFO L168 Benchmark]: BuchiAutomizer took 6318.15 ms. Allocated memory was 67.1 MB in the beginning and 2.9 GB in the end (delta: 2.9 GB). Free memory was 36.9 MB in the beginning and 2.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 599.9 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:48,120 INFO L168 Benchmark]: Witness Printer took 39.31 ms. Allocated memory is still 2.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:48,121 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21 ms. Allocated memory is still 52.4 MB. Free memory was 32.9 MB in the beginning and 32.9 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 206.20 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 29.3 MB in the beginning and 49.6 MB in the end (delta: -20.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 67.1 MB. Free memory was 49.6 MB in the beginning and 48.0 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 14.44 ms. Allocated memory is still 67.1 MB. Free memory was 48.0 MB in the beginning and 46.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 482.11 ms. Allocated memory is still 67.1 MB. Free memory was 46.5 MB in the beginning and 37.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 6318.15 ms. Allocated memory was 67.1 MB in the beginning and 2.9 GB in the end (delta: 2.9 GB). Free memory was 36.9 MB in the beginning and 2.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 599.9 MB. Max. memory is 16.1 GB. * Witness Printer took 39.31 ms. Allocated memory is still 2.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2018.3ms AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.1s. Biggest automaton had 72706 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1133 SDtfs, 589 SDslu, 709 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 96.9ms Time LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 50]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=3448} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=3448, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75bb784d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55e4dfc3=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2518dd17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@572049f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@301740f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a35dd0b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5215ba54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79eba8e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29c9c320=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a200b1d=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=3449, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61883eff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fbf1922=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14f834cc=0, lk13=0, p13=0, p11=0, lk11=0, cond=10, NULL=3450, NULL=0, NULL=3451, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9a6453f=10, lk4=0, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 19:03:48,152 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...