./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 3a877d22 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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:56,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:56,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:56,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:56,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:56,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:56,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:56,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:56,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:56,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:56,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:56,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:56,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:56,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:56,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:56,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:56,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:56,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:56,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:56,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:56,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:56,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:56,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:56,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:56,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:56,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:56,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:56,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:56,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:56,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:56,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:56,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:56,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:56,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:56,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:56,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:56,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:56,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:56,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:56,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:56,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:56,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:06:56,569 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:56,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:56,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:56,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:56,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:56,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:56,571 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:56,571 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:56,572 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:56,572 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:56,572 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:56,572 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:56,573 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:56,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:56,573 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:56,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:56,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:56,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:56,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:56,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:56,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:56,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:56,574 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:56,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:56,574 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:56,575 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:56,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:56,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:56,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:56,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:56,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:56,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:56,577 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:56,577 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2021-12-15 17:06:56,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:56,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:56,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:56,791 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:56,792 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:56,793 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-12-15 17:06:56,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d3f52fc/b977937a9a9346e393ca085579b55f31/FLAG341a74150 [2021-12-15 17:06:57,198 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:57,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2021-12-15 17:06:57,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d3f52fc/b977937a9a9346e393ca085579b55f31/FLAG341a74150 [2021-12-15 17:06:57,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d3f52fc/b977937a9a9346e393ca085579b55f31 [2021-12-15 17:06:57,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:57,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:57,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:57,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:57,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:57,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b90fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57, skipping insertion in model container [2021-12-15 17:06:57,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:57,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:57,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2021-12-15 17:06:57,807 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:57,818 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:57,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2021-12-15 17:06:57,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:57,863 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:57,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57 WrapperNode [2021-12-15 17:06:57,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:57,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:57,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:57,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:57,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,886 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2021-12-15 17:06:57,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:57,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:57,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:57,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:57,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:57,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:57,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:57,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:57,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:57,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:57,957 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-12-15 17:06:57,965 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-12-15 17:06:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:06:58,040 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:06:58,041 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:06:58,187 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:06:58,192 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:06:58,192 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:06:58,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:58 BoogieIcfgContainer [2021-12-15 17:06:58,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:06:58,194 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:06:58,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:06:58,196 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:06:58,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:58,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:57" (1/3) ... [2021-12-15 17:06:58,198 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e4310d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:58, skipping insertion in model container [2021-12-15 17:06:58,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:58,198 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (2/3) ... [2021-12-15 17:06:58,198 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e4310d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:58, skipping insertion in model container [2021-12-15 17:06:58,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:58,198 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:58" (3/3) ... [2021-12-15 17:06:58,199 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2021-12-15 17:06:58,233 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:06:58,234 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:06:58,234 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:06:58,234 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:06:58,234 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:06:58,234 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:06:58,234 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:06:58,234 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:06:58,244 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-12-15 17:06:58,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-12-15 17:06:58,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,261 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,261 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-12-15 17:06:58,261 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:06:58,262 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-12-15 17:06:58,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-12-15 17:06:58,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,271 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,272 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-12-15 17:06:58,276 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 14#L197-1true [2021-12-15 17:06:58,277 INFO L793 eck$LassoCheckResult]: Loop: 14#L197-1true assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 44#L52true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 29#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 16#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 10#L87-1true assume !(0 != main_~p3~0#1); 4#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 46#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 17#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 26#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 15#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 33#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L119-1true assume !(0 != main_~p11~0#1); 47#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 27#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 36#L131-1true assume !(0 != main_~p1~0#1); 13#L137-1true assume !(0 != main_~p2~0#1); 8#L142-1true assume !(0 != main_~p3~0#1); 37#L147-1true assume !(0 != main_~p4~0#1); 12#L152-1true assume !(0 != main_~p5~0#1); 21#L157-1true assume !(0 != main_~p6~0#1); 18#L162-1true assume !(0 != main_~p7~0#1); 19#L167-1true assume !(0 != main_~p8~0#1); 24#L172-1true assume !(0 != main_~p9~0#1); 32#L177-1true assume !(0 != main_~p10~0#1); 48#L182-1true assume !(0 != main_~p11~0#1); 45#L187-1true assume !(0 != main_~p12~0#1); 39#L192-1true assume !(0 != main_~p13~0#1); 14#L197-1true [2021-12-15 17:06:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:06:58,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337321121] [2021-12-15 17:06:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,378 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2021-12-15 17:06:58,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186649456] [2021-12-15 17:06:58,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186649456] [2021-12-15 17:06:58,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186649456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502017543] [2021-12-15 17:06:58,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,467 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,490 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-12-15 17:06:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,516 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2021-12-15 17:06:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2021-12-15 17:06:58,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-12-15 17:06:58,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2021-12-15 17:06:58,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2021-12-15 17:06:58,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2021-12-15 17:06:58,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2021-12-15 17:06:58,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,545 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-12-15 17:06:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2021-12-15 17:06:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-15 17:06:58,567 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-12-15 17:06:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2021-12-15 17:06:58,570 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-12-15 17:06:58,570 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-12-15 17:06:58,570 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:06:58,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2021-12-15 17:06:58,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-12-15 17:06:58,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,573 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-12-15 17:06:58,573 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 157#L197-1 [2021-12-15 17:06:58,574 INFO L793 eck$LassoCheckResult]: Loop: 157#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 209#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 208#L83 assume !(0 != main_~p1~0#1); 207#L83-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 206#L87-1 assume !(0 != main_~p3~0#1); 205#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 198#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 174#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 164#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 165#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 202#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L119-1 assume !(0 != main_~p11~0#1); 201#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 185#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 186#L131-1 assume !(0 != main_~p1~0#1); 200#L137-1 assume !(0 != main_~p2~0#1); 231#L142-1 assume !(0 != main_~p3~0#1); 229#L147-1 assume !(0 != main_~p4~0#1); 227#L152-1 assume !(0 != main_~p5~0#1); 225#L157-1 assume !(0 != main_~p6~0#1); 223#L162-1 assume !(0 != main_~p7~0#1); 221#L167-1 assume !(0 != main_~p8~0#1); 218#L172-1 assume !(0 != main_~p9~0#1); 217#L177-1 assume !(0 != main_~p10~0#1); 215#L182-1 assume !(0 != main_~p11~0#1); 212#L187-1 assume !(0 != main_~p12~0#1); 211#L192-1 assume !(0 != main_~p13~0#1); 157#L197-1 [2021-12-15 17:06:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:06:58,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141904426] [2021-12-15 17:06:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,585 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,591 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2021-12-15 17:06:58,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750749325] [2021-12-15 17:06:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750749325] [2021-12-15 17:06:58,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750749325] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622715152] [2021-12-15 17:06:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,634 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,637 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-12-15 17:06:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,664 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2021-12-15 17:06:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2021-12-15 17:06:58,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-12-15 17:06:58,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2021-12-15 17:06:58,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2021-12-15 17:06:58,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2021-12-15 17:06:58,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2021-12-15 17:06:58,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,672 INFO L681 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-12-15 17:06:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2021-12-15 17:06:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-12-15 17:06:58,680 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-12-15 17:06:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2021-12-15 17:06:58,682 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-12-15 17:06:58,682 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-12-15 17:06:58,682 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:06:58,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2021-12-15 17:06:58,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-12-15 17:06:58,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,685 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,685 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-12-15 17:06:58,685 INFO L791 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 406#L197-1 [2021-12-15 17:06:58,685 INFO L793 eck$LassoCheckResult]: Loop: 406#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 422#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 454#L83 assume !(0 != main_~p1~0#1); 515#L83-2 assume !(0 != main_~p2~0#1); 413#L87-1 assume !(0 != main_~p3~0#1); 401#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 402#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 425#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 414#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 415#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 467#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 468#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 463#L119-1 assume !(0 != main_~p11~0#1); 464#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 437#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 438#L131-1 assume !(0 != main_~p1~0#1); 509#L137-1 assume !(0 != main_~p2~0#1); 553#L142-1 assume !(0 != main_~p3~0#1); 551#L147-1 assume !(0 != main_~p4~0#1); 549#L152-1 assume !(0 != main_~p5~0#1); 547#L157-1 assume !(0 != main_~p6~0#1); 545#L162-1 assume !(0 != main_~p7~0#1); 543#L167-1 assume !(0 != main_~p8~0#1); 540#L172-1 assume !(0 != main_~p9~0#1); 539#L177-1 assume !(0 != main_~p10~0#1); 537#L182-1 assume !(0 != main_~p11~0#1); 523#L187-1 assume !(0 != main_~p12~0#1); 451#L192-1 assume !(0 != main_~p13~0#1); 406#L197-1 [2021-12-15 17:06:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:06:58,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738937411] [2021-12-15 17:06:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,699 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2021-12-15 17:06:58,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179345028] [2021-12-15 17:06:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179345028] [2021-12-15 17:06:58,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179345028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323878677] [2021-12-15 17:06:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,741 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,742 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-12-15 17:06:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,755 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2021-12-15 17:06:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2021-12-15 17:06:58,758 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-12-15 17:06:58,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2021-12-15 17:06:58,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2021-12-15 17:06:58,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2021-12-15 17:06:58,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2021-12-15 17:06:58,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,762 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-12-15 17:06:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2021-12-15 17:06:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2021-12-15 17:06:58,787 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-12-15 17:06:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2021-12-15 17:06:58,789 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-12-15 17:06:58,790 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-12-15 17:06:58,790 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:06:58,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2021-12-15 17:06:58,791 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-12-15 17:06:58,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,791 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,791 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-12-15 17:06:58,792 INFO L791 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 894#L197-1 [2021-12-15 17:06:58,792 INFO L793 eck$LassoCheckResult]: Loop: 894#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1033#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 1031#L83 assume !(0 != main_~p1~0#1); 1029#L83-2 assume !(0 != main_~p2~0#1); 1030#L87-1 assume !(0 != main_~p3~0#1); 1101#L91-1 assume !(0 != main_~p4~0#1); 1100#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1097#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1094#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1091#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1088#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1086#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1083#L119-1 assume !(0 != main_~p11~0#1); 1081#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1077#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1073#L131-1 assume !(0 != main_~p1~0#1); 1068#L137-1 assume !(0 != main_~p2~0#1); 1021#L142-1 assume !(0 != main_~p3~0#1); 1020#L147-1 assume !(0 != main_~p4~0#1); 1060#L152-1 assume !(0 != main_~p5~0#1); 1056#L157-1 assume !(0 != main_~p6~0#1); 1052#L162-1 assume !(0 != main_~p7~0#1); 1048#L167-1 assume !(0 != main_~p8~0#1); 1044#L172-1 assume !(0 != main_~p9~0#1); 1042#L177-1 assume !(0 != main_~p10~0#1); 1039#L182-1 assume !(0 != main_~p11~0#1); 1036#L187-1 assume !(0 != main_~p12~0#1); 1035#L192-1 assume !(0 != main_~p13~0#1); 894#L197-1 [2021-12-15 17:06:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:06:58,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379856683] [2021-12-15 17:06:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,832 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,844 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2021-12-15 17:06:58,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515886610] [2021-12-15 17:06:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515886610] [2021-12-15 17:06:58,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515886610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036045199] [2021-12-15 17:06:58,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,885 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,886 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-12-15 17:06:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,914 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2021-12-15 17:06:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2021-12-15 17:06:58,919 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-12-15 17:06:58,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2021-12-15 17:06:58,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2021-12-15 17:06:58,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2021-12-15 17:06:58,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2021-12-15 17:06:58,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,924 INFO L681 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-12-15 17:06:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2021-12-15 17:06:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2021-12-15 17:06:58,938 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-12-15 17:06:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2021-12-15 17:06:58,941 INFO L704 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-12-15 17:06:58,941 INFO L587 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-12-15 17:06:58,941 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:06:58,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2021-12-15 17:06:58,944 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-12-15 17:06:58,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,944 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,944 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-12-15 17:06:58,944 INFO L791 eck$LassoCheckResult]: Stem: 1873#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 1844#L197-1 [2021-12-15 17:06:58,944 INFO L793 eck$LassoCheckResult]: Loop: 1844#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1950#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 1948#L83 assume !(0 != main_~p1~0#1); 1944#L83-2 assume !(0 != main_~p2~0#1); 1942#L87-1 assume !(0 != main_~p3~0#1); 1938#L91-1 assume !(0 != main_~p4~0#1); 1935#L95-1 assume !(0 != main_~p5~0#1); 1933#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1931#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1929#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1927#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1925#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1923#L119-1 assume !(0 != main_~p11~0#1); 1921#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1919#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1916#L131-1 assume !(0 != main_~p1~0#1); 1917#L137-1 assume !(0 != main_~p2~0#1); 1994#L142-1 assume !(0 != main_~p3~0#1); 1989#L147-1 assume !(0 != main_~p4~0#1); 1985#L152-1 assume !(0 != main_~p5~0#1); 1982#L157-1 assume !(0 != main_~p6~0#1); 1978#L162-1 assume !(0 != main_~p7~0#1); 1974#L167-1 assume !(0 != main_~p8~0#1); 1969#L172-1 assume !(0 != main_~p9~0#1); 1966#L177-1 assume !(0 != main_~p10~0#1); 1962#L182-1 assume !(0 != main_~p11~0#1); 1957#L187-1 assume !(0 != main_~p12~0#1); 1954#L192-1 assume !(0 != main_~p13~0#1); 1844#L197-1 [2021-12-15 17:06:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:06:58,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859730999] [2021-12-15 17:06:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,957 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2021-12-15 17:06:58,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981323512] [2021-12-15 17:06:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981323512] [2021-12-15 17:06:58,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981323512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739874369] [2021-12-15 17:06:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,985 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,986 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-12-15 17:06:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:59,012 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2021-12-15 17:06:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:59,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2021-12-15 17:06:59,021 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-12-15 17:06:59,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-12-15 17:06:59,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2021-12-15 17:06:59,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2021-12-15 17:06:59,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2021-12-15 17:06:59,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:59,027 INFO L681 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-12-15 17:06:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2021-12-15 17:06:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2021-12-15 17:06:59,043 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-12-15 17:06:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-12-15 17:06:59,048 INFO L704 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-12-15 17:06:59,048 INFO L587 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-12-15 17:06:59,048 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:06:59,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2021-12-15 17:06:59,053 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-12-15 17:06:59,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,055 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-12-15 17:06:59,055 INFO L791 eck$LassoCheckResult]: Stem: 3735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 3710#L197-1 [2021-12-15 17:06:59,056 INFO L793 eck$LassoCheckResult]: Loop: 3710#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 3841#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 3837#L83 assume !(0 != main_~p1~0#1); 3830#L83-2 assume !(0 != main_~p2~0#1); 3825#L87-1 assume !(0 != main_~p3~0#1); 3818#L91-1 assume !(0 != main_~p4~0#1); 3810#L95-1 assume !(0 != main_~p5~0#1); 3804#L99-1 assume !(0 != main_~p6~0#1); 3799#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3796#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3793#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3790#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3787#L119-1 assume !(0 != main_~p11~0#1); 3784#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3780#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3781#L131-1 assume !(0 != main_~p1~0#1); 3908#L137-1 assume !(0 != main_~p2~0#1); 3904#L142-1 assume !(0 != main_~p3~0#1); 3894#L147-1 assume !(0 != main_~p4~0#1); 3889#L152-1 assume !(0 != main_~p5~0#1); 3887#L157-1 assume !(0 != main_~p6~0#1); 3886#L162-1 assume !(0 != main_~p7~0#1); 3884#L167-1 assume !(0 != main_~p8~0#1); 3877#L172-1 assume !(0 != main_~p9~0#1); 3866#L177-1 assume !(0 != main_~p10~0#1); 3858#L182-1 assume !(0 != main_~p11~0#1); 3853#L187-1 assume !(0 != main_~p12~0#1); 3850#L192-1 assume !(0 != main_~p13~0#1); 3710#L197-1 [2021-12-15 17:06:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,057 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:06:59,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707979425] [2021-12-15 17:06:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,074 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2021-12-15 17:06:59,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474589434] [2021-12-15 17:06:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:59,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474589434] [2021-12-15 17:06:59,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474589434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:59,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:59,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:59,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302492627] [2021-12-15 17:06:59,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:59,125 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:59,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:59,127 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-12-15 17:06:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:59,147 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2021-12-15 17:06:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:59,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2021-12-15 17:06:59,167 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-12-15 17:06:59,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-12-15 17:06:59,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2021-12-15 17:06:59,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2021-12-15 17:06:59,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2021-12-15 17:06:59,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:59,179 INFO L681 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-12-15 17:06:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2021-12-15 17:06:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-12-15 17:06:59,216 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-12-15 17:06:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-12-15 17:06:59,220 INFO L704 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-12-15 17:06:59,221 INFO L587 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-12-15 17:06:59,223 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:06:59,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2021-12-15 17:06:59,232 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-12-15 17:06:59,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,234 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,234 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-12-15 17:06:59,234 INFO L791 eck$LassoCheckResult]: Stem: 7410#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7383#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 7384#L197-1 [2021-12-15 17:06:59,234 INFO L793 eck$LassoCheckResult]: Loop: 7384#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 7625#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 7624#L83 assume !(0 != main_~p1~0#1); 7593#L83-2 assume !(0 != main_~p2~0#1); 7590#L87-1 assume !(0 != main_~p3~0#1); 7582#L91-1 assume !(0 != main_~p4~0#1); 7531#L95-1 assume !(0 != main_~p5~0#1); 7490#L99-1 assume !(0 != main_~p6~0#1); 7491#L103-1 assume !(0 != main_~p7~0#1); 7731#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7726#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7724#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7722#L119-1 assume !(0 != main_~p11~0#1); 7718#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7712#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7705#L131-1 assume !(0 != main_~p1~0#1); 7654#L137-1 assume !(0 != main_~p2~0#1); 7651#L142-1 assume !(0 != main_~p3~0#1); 7648#L147-1 assume !(0 != main_~p4~0#1); 7646#L152-1 assume !(0 != main_~p5~0#1); 7644#L157-1 assume !(0 != main_~p6~0#1); 7642#L162-1 assume !(0 != main_~p7~0#1); 7641#L167-1 assume !(0 != main_~p8~0#1); 7638#L172-1 assume !(0 != main_~p9~0#1); 7637#L177-1 assume !(0 != main_~p10~0#1); 7635#L182-1 assume !(0 != main_~p11~0#1); 7632#L187-1 assume !(0 != main_~p12~0#1); 7631#L192-1 assume !(0 != main_~p13~0#1); 7384#L197-1 [2021-12-15 17:06:59,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-15 17:06:59,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322191340] [2021-12-15 17:06:59,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2021-12-15 17:06:59,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993834857] [2021-12-15 17:06:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:59,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:59,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993834857] [2021-12-15 17:06:59,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993834857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:59,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:59,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:59,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332632056] [2021-12-15 17:06:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:59,280 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:59,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:59,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:59,281 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-12-15 17:06:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:59,305 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2021-12-15 17:06:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:59,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2021-12-15 17:06:59,331 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-12-15 17:06:59,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-12-15 17:06:59,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2021-12-15 17:06:59,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2021-12-15 17:06:59,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2021-12-15 17:06:59,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:59,358 INFO L681 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-12-15 17:06:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2021-12-15 17:06:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2021-12-15 17:06:59,436 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-12-15 17:06:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-12-15 17:06:59,448 INFO L704 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-12-15 17:06:59,448 INFO L587 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-12-15 17:06:59,449 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:06:59,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2021-12-15 17:06:59,470 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-12-15 17:06:59,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,473 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,473 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-12-15 17:06:59,473 INFO L791 eck$LassoCheckResult]: Stem: 14651#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 14625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 14626#L197-1 [2021-12-15 17:06:59,473 INFO L793 eck$LassoCheckResult]: Loop: 14626#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 15042#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 15039#L83 assume !(0 != main_~p1~0#1); 15035#L83-2 assume !(0 != main_~p2~0#1); 15032#L87-1 assume !(0 != main_~p3~0#1); 15029#L91-1 assume !(0 != main_~p4~0#1); 15025#L95-1 assume !(0 != main_~p5~0#1); 15021#L99-1 assume !(0 != main_~p6~0#1); 15022#L103-1 assume !(0 != main_~p7~0#1); 15100#L107-1 assume !(0 != main_~p8~0#1); 15098#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 15096#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 15094#L119-1 assume !(0 != main_~p11~0#1); 15092#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 15090#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 15087#L131-1 assume !(0 != main_~p1~0#1); 15083#L137-1 assume !(0 != main_~p2~0#1); 15080#L142-1 assume !(0 != main_~p3~0#1); 15075#L147-1 assume !(0 != main_~p4~0#1); 15071#L152-1 assume !(0 != main_~p5~0#1); 15069#L157-1 assume !(0 != main_~p6~0#1); 15068#L162-1 assume !(0 != main_~p7~0#1); 15066#L167-1 assume !(0 != main_~p8~0#1); 15062#L172-1 assume !(0 != main_~p9~0#1); 15059#L177-1 assume !(0 != main_~p10~0#1); 15055#L182-1 assume !(0 != main_~p11~0#1); 15050#L187-1 assume !(0 != main_~p12~0#1); 15047#L192-1 assume !(0 != main_~p13~0#1); 14626#L197-1 [2021-12-15 17:06:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-15 17:06:59,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388292948] [2021-12-15 17:06:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,481 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,492 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2021-12-15 17:06:59,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419244703] [2021-12-15 17:06:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:59,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419244703] [2021-12-15 17:06:59,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419244703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:59,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:59,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:59,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698863804] [2021-12-15 17:06:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:59,520 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:59,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:59,521 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-12-15 17:06:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:59,564 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2021-12-15 17:06:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:59,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2021-12-15 17:06:59,635 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-12-15 17:06:59,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-12-15 17:06:59,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2021-12-15 17:06:59,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2021-12-15 17:06:59,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2021-12-15 17:06:59,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:59,703 INFO L681 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-12-15 17:06:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2021-12-15 17:06:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2021-12-15 17:06:59,841 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-12-15 17:06:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-12-15 17:06:59,905 INFO L704 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-12-15 17:06:59,905 INFO L587 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-12-15 17:06:59,905 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:06:59,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2021-12-15 17:06:59,926 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-12-15 17:06:59,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,927 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-12-15 17:06:59,927 INFO L791 eck$LassoCheckResult]: Stem: 28933#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 28907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 28908#L197-1 [2021-12-15 17:06:59,927 INFO L793 eck$LassoCheckResult]: Loop: 28908#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 29641#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 29642#L83 assume !(0 != main_~p1~0#1); 29625#L83-2 assume !(0 != main_~p2~0#1); 29627#L87-1 assume !(0 != main_~p3~0#1); 29609#L91-1 assume !(0 != main_~p4~0#1); 29611#L95-1 assume !(0 != main_~p5~0#1); 29776#L99-1 assume !(0 != main_~p6~0#1); 29773#L103-1 assume !(0 != main_~p7~0#1); 29769#L107-1 assume !(0 != main_~p8~0#1); 29762#L111-1 assume !(0 != main_~p9~0#1); 29757#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 29753#L119-1 assume !(0 != main_~p11~0#1); 29749#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 29745#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 29738#L131-1 assume !(0 != main_~p1~0#1); 29728#L137-1 assume !(0 != main_~p2~0#1); 29722#L142-1 assume !(0 != main_~p3~0#1); 29714#L147-1 assume !(0 != main_~p4~0#1); 29710#L152-1 assume !(0 != main_~p5~0#1); 29421#L157-1 assume !(0 != main_~p6~0#1); 29423#L162-1 assume !(0 != main_~p7~0#1); 29693#L167-1 assume !(0 != main_~p8~0#1); 29694#L172-1 assume !(0 != main_~p9~0#1); 29684#L177-1 assume !(0 != main_~p10~0#1); 29683#L182-1 assume !(0 != main_~p11~0#1); 29788#L187-1 assume !(0 != main_~p12~0#1); 29656#L192-1 assume !(0 != main_~p13~0#1); 28908#L197-1 [2021-12-15 17:06:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-15 17:06:59,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31128945] [2021-12-15 17:06:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,934 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2021-12-15 17:06:59,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115729174] [2021-12-15 17:06:59,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:59,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:59,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115729174] [2021-12-15 17:06:59,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115729174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:59,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:59,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:59,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366898857] [2021-12-15 17:06:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:59,958 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:59,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:59,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:59,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:59,958 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-12-15 17:07:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,053 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2021-12-15 17:07:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2021-12-15 17:07:00,149 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-12-15 17:07:00,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-12-15 17:07:00,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2021-12-15 17:07:00,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2021-12-15 17:07:00,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2021-12-15 17:07:00,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,292 INFO L681 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-12-15 17:07:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2021-12-15 17:07:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2021-12-15 17:07:00,489 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-12-15 17:07:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-12-15 17:07:00,572 INFO L704 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-12-15 17:07:00,572 INFO L587 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-12-15 17:07:00,572 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:07:00,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2021-12-15 17:07:00,620 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-12-15 17:07:00,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,620 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,620 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-12-15 17:07:00,621 INFO L791 eck$LassoCheckResult]: Stem: 57107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 57077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 57078#L197-1 [2021-12-15 17:07:00,621 INFO L793 eck$LassoCheckResult]: Loop: 57078#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 57248#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 57244#L83 assume !(0 != main_~p1~0#1); 57241#L83-2 assume !(0 != main_~p2~0#1); 57238#L87-1 assume !(0 != main_~p3~0#1); 57234#L91-1 assume !(0 != main_~p4~0#1); 57230#L95-1 assume !(0 != main_~p5~0#1); 57226#L99-1 assume !(0 != main_~p6~0#1); 57221#L103-1 assume !(0 != main_~p7~0#1); 57216#L107-1 assume !(0 != main_~p8~0#1); 57217#L111-1 assume !(0 != main_~p9~0#1); 57538#L115-1 assume !(0 != main_~p10~0#1); 57534#L119-1 assume !(0 != main_~p11~0#1); 57530#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 57526#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 57519#L131-1 assume !(0 != main_~p1~0#1); 57512#L137-1 assume !(0 != main_~p2~0#1); 57494#L142-1 assume !(0 != main_~p3~0#1); 57475#L147-1 assume !(0 != main_~p4~0#1); 57471#L152-1 assume !(0 != main_~p5~0#1); 57467#L157-1 assume !(0 != main_~p6~0#1); 57465#L162-1 assume !(0 != main_~p7~0#1); 57453#L167-1 assume !(0 != main_~p8~0#1); 57451#L172-1 assume !(0 != main_~p9~0#1); 57450#L177-1 assume !(0 != main_~p10~0#1); 57449#L182-1 assume !(0 != main_~p11~0#1); 57253#L187-1 assume !(0 != main_~p12~0#1); 57252#L192-1 assume !(0 != main_~p13~0#1); 57078#L197-1 [2021-12-15 17:07:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-15 17:07:00,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155604630] [2021-12-15 17:07:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,632 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2021-12-15 17:07:00,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162839473] [2021-12-15 17:07:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162839473] [2021-12-15 17:07:00,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162839473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643821980] [2021-12-15 17:07:00,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,662 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,664 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-12-15 17:07:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,746 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2021-12-15 17:07:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2021-12-15 17:07:01,029 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-12-15 17:07:01,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-12-15 17:07:01,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2021-12-15 17:07:01,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2021-12-15 17:07:01,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2021-12-15 17:07:01,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:01,221 INFO L681 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-12-15 17:07:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2021-12-15 17:07:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2021-12-15 17:07:01,709 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-12-15 17:07:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-12-15 17:07:01,786 INFO L704 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-12-15 17:07:01,786 INFO L587 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-12-15 17:07:01,786 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:07:01,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2021-12-15 17:07:01,889 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-12-15 17:07:01,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:01,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:01,890 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:01,890 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-12-15 17:07:01,891 INFO L791 eck$LassoCheckResult]: Stem: 112669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 112639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 112640#L197-1 [2021-12-15 17:07:01,891 INFO L793 eck$LassoCheckResult]: Loop: 112640#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 113657#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 113653#L83 assume !(0 != main_~p1~0#1); 113649#L83-2 assume !(0 != main_~p2~0#1); 113647#L87-1 assume !(0 != main_~p3~0#1); 113643#L91-1 assume !(0 != main_~p4~0#1); 113639#L95-1 assume !(0 != main_~p5~0#1); 113635#L99-1 assume !(0 != main_~p6~0#1); 113631#L103-1 assume !(0 != main_~p7~0#1); 113627#L107-1 assume !(0 != main_~p8~0#1); 113623#L111-1 assume !(0 != main_~p9~0#1); 113624#L115-1 assume !(0 != main_~p10~0#1); 113702#L119-1 assume !(0 != main_~p11~0#1); 113699#L123-1 assume !(0 != main_~p12~0#1); 113697#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 113695#L131-1 assume !(0 != main_~p1~0#1); 113693#L137-1 assume !(0 != main_~p2~0#1); 113681#L142-1 assume !(0 != main_~p3~0#1); 113675#L147-1 assume !(0 != main_~p4~0#1); 113544#L152-1 assume !(0 != main_~p5~0#1); 113545#L157-1 assume !(0 != main_~p6~0#1); 113491#L162-1 assume !(0 != main_~p7~0#1); 113493#L167-1 assume !(0 != main_~p8~0#1); 113427#L172-1 assume !(0 != main_~p9~0#1); 113428#L177-1 assume !(0 != main_~p10~0#1); 113669#L182-1 assume !(0 != main_~p11~0#1); 113664#L187-1 assume !(0 != main_~p12~0#1); 113661#L192-1 assume !(0 != main_~p13~0#1); 112640#L197-1 [2021-12-15 17:07:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-12-15 17:07:01,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808099867] [2021-12-15 17:07:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,900 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2021-12-15 17:07:01,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777558023] [2021-12-15 17:07:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:01,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:01,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777558023] [2021-12-15 17:07:01,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777558023] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:01,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:01,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:07:01,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809543057] [2021-12-15 17:07:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:01,915 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:01,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:01,916 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-12-15 17:07:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:02,197 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2021-12-15 17:07:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:02,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2021-12-15 17:07:02,626 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-12-15 17:07:02,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-12-15 17:07:02,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2021-12-15 17:07:02,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2021-12-15 17:07:02,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2021-12-15 17:07:03,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:03,096 INFO L681 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-12-15 17:07:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2021-12-15 17:07:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2021-12-15 17:07:03,683 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-12-15 17:07:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-12-15 17:07:03,985 INFO L704 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-12-15 17:07:03,985 INFO L587 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-12-15 17:07:03,985 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:07:03,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2021-12-15 17:07:04,174 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-12-15 17:07:04,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:04,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:04,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:04,176 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-12-15 17:07:04,176 INFO L791 eck$LassoCheckResult]: Stem: 222245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 222217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 222218#L197-1 [2021-12-15 17:07:04,176 INFO L793 eck$LassoCheckResult]: Loop: 222218#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 223381#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 223379#L83 assume !(0 != main_~p1~0#1); 223377#L83-2 assume !(0 != main_~p2~0#1); 223376#L87-1 assume !(0 != main_~p3~0#1); 223374#L91-1 assume !(0 != main_~p4~0#1); 223372#L95-1 assume !(0 != main_~p5~0#1); 223370#L99-1 assume !(0 != main_~p6~0#1); 223368#L103-1 assume !(0 != main_~p7~0#1); 223366#L107-1 assume !(0 != main_~p8~0#1); 223364#L111-1 assume !(0 != main_~p9~0#1); 223362#L115-1 assume !(0 != main_~p10~0#1); 223360#L119-1 assume !(0 != main_~p11~0#1); 223357#L123-1 assume !(0 != main_~p12~0#1); 223358#L127-1 assume !(0 != main_~p13~0#1); 223341#L131-1 assume !(0 != main_~p1~0#1); 223343#L137-1 assume !(0 != main_~p2~0#1); 223327#L142-1 assume !(0 != main_~p3~0#1); 223326#L147-1 assume !(0 != main_~p4~0#1); 223309#L152-1 assume !(0 != main_~p5~0#1); 223310#L157-1 assume !(0 != main_~p6~0#1); 223291#L162-1 assume !(0 != main_~p7~0#1); 223293#L167-1 assume !(0 != main_~p8~0#1); 223278#L172-1 assume !(0 != main_~p9~0#1); 223279#L177-1 assume !(0 != main_~p10~0#1); 223267#L182-1 assume !(0 != main_~p11~0#1); 223266#L187-1 assume !(0 != main_~p12~0#1); 223382#L192-1 assume !(0 != main_~p13~0#1); 222218#L197-1 [2021-12-15 17:07:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-12-15 17:07:04,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855238633] [2021-12-15 17:07:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,179 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,181 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2021-12-15 17:07:04,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765597205] [2021-12-15 17:07:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,189 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,190 INFO L85 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2021-12-15 17:07:04,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465541023] [2021-12-15 17:07:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,379 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:855) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:07:04,382 INFO L158 Benchmark]: Toolchain (without parser) took 6738.81ms. Allocated memory was 90.2MB in the beginning and 4.9GB in the end (delta: 4.9GB). Free memory was 59.4MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 651.9MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,382 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory was 47.0MB in the beginning and 47.0MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:04,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.95ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 65.3MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.58ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 63.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:04,383 INFO L158 Benchmark]: Boogie Preprocessor took 20.80ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 62.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,384 INFO L158 Benchmark]: RCFGBuilder took 276.58ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 50.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,384 INFO L158 Benchmark]: BuchiAutomizer took 6187.24ms. Allocated memory was 90.2MB in the beginning and 4.9GB in the end (delta: 4.9GB). Free memory was 50.1MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 644.1MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,385 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory was 47.0MB in the beginning and 47.0MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.95ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 65.3MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.58ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 63.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.80ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 62.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 276.58ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 50.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6187.24ms. Allocated memory was 90.2MB in the beginning and 4.9GB in the end (delta: 4.9GB). Free memory was 50.1MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 644.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:07:04,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable