./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aa86be9eb0317030839433587db2b1c5b5e93d6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aa86be9eb0317030839433587db2b1c5b5e93d6 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:36:43,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:36:43,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:36:43,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:36:43,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:36:43,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:36:43,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:36:43,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:36:43,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:36:43,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:36:43,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:36:43,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:36:43,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:36:43,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:36:43,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:36:43,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:36:43,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:36:43,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:36:43,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:36:43,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:36:43,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:36:43,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:36:43,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:36:43,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:36:43,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:36:43,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:36:43,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:36:43,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:36:43,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:36:43,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:36:43,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:36:43,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:36:43,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:36:43,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:36:43,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:36:43,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:36:43,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:36:43,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:36:43,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:36:43,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:36:43,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:36:43,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:36:43,299 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:36:43,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:36:43,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:36:43,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:36:43,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:36:43,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:36:43,302 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:36:43,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:36:43,303 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:36:43,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:36:43,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:36:43,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:36:43,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:36:43,305 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:36:43,305 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:36:43,305 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:36:43,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:36:43,305 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:36:43,305 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:36:43,306 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:36:43,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:36:43,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:36:43,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:36:43,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:36:43,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:36:43,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:36:43,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:36:43,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:36:43,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:36:43,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9aa86be9eb0317030839433587db2b1c5b5e93d6 [2021-08-27 06:36:43,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:36:43,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:36:43,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:36:43,673 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:36:43,674 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:36:43,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-08-27 06:36:43,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d252a8339/2f920b835ea64615ae3c866b5e152099/FLAG00519726c [2021-08-27 06:36:44,212 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:36:44,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-08-27 06:36:44,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d252a8339/2f920b835ea64615ae3c866b5e152099/FLAG00519726c [2021-08-27 06:36:44,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d252a8339/2f920b835ea64615ae3c866b5e152099 [2021-08-27 06:36:44,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:36:44,238 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:36:44,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:36:44,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:36:44,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:36:44,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f7a1850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44, skipping insertion in model container [2021-08-27 06:36:44,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:36:44,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:36:44,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-08-27 06:36:44,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-08-27 06:36:44,557 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-08-27 06:36:44,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-08-27 06:36:44,559 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-08-27 06:36:44,560 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-08-27 06:36:44,560 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-08-27 06:36:44,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:36:44,575 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:36:44,615 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-08-27 06:36:44,624 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-08-27 06:36:44,629 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-08-27 06:36:44,630 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-08-27 06:36:44,631 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-08-27 06:36:44,632 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-08-27 06:36:44,638 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-08-27 06:36:44,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:36:44,666 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:36:44,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44 WrapperNode [2021-08-27 06:36:44,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:36:44,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:36:44,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:36:44,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:36:44,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:36:44,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:36:44,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:36:44,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:36:44,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (1/1) ... [2021-08-27 06:36:44,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:36:44,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:36:44,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:36:44,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:36:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:36:44,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:36:44,789 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:36:44,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:36:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:36:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:36:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:36:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:36:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:36:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:36:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:36:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:36:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:36:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:36:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:36:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:36:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:36:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:36:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:36:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:36:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:36:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:36:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:36:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:36:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:36:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:36:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:36:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:36:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:36:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:36:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:36:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:36:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:36:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:36:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:36:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:36:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:36:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:36:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:36:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:36:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:36:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:36:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:36:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:36:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:36:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:36:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:36:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:36:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:36:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:36:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:36:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:36:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:36:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:36:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:36:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:36:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:36:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:36:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:36:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:36:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:36:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:36:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:36:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:36:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:36:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:36:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:36:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:36:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:36:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:36:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:36:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:36:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:36:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:36:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:36:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:36:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:36:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:36:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:36:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:36:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:36:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:36:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:36:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:36:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:36:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:36:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:36:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:36:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:36:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:36:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:36:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:36:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:36:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:36:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:36:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:36:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:36:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:36:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:36:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:36:44,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:36:44,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:36:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:36:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:36:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:36:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:36:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:36:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:36:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:36:45,507 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:36:45,507 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-27 06:36:45,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:45 BoogieIcfgContainer [2021-08-27 06:36:45,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:36:45,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:36:45,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:36:45,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:36:45,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:36:44" (1/3) ... [2021-08-27 06:36:45,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2835f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:36:45, skipping insertion in model container [2021-08-27 06:36:45,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:44" (2/3) ... [2021-08-27 06:36:45,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2835f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:36:45, skipping insertion in model container [2021-08-27 06:36:45,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:45" (3/3) ... [2021-08-27 06:36:45,525 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-08-27 06:36:45,530 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:36:45,530 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-08-27 06:36:45,574 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:36:45,582 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:36:45,582 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-08-27 06:36:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 89 states have (on average 2.202247191011236) internal successors, (196), 166 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:36:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:36:45,612 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:45,612 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:45,613 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1463572285, now seen corresponding path program 1 times [2021-08-27 06:36:45,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:45,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332861421] [2021-08-27 06:36:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:45,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:45,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:45,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332861421] [2021-08-27 06:36:45,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332861421] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:45,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:45,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:36:45,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984489424] [2021-08-27 06:36:45,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:45,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:45,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:45,882 INFO L87 Difference]: Start difference. First operand has 171 states, 89 states have (on average 2.202247191011236) internal successors, (196), 166 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:46,263 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2021-08-27 06:36:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:46,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:36:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:46,274 INFO L225 Difference]: With dead ends: 197 [2021-08-27 06:36:46,274 INFO L226 Difference]: Without dead ends: 193 [2021-08-27 06:36:46,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-27 06:36:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2021-08-27 06:36:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 88 states have (on average 1.8977272727272727) internal successors, (167), 161 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2021-08-27 06:36:46,321 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 7 [2021-08-27 06:36:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:46,321 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2021-08-27 06:36:46,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2021-08-27 06:36:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:36:46,322 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:46,322 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:46,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:36:46,322 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1463572286, now seen corresponding path program 1 times [2021-08-27 06:36:46,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:46,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946350117] [2021-08-27 06:36:46,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:46,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:46,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:46,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946350117] [2021-08-27 06:36:46,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946350117] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:46,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:46,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:36:46,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24609849] [2021-08-27 06:36:46,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:46,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:46,448 INFO L87 Difference]: Start difference. First operand 165 states and 170 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:46,701 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2021-08-27 06:36:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:36:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:46,703 INFO L225 Difference]: With dead ends: 162 [2021-08-27 06:36:46,703 INFO L226 Difference]: Without dead ends: 162 [2021-08-27 06:36:46,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-27 06:36:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-08-27 06:36:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 158 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 167 transitions. [2021-08-27 06:36:46,711 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 167 transitions. Word has length 7 [2021-08-27 06:36:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:46,711 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 167 transitions. [2021-08-27 06:36:46,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 167 transitions. [2021-08-27 06:36:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:36:46,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:46,712 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:46,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:36:46,712 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:46,713 INFO L82 PathProgramCache]: Analyzing trace with hash 646742145, now seen corresponding path program 1 times [2021-08-27 06:36:46,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:46,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050419751] [2021-08-27 06:36:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:46,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:46,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:46,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050419751] [2021-08-27 06:36:46,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050419751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:46,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:46,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:36:46,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918760169] [2021-08-27 06:36:46,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:46,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:46,767 INFO L87 Difference]: Start difference. First operand 162 states and 167 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:47,003 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2021-08-27 06:36:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 06:36:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:47,006 INFO L225 Difference]: With dead ends: 161 [2021-08-27 06:36:47,006 INFO L226 Difference]: Without dead ends: 161 [2021-08-27 06:36:47,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-27 06:36:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2021-08-27 06:36:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 90 states have (on average 1.788888888888889) internal successors, (161), 153 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2021-08-27 06:36:47,025 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 11 [2021-08-27 06:36:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:47,028 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2021-08-27 06:36:47,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2021-08-27 06:36:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:36:47,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:47,029 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:47,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:36:47,029 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash 646742146, now seen corresponding path program 1 times [2021-08-27 06:36:47,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:47,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348547405] [2021-08-27 06:36:47,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:47,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:47,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:47,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:47,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348547405] [2021-08-27 06:36:47,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348547405] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:47,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:47,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:36:47,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670105027] [2021-08-27 06:36:47,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:47,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:47,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:47,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:47,124 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:47,430 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2021-08-27 06:36:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:47,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 06:36:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:47,432 INFO L225 Difference]: With dead ends: 174 [2021-08-27 06:36:47,432 INFO L226 Difference]: Without dead ends: 174 [2021-08-27 06:36:47,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:47,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-27 06:36:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2021-08-27 06:36:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 157 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2021-08-27 06:36:47,436 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 11 [2021-08-27 06:36:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:47,437 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2021-08-27 06:36:47,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2021-08-27 06:36:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:36:47,437 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:47,437 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:47,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:36:47,437 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash -955929302, now seen corresponding path program 1 times [2021-08-27 06:36:47,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:47,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500918527] [2021-08-27 06:36:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:47,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:47,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:47,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:47,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500918527] [2021-08-27 06:36:47,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500918527] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:47,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:47,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:36:47,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688301032] [2021-08-27 06:36:47,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:47,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:47,517 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:47,808 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2021-08-27 06:36:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:36:47,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:36:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:47,809 INFO L225 Difference]: With dead ends: 162 [2021-08-27 06:36:47,809 INFO L226 Difference]: Without dead ends: 162 [2021-08-27 06:36:47,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-27 06:36:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2021-08-27 06:36:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 144 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2021-08-27 06:36:47,813 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 17 [2021-08-27 06:36:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:47,813 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2021-08-27 06:36:47,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2021-08-27 06:36:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:36:47,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:47,814 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:47,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:36:47,815 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash -955929301, now seen corresponding path program 1 times [2021-08-27 06:36:47,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:47,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835275808] [2021-08-27 06:36:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:47,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:47,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:47,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835275808] [2021-08-27 06:36:47,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835275808] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:47,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:47,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:36:47,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586029162] [2021-08-27 06:36:47,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:47,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:47,892 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:48,206 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2021-08-27 06:36:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:36:48,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:36:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:48,207 INFO L225 Difference]: With dead ends: 187 [2021-08-27 06:36:48,207 INFO L226 Difference]: Without dead ends: 187 [2021-08-27 06:36:48,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-08-27 06:36:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2021-08-27 06:36:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.518181818181818) internal successors, (167), 154 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2021-08-27 06:36:48,211 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 17 [2021-08-27 06:36:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:48,211 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2021-08-27 06:36:48,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2021-08-27 06:36:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:36:48,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:48,212 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:48,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:36:48,213 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash 474995261, now seen corresponding path program 1 times [2021-08-27 06:36:48,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:48,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294465097] [2021-08-27 06:36:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:48,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:48,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:48,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294465097] [2021-08-27 06:36:48,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294465097] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:48,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:48,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:36:48,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700507105] [2021-08-27 06:36:48,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:48,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:48,284 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:48,559 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-08-27 06:36:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:36:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:36:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:48,562 INFO L225 Difference]: With dead ends: 201 [2021-08-27 06:36:48,562 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 06:36:48,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 06:36:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 156. [2021-08-27 06:36:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 152 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2021-08-27 06:36:48,566 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 19 [2021-08-27 06:36:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:48,566 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2021-08-27 06:36:48,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2021-08-27 06:36:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:36:48,567 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:48,567 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:48,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:36:48,567 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:48,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1838316838, now seen corresponding path program 1 times [2021-08-27 06:36:48,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:48,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327620699] [2021-08-27 06:36:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:48,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:48,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:48,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327620699] [2021-08-27 06:36:48,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327620699] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:48,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:48,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:48,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112490918] [2021-08-27 06:36:48,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:48,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:48,636 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:48,866 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2021-08-27 06:36:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:36:48,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:36:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:48,867 INFO L225 Difference]: With dead ends: 155 [2021-08-27 06:36:48,867 INFO L226 Difference]: Without dead ends: 155 [2021-08-27 06:36:48,867 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 37.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-27 06:36:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-08-27 06:36:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 151 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2021-08-27 06:36:48,877 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 20 [2021-08-27 06:36:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:48,878 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2021-08-27 06:36:48,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2021-08-27 06:36:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:36:48,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:48,878 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:48,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:36:48,879 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1838316839, now seen corresponding path program 1 times [2021-08-27 06:36:48,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:48,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77014801] [2021-08-27 06:36:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:48,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:48,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:49,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:49,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77014801] [2021-08-27 06:36:49,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77014801] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:49,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:49,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:49,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054668725] [2021-08-27 06:36:49,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:49,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:49,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:49,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:49,010 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:49,285 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-08-27 06:36:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:36:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:36:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:49,287 INFO L225 Difference]: With dead ends: 154 [2021-08-27 06:36:49,287 INFO L226 Difference]: Without dead ends: 154 [2021-08-27 06:36:49,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-27 06:36:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-08-27 06:36:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 150 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2021-08-27 06:36:49,290 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 20 [2021-08-27 06:36:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:49,290 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2021-08-27 06:36:49,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2021-08-27 06:36:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:36:49,291 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:49,291 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:49,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:36:49,291 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1329344305, now seen corresponding path program 1 times [2021-08-27 06:36:49,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:49,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405099874] [2021-08-27 06:36:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:49,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:49,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:49,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405099874] [2021-08-27 06:36:49,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405099874] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:49,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:49,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:36:49,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521374917] [2021-08-27 06:36:49,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:36:49,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:49,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:36:49,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:36:49,440 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:49,847 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2021-08-27 06:36:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:36:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:36:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:49,849 INFO L225 Difference]: With dead ends: 208 [2021-08-27 06:36:49,849 INFO L226 Difference]: Without dead ends: 208 [2021-08-27 06:36:49,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 96.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:36:49,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-27 06:36:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 159. [2021-08-27 06:36:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 155 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2021-08-27 06:36:49,853 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 22 [2021-08-27 06:36:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:49,853 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2021-08-27 06:36:49,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2021-08-27 06:36:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:36:49,854 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:49,854 INFO L512 BasicCegarLoop]: trace 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] [2021-08-27 06:36:49,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:36:49,855 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 942465896, now seen corresponding path program 1 times [2021-08-27 06:36:49,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:49,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481912305] [2021-08-27 06:36:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:49,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:49,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:49,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481912305] [2021-08-27 06:36:49,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481912305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:49,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:49,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:36:49,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877235784] [2021-08-27 06:36:49,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:36:49,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:36:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:36:49,989 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:50,380 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2021-08-27 06:36:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:36:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:36:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:50,382 INFO L225 Difference]: With dead ends: 158 [2021-08-27 06:36:50,382 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 06:36:50,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 136.9ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:36:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 06:36:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-08-27 06:36:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 154 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2021-08-27 06:36:50,385 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 24 [2021-08-27 06:36:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:50,386 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2021-08-27 06:36:50,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2021-08-27 06:36:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:36:50,386 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:50,386 INFO L512 BasicCegarLoop]: trace 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] [2021-08-27 06:36:50,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:36:50,387 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:50,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash 942465897, now seen corresponding path program 1 times [2021-08-27 06:36:50,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:50,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153288321] [2021-08-27 06:36:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:50,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:50,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:50,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153288321] [2021-08-27 06:36:50,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153288321] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:50,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:50,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:36:50,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632328269] [2021-08-27 06:36:50,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:36:50,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:36:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:36:50,555 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:51,241 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2021-08-27 06:36:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:36:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:36:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:51,243 INFO L225 Difference]: With dead ends: 176 [2021-08-27 06:36:51,243 INFO L226 Difference]: Without dead ends: 176 [2021-08-27 06:36:51,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 335.1ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:36:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-08-27 06:36:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2021-08-27 06:36:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 158 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2021-08-27 06:36:51,247 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 24 [2021-08-27 06:36:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:51,247 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2021-08-27 06:36:51,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2021-08-27 06:36:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:36:51,248 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:51,249 INFO L512 BasicCegarLoop]: trace histogram [2, 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-08-27 06:36:51,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:36:51,249 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash 470516267, now seen corresponding path program 1 times [2021-08-27 06:36:51,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:51,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972899320] [2021-08-27 06:36:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:51,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:51,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:51,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972899320] [2021-08-27 06:36:51,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972899320] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:36:51,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864360732] [2021-08-27 06:36:51,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:51,357 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:36:51,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:36:51,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:36:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 06:36:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:51,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:36:51,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:51,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:36:51,736 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:36:51,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:36:51,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:36:51,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:51,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:36:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:51,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:51,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:36:52,231 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:36:52,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 21 [2021-08-27 06:36:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:52,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864360732] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:36:52,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:36:52,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2021-08-27 06:36:52,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036088700] [2021-08-27 06:36:52,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:36:52,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:52,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:36:52,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:36:52,346 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:53,641 INFO L93 Difference]: Finished difference Result 226 states and 242 transitions. [2021-08-27 06:36:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 06:36:53,642 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:36:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:53,643 INFO L225 Difference]: With dead ends: 226 [2021-08-27 06:36:53,643 INFO L226 Difference]: Without dead ends: 226 [2021-08-27 06:36:53,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 763.9ms TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:36:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-08-27 06:36:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 169. [2021-08-27 06:36:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 131 states have (on average 1.366412213740458) internal successors, (179), 165 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2021-08-27 06:36:53,653 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 29 [2021-08-27 06:36:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:53,653 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2021-08-27 06:36:53,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2021-08-27 06:36:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:36:53,656 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:53,656 INFO L512 BasicCegarLoop]: trace 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, 1] [2021-08-27 06:36:53,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-27 06:36:53,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-27 06:36:53,863 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr53ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash 428498014, now seen corresponding path program 1 times [2021-08-27 06:36:53,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:53,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868664093] [2021-08-27 06:36:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:53,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:53,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:53,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868664093] [2021-08-27 06:36:53,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868664093] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:53,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:53,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:36:53,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492508134] [2021-08-27 06:36:53,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:53,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:53,989 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:54,251 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2021-08-27 06:36:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:36:54,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:36:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:54,252 INFO L225 Difference]: With dead ends: 173 [2021-08-27 06:36:54,252 INFO L226 Difference]: Without dead ends: 173 [2021-08-27 06:36:54,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:36:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-27 06:36:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2021-08-27 06:36:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 130 states have (on average 1.353846153846154) internal successors, (176), 164 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2021-08-27 06:36:54,256 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 29 [2021-08-27 06:36:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:54,256 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2021-08-27 06:36:54,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2021-08-27 06:36:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:36:54,257 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:54,257 INFO L512 BasicCegarLoop]: trace 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, 1, 1] [2021-08-27 06:36:54,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 06:36:54,258 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr40ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1019922444, now seen corresponding path program 1 times [2021-08-27 06:36:54,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:54,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291257853] [2021-08-27 06:36:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:54,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:54,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:54,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291257853] [2021-08-27 06:36:54,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291257853] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:54,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:54,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:54,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096032000] [2021-08-27 06:36:54,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:54,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:54,314 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:54,500 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2021-08-27 06:36:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:36:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:36:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:54,501 INFO L225 Difference]: With dead ends: 170 [2021-08-27 06:36:54,501 INFO L226 Difference]: Without dead ends: 170 [2021-08-27 06:36:54,502 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-27 06:36:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2021-08-27 06:36:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 162 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2021-08-27 06:36:54,505 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 30 [2021-08-27 06:36:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:54,506 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2021-08-27 06:36:54,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2021-08-27 06:36:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:36:54,506 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:54,507 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1] [2021-08-27 06:36:54,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:36:54,507 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1154646554, now seen corresponding path program 1 times [2021-08-27 06:36:54,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:54,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182156812] [2021-08-27 06:36:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:54,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:54,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:54,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182156812] [2021-08-27 06:36:54,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182156812] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:54,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:54,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:54,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438479942] [2021-08-27 06:36:54,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:54,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:54,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:54,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:54,584 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:54,833 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2021-08-27 06:36:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:36:54,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 06:36:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:54,834 INFO L225 Difference]: With dead ends: 165 [2021-08-27 06:36:54,834 INFO L226 Difference]: Without dead ends: 165 [2021-08-27 06:36:54,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-27 06:36:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-08-27 06:36:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 161 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2021-08-27 06:36:54,838 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 32 [2021-08-27 06:36:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:54,839 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2021-08-27 06:36:54,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2021-08-27 06:36:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:36:54,840 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:54,840 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1] [2021-08-27 06:36:54,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 06:36:54,840 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1154646553, now seen corresponding path program 1 times [2021-08-27 06:36:54,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:54,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853197190] [2021-08-27 06:36:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:54,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:54,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:54,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853197190] [2021-08-27 06:36:54,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853197190] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:54,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:54,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:54,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293813880] [2021-08-27 06:36:54,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:54,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:54,907 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:55,121 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2021-08-27 06:36:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:36:55,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 06:36:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:55,123 INFO L225 Difference]: With dead ends: 164 [2021-08-27 06:36:55,123 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 06:36:55,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 06:36:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-08-27 06:36:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 160 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2021-08-27 06:36:55,127 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 32 [2021-08-27 06:36:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:55,127 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2021-08-27 06:36:55,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2021-08-27 06:36:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:36:55,128 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:55,128 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1] [2021-08-27 06:36:55,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 06:36:55,129 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1914894277, now seen corresponding path program 1 times [2021-08-27 06:36:55,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:55,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098853681] [2021-08-27 06:36:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:55,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:55,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:55,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:55,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098853681] [2021-08-27 06:36:55,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098853681] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:55,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:55,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:55,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996634289] [2021-08-27 06:36:55,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:55,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:55,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:55,209 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:55,412 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2021-08-27 06:36:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:36:55,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-08-27 06:36:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:55,414 INFO L225 Difference]: With dead ends: 163 [2021-08-27 06:36:55,414 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 06:36:55,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 06:36:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2021-08-27 06:36:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.3125) internal successors, (168), 158 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2021-08-27 06:36:55,418 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 33 [2021-08-27 06:36:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:55,418 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2021-08-27 06:36:55,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2021-08-27 06:36:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:36:55,419 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:55,419 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:55,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 06:36:55,419 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr74ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1259434580, now seen corresponding path program 1 times [2021-08-27 06:36:55,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:55,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793388453] [2021-08-27 06:36:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:55,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:36:55,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:55,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793388453] [2021-08-27 06:36:55,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793388453] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:55,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:55,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:36:55,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617681066] [2021-08-27 06:36:55,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:55,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:55,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:55,471 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:55,623 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2021-08-27 06:36:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:55,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 06:36:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:55,625 INFO L225 Difference]: With dead ends: 164 [2021-08-27 06:36:55,625 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 06:36:55,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 06:36:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-08-27 06:36:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 160 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2021-08-27 06:36:55,629 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 35 [2021-08-27 06:36:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:55,629 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2021-08-27 06:36:55,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2021-08-27 06:36:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:36:55,630 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:55,630 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:55,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 06:36:55,630 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1967527785, now seen corresponding path program 1 times [2021-08-27 06:36:55,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:55,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283296854] [2021-08-27 06:36:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:55,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:55,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:55,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:55,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283296854] [2021-08-27 06:36:55,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283296854] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:55,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:55,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 06:36:55,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006770468] [2021-08-27 06:36:55,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:36:55,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:55,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:36:55,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:36:55,794 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:56,436 INFO L93 Difference]: Finished difference Result 202 states and 211 transitions. [2021-08-27 06:36:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 06:36:56,437 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 06:36:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:56,438 INFO L225 Difference]: With dead ends: 202 [2021-08-27 06:36:56,438 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 06:36:56,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 326.8ms TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:36:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 06:36:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2021-08-27 06:36:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.3) internal successors, (169), 160 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2021-08-27 06:36:56,442 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 35 [2021-08-27 06:36:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:56,442 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2021-08-27 06:36:56,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2021-08-27 06:36:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:36:56,443 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:56,443 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:56,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 06:36:56,444 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1254504805, now seen corresponding path program 1 times [2021-08-27 06:36:56,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:56,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301971380] [2021-08-27 06:36:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:56,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:56,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:56,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301971380] [2021-08-27 06:36:56,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301971380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:56,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:56,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:36:56,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590666541] [2021-08-27 06:36:56,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:36:56,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:56,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:36:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:36:56,553 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:56,893 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2021-08-27 06:36:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:36:56,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 06:36:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:56,894 INFO L225 Difference]: With dead ends: 164 [2021-08-27 06:36:56,894 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 06:36:56,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 108.2ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:36:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 06:36:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2021-08-27 06:36:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.2923076923076924) internal successors, (168), 159 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2021-08-27 06:36:56,898 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 36 [2021-08-27 06:36:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:56,898 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2021-08-27 06:36:56,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2021-08-27 06:36:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:36:56,899 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:56,899 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:56,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 06:36:56,899 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1254504804, now seen corresponding path program 1 times [2021-08-27 06:36:56,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:56,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650193383] [2021-08-27 06:36:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:56,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:57,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:57,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:57,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650193383] [2021-08-27 06:36:57,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650193383] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:57,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:57,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:36:57,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961762232] [2021-08-27 06:36:57,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:36:57,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:36:57,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:36:57,048 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:57,455 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2021-08-27 06:36:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:36:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 06:36:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:57,457 INFO L225 Difference]: With dead ends: 159 [2021-08-27 06:36:57,457 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 06:36:57,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 141.5ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:36:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 06:36:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2021-08-27 06:36:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.2479338842975207) internal successors, (151), 143 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2021-08-27 06:36:57,461 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 36 [2021-08-27 06:36:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:57,461 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2021-08-27 06:36:57,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2021-08-27 06:36:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:36:57,462 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:57,462 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:57,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 06:36:57,463 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2131891079, now seen corresponding path program 1 times [2021-08-27 06:36:57,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:57,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612762130] [2021-08-27 06:36:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:57,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:57,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:57,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612762130] [2021-08-27 06:36:57,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612762130] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:36:57,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663730265] [2021-08-27 06:36:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:57,559 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:36:57,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:36:57,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:36:57,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 06:36:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:36:57,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:57,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:36:57,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 06:36:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:36:57,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663730265] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:57,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:36:57,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2021-08-27 06:36:57,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523680021] [2021-08-27 06:36:57,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:57,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:36:57,901 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:57,982 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2021-08-27 06:36:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-08-27 06:36:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:57,983 INFO L225 Difference]: With dead ends: 156 [2021-08-27 06:36:57,984 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 06:36:57,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:36:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 06:36:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2021-08-27 06:36:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.2419354838709677) internal successors, (154), 146 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2021-08-27 06:36:57,987 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 37 [2021-08-27 06:36:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:57,987 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2021-08-27 06:36:57,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2021-08-27 06:36:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:36:57,988 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:57,988 INFO L512 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:58,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:58,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-27 06:36:58,205 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1019054532, now seen corresponding path program 1 times [2021-08-27 06:36:58,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:58,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331198520] [2021-08-27 06:36:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:58,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:58,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:58,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:58,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331198520] [2021-08-27 06:36:58,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331198520] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:36:58,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046526500] [2021-08-27 06:36:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:58,387 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:36:58,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:36:58,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:36:58,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 06:36:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:58,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:36:58,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:58,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:36:58,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:36:58,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-08-27 06:36:58,698 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:36:58,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2021-08-27 06:36:58,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-08-27 06:36:58,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:58,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:58,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-08-27 06:36:58,780 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:36:58,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:36:58,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:58,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:58,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:58,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:36:59,105 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:36:59,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-08-27 06:36:59,114 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:36:59,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-08-27 06:36:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:36:59,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046526500] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:36:59,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:36:59,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-08-27 06:36:59,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013902863] [2021-08-27 06:36:59,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:36:59,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:59,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:36:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:36:59,158 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:59,516 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2021-08-27 06:36:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:36:59,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:36:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:59,517 INFO L225 Difference]: With dead ends: 160 [2021-08-27 06:36:59,517 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 06:36:59,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 138.5ms TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:36:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 06:36:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2021-08-27 06:36:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 152 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2021-08-27 06:36:59,521 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 38 [2021-08-27 06:36:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:59,521 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2021-08-27 06:36:59,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2021-08-27 06:36:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 06:36:59,522 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:59,522 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:59,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:59,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:36:59,731 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr76ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:36:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1525919079, now seen corresponding path program 1 times [2021-08-27 06:36:59,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:59,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806298769] [2021-08-27 06:36:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:59,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:36:59,744 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:36:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:36:59,774 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 06:36:59,775 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:36:59,775 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr76ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:36:59,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:36:59,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:36:59,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:36:59,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:36:59,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:36:59,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:36:59,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:36:59,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:36:59,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:36:59,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:36:59,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 06:36:59,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-08-27 06:36:59,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71REQUIRES_VIOLATION [2021-08-27 06:36:59,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-08-27 06:36:59,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:59,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 06:36:59,792 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:36:59,811 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 06:36:59,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:36:59 BoogieIcfgContainer [2021-08-27 06:36:59,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:36:59,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:36:59,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:36:59,825 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:36:59,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:45" (3/4) ... [2021-08-27 06:36:59,828 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:36:59,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:36:59,828 INFO L168 Benchmark]: Toolchain (without parser) took 15590.17 ms. Allocated memory was 50.3 MB in the beginning and 207.6 MB in the end (delta: 157.3 MB). Free memory was 25.2 MB in the beginning and 139.7 MB in the end (delta: -114.5 MB). Peak memory consumption was 43.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:59,829 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 50.3 MB. Free memory is still 32.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:36:59,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.31 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 25.0 MB in the beginning and 41.2 MB in the end (delta: -16.2 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:59,829 INFO L168 Benchmark]: Boogie Preprocessor took 49.16 ms. Allocated memory is still 65.0 MB. Free memory was 41.2 MB in the beginning and 38.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:59,830 INFO L168 Benchmark]: RCFGBuilder took 796.44 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 38.0 MB in the beginning and 58.8 MB in the end (delta: -20.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:59,830 INFO L168 Benchmark]: TraceAbstraction took 14308.73 ms. Allocated memory was 79.7 MB in the beginning and 207.6 MB in the end (delta: 127.9 MB). Free memory was 58.4 MB in the beginning and 139.7 MB in the end (delta: -81.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:59,830 INFO L168 Benchmark]: Witness Printer took 3.14 ms. Allocated memory is still 207.6 MB. Free memory is still 139.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:36:59,831 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.17 ms. Allocated memory is still 50.3 MB. Free memory is still 32.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 427.31 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 25.0 MB in the beginning and 41.2 MB in the end (delta: -16.2 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.16 ms. Allocated memory is still 65.0 MB. Free memory was 41.2 MB in the beginning and 38.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 796.44 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 38.0 MB in the beginning and 58.8 MB in the end (delta: -20.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14308.73 ms. Allocated memory was 79.7 MB in the beginning and 207.6 MB in the end (delta: 127.9 MB). Free memory was 58.4 MB in the beginning and 139.7 MB in the end (delta: -81.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 16.1 GB. * Witness Printer took 3.14 ms. Allocated memory is still 207.6 MB. Free memory is still 139.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={-1:0}] [L1000] null->prev = ((void*)0) VAL [null={-1:0}] [L1001] null->colour = BLACK VAL [null={-1:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={-2:0}, null={-1:0}] [L1005] list->prev = null VAL [list={-2:0}, null={-1:0}] [L1006] list->colour = BLACK VAL [list={-2:0}, null={-1:0}] [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1042] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1045] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={-2:0}, end->next={-1:0}, list={-2:0}, null={-1:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1056] COND TRUE null != list VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1058] EXPR list->colour VAL [end={-1:0}, list={-2:0}, list->colour=1, null={-1:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={-1:0}, list={-2:0}, list->next={-1:0}, null={-1:0}] [L1067] end = list->next [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) [L1069] list = end VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1056] COND FALSE !(null != list) VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1073] return 0; VAL [\result=0, end={-1:0}, list={-1:0}, null={-1:0}] - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 174 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 14216.4ms, OverallIterations: 25, TraceHistogramMax: 2, EmptinessCheckTime: 25.0ms, AutomataDifference: 8531.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2292 SDtfs, 3018 SDslu, 4261 SDs, 0 SdLazy, 8684 SolverSat, 347 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5083.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2594.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=0, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 140.4ms AutomataMinimizationTime, 24 MinimizatonAttempts, 324 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 89.5ms SsaConstructionTime, 322.5ms SatisfiabilityAnalysisTime, 3641.5ms InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 678 ConstructedInterpolants, 3 QuantifiedInterpolants, 5275 SizeOfPredicates, 16 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 27 InterpolantComputations, 22 PerfectInterpolantSequences, 6/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:36:59,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:37:01,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:37:01,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:37:01,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:37:01,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:37:01,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:37:01,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:37:01,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:37:01,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:37:01,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:37:01,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:37:01,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:37:01,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:37:01,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:37:01,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:37:01,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:37:01,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:37:01,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:37:01,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:37:01,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:37:01,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:37:01,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:37:01,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:37:01,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:37:01,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:37:01,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:37:01,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:37:01,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:37:01,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:37:01,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:37:01,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:37:01,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:37:01,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:37:01,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:37:01,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:37:01,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:37:01,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:37:01,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:37:01,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:37:01,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:37:01,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:37:01,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:37:01,892 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:37:01,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:37:01,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:37:01,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:37:01,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:37:01,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:37:01,895 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:37:01,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:37:01,896 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:37:01,896 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:37:01,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:37:01,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:37:01,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:37:01,897 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:37:01,897 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:37:01,897 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:37:01,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:37:01,898 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:37:01,898 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:37:01,898 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:37:01,898 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:37:01,898 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:37:01,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:37:01,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:37:01,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:37:01,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:37:01,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:37:01,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:37:01,900 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:37:01,900 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:37:01,900 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:37:01,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:37:01,901 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9aa86be9eb0317030839433587db2b1c5b5e93d6 [2021-08-27 06:37:02,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:37:02,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:37:02,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:37:02,277 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:37:02,277 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:37:02,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-08-27 06:37:02,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87e03749/a005dc433f1d4fdc863e8d3231bba30c/FLAG7aa63cb8d [2021-08-27 06:37:02,860 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:37:02,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-08-27 06:37:02,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87e03749/a005dc433f1d4fdc863e8d3231bba30c/FLAG7aa63cb8d [2021-08-27 06:37:03,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87e03749/a005dc433f1d4fdc863e8d3231bba30c [2021-08-27 06:37:03,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:37:03,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:37:03,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:37:03,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:37:03,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:37:03,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49396fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03, skipping insertion in model container [2021-08-27 06:37:03,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:37:03,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:37:03,678 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-08-27 06:37:03,682 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-08-27 06:37:03,683 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-08-27 06:37:03,684 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-08-27 06:37:03,686 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-08-27 06:37:03,688 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-08-27 06:37:03,690 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-08-27 06:37:03,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:37:03,714 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:37:03,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2021-08-27 06:37:03,748 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2021-08-27 06:37:03,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2021-08-27 06:37:03,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2021-08-27 06:37:03,750 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2021-08-27 06:37:03,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-08-27 06:37:03,752 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2021-08-27 06:37:03,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:37:03,778 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:37:03,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03 WrapperNode [2021-08-27 06:37:03,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:37:03,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:37:03,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:37:03,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:37:03,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:37:03,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:37:03,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:37:03,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:37:03,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (1/1) ... [2021-08-27 06:37:03,862 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:37:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:03,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:37:03,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:37:03,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:37:03,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:37:03,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:37:03,932 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:37:03,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:37:03,932 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:37:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:37:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:37:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:37:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:37:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:37:03,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:37:03,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:37:03,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:37:03,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:37:03,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:37:03,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:37:03,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:37:03,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:37:03,951 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:37:03,952 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:37:03,952 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:37:03,952 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:37:03,952 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:37:03,952 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:37:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:37:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:37:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:37:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:37:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:37:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:37:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:37:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:37:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:37:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:37:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:37:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:37:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:37:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:37:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:37:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:37:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:37:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:37:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:37:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:37:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:37:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:37:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:37:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:37:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:37:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:37:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:37:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:37:03,961 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:37:03,962 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:37:03,962 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:37:03,962 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:37:03,962 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:37:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:37:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:37:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:37:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:37:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:37:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:37:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:37:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:37:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:37:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:37:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:37:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:37:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:37:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:37:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:37:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:37:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:37:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:37:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:37:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:37:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:37:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:37:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:37:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:37:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:37:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:37:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:37:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:37:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:37:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:37:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:37:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:37:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:37:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:37:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:37:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:37:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:37:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:37:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:37:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:37:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:37:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:37:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:37:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:37:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:37:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:37:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:37:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:37:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:37:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:37:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:37:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:37:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:37:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:37:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:37:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:37:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:37:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:37:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:37:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:37:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:37:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:37:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:37:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:37:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:37:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:37:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:37:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:37:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:37:04,917 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:37:04,917 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-27 06:37:04,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:37:04 BoogieIcfgContainer [2021-08-27 06:37:04,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:37:04,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:37:04,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:37:04,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:37:04,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:37:03" (1/3) ... [2021-08-27 06:37:04,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2035ac7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:37:04, skipping insertion in model container [2021-08-27 06:37:04,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:03" (2/3) ... [2021-08-27 06:37:04,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2035ac7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:37:04, skipping insertion in model container [2021-08-27 06:37:04,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:37:04" (3/3) ... [2021-08-27 06:37:04,926 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-08-27 06:37:04,929 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:37:04,930 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-08-27 06:37:04,970 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:37:04,974 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:37:04,975 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-08-27 06:37:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 87 states have (on average 2.2298850574712645) internal successors, (194), 164 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:37:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:37:04,998 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:04,999 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:04,999 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1610416047, now seen corresponding path program 1 times [2021-08-27 06:37:05,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:05,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220600475] [2021-08-27 06:37:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:05,014 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:05,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:05,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:37:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:05,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:37:05,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:05,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:05,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:05,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:05,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220600475] [2021-08-27 06:37:05,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220600475] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:05,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:05,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:37:05,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386008676] [2021-08-27 06:37:05,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:37:05,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:37:05,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:37:05,379 INFO L87 Difference]: Start difference. First operand has 169 states, 87 states have (on average 2.2298850574712645) internal successors, (194), 164 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:05,650 INFO L93 Difference]: Finished difference Result 195 states and 202 transitions. [2021-08-27 06:37:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:37:05,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:37:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:05,659 INFO L225 Difference]: With dead ends: 195 [2021-08-27 06:37:05,660 INFO L226 Difference]: Without dead ends: 191 [2021-08-27 06:37:05,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:37:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-08-27 06:37:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 163. [2021-08-27 06:37:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 86 states have (on average 1.9186046511627908) internal successors, (165), 159 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 168 transitions. [2021-08-27 06:37:05,695 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 168 transitions. Word has length 7 [2021-08-27 06:37:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:05,695 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 168 transitions. [2021-08-27 06:37:05,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 168 transitions. [2021-08-27 06:37:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:37:05,696 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:05,696 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:05,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:05,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:05,906 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1610416046, now seen corresponding path program 1 times [2021-08-27 06:37:05,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:05,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588222569] [2021-08-27 06:37:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:05,908 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:05,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:05,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:05,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:37:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:06,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:37:06,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:06,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:06,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:06,226 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:06,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588222569] [2021-08-27 06:37:06,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588222569] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:06,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:06,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:37:06,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930941473] [2021-08-27 06:37:06,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:37:06,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:37:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:06,231 INFO L87 Difference]: Start difference. First operand 163 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:06,521 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2021-08-27 06:37:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:37:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:37:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:06,523 INFO L225 Difference]: With dead ends: 160 [2021-08-27 06:37:06,523 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 06:37:06,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 06:37:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-08-27 06:37:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 86 states have (on average 1.8837209302325582) internal successors, (162), 156 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 165 transitions. [2021-08-27 06:37:06,531 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 165 transitions. Word has length 7 [2021-08-27 06:37:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:06,532 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 165 transitions. [2021-08-27 06:37:06,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 165 transitions. [2021-08-27 06:37:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:37:06,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:06,537 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:06,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-27 06:37:06,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:06,738 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:06,738 INFO L82 PathProgramCache]: Analyzing trace with hash -352660203, now seen corresponding path program 1 times [2021-08-27 06:37:06,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:06,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866866318] [2021-08-27 06:37:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:06,740 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:06,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:06,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:37:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:06,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:37:06,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:06,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:06,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:06,984 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:06,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866866318] [2021-08-27 06:37:06,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866866318] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:06,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:06,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:37:06,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770645706] [2021-08-27 06:37:06,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:37:06,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:37:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:37:06,989 INFO L87 Difference]: Start difference. First operand 160 states and 165 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:07,211 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2021-08-27 06:37:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:37:07,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 06:37:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:07,213 INFO L225 Difference]: With dead ends: 159 [2021-08-27 06:37:07,213 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 06:37:07,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:37:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 06:37:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2021-08-27 06:37:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 88 states have (on average 1.8068181818181819) internal successors, (159), 151 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2021-08-27 06:37:07,222 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 11 [2021-08-27 06:37:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:07,222 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2021-08-27 06:37:07,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2021-08-27 06:37:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:37:07,223 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:07,223 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:07,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:07,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:07,434 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:07,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash -352660202, now seen corresponding path program 1 times [2021-08-27 06:37:07,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:07,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180807469] [2021-08-27 06:37:07,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:07,435 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:07,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:07,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:37:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:07,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:37:07,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:07,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:07,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:07,755 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:07,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180807469] [2021-08-27 06:37:07,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180807469] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:07,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:07,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:37:07,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631664516] [2021-08-27 06:37:07,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:37:07,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:07,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:37:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:07,757 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:08,067 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2021-08-27 06:37:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:37:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 06:37:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:08,069 INFO L225 Difference]: With dead ends: 172 [2021-08-27 06:37:08,069 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 06:37:08,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 06:37:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2021-08-27 06:37:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 95 states have (on average 1.7157894736842105) internal successors, (163), 155 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2021-08-27 06:37:08,076 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 11 [2021-08-27 06:37:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:08,076 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2021-08-27 06:37:08,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2021-08-27 06:37:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:37:08,076 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:08,077 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:08,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:08,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:08,285 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2117333470, now seen corresponding path program 1 times [2021-08-27 06:37:08,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:08,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742192653] [2021-08-27 06:37:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:08,286 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:08,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:08,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:37:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:08,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:37:08,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:08,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:08,573 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:37:08,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2021-08-27 06:37:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:08,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:08,689 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:08,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742192653] [2021-08-27 06:37:08,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742192653] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:08,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:08,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:37:08,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383654938] [2021-08-27 06:37:08,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:37:08,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:37:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:08,693 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:09,032 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2021-08-27 06:37:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:37:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:37:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:09,034 INFO L225 Difference]: With dead ends: 160 [2021-08-27 06:37:09,034 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 06:37:09,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 06:37:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-08-27 06:37:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 142 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2021-08-27 06:37:09,041 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 16 [2021-08-27 06:37:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:09,042 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2021-08-27 06:37:09,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2021-08-27 06:37:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:37:09,042 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:09,042 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:09,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:09,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:09,252 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2117333471, now seen corresponding path program 1 times [2021-08-27 06:37:09,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:09,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009780447] [2021-08-27 06:37:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:09,253 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:09,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:09,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:37:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:09,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:37:09,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:09,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:09,576 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:37:09,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:37:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:09,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:09,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:09,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009780447] [2021-08-27 06:37:09,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009780447] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:09,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:09,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-08-27 06:37:09,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674946000] [2021-08-27 06:37:09,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:37:09,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:37:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:37:09,876 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:10,955 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2021-08-27 06:37:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:37:10,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:37:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:10,957 INFO L225 Difference]: With dead ends: 193 [2021-08-27 06:37:10,957 INFO L226 Difference]: Without dead ends: 193 [2021-08-27 06:37:10,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 202.5ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:37:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-27 06:37:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 145. [2021-08-27 06:37:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 141 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2021-08-27 06:37:10,962 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 16 [2021-08-27 06:37:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:10,962 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2021-08-27 06:37:10,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2021-08-27 06:37:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:37:10,963 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:10,963 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:11,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:11,172 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1056980816, now seen corresponding path program 1 times [2021-08-27 06:37:11,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:11,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848880061] [2021-08-27 06:37:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:11,173 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:11,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:11,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:11,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:37:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:11,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:37:11,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:11,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:11,410 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:11,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-08-27 06:37:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:11,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:11,553 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:11,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848880061] [2021-08-27 06:37:11,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848880061] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:11,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:11,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:37:11,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893348575] [2021-08-27 06:37:11,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:37:11,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:37:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:11,555 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:11,884 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2021-08-27 06:37:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:37:11,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:37:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:11,886 INFO L225 Difference]: With dead ends: 193 [2021-08-27 06:37:11,886 INFO L226 Difference]: Without dead ends: 193 [2021-08-27 06:37:11,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:37:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-27 06:37:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2021-08-27 06:37:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 139 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2021-08-27 06:37:11,890 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 18 [2021-08-27 06:37:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:11,891 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2021-08-27 06:37:11,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2021-08-27 06:37:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:37:11,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:11,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:11,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:12,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:12,101 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1591729511, now seen corresponding path program 1 times [2021-08-27 06:37:12,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:12,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555183211] [2021-08-27 06:37:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:12,102 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:12,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:12,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:37:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:12,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:37:12,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:12,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:12,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-08-27 06:37:12,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:37:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:12,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:12,453 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:12,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555183211] [2021-08-27 06:37:12,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555183211] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:12,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:12,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:37:12,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555421877] [2021-08-27 06:37:12,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:37:12,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:37:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:12,456 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:12,782 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2021-08-27 06:37:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:37:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:37:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:12,784 INFO L225 Difference]: With dead ends: 142 [2021-08-27 06:37:12,784 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 06:37:12,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 40.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:37:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 06:37:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-08-27 06:37:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 138 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2021-08-27 06:37:12,787 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2021-08-27 06:37:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:12,787 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2021-08-27 06:37:12,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2021-08-27 06:37:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:37:12,788 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:12,788 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:12,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:12,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:12,993 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1591729512, now seen corresponding path program 1 times [2021-08-27 06:37:12,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:12,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495021155] [2021-08-27 06:37:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:12,994 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:12,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:12,996 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:12,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:37:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:13,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:37:13,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:13,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:13,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:37:13,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-08-27 06:37:13,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-08-27 06:37:13,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-08-27 06:37:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:13,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:13,517 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:13,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495021155] [2021-08-27 06:37:13,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495021155] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:13,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:13,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:37:13,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747624780] [2021-08-27 06:37:13,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:37:13,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:13,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:37:13,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:37:13,519 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:14,352 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2021-08-27 06:37:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:37:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:37:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:14,353 INFO L225 Difference]: With dead ends: 141 [2021-08-27 06:37:14,353 INFO L226 Difference]: Without dead ends: 141 [2021-08-27 06:37:14,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 194.8ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:37:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-27 06:37:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-08-27 06:37:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 137 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2021-08-27 06:37:14,357 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2021-08-27 06:37:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:14,357 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2021-08-27 06:37:14,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2021-08-27 06:37:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:37:14,358 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:14,358 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:14,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:14,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:14,558 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2106147056, now seen corresponding path program 1 times [2021-08-27 06:37:14,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:14,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439687238] [2021-08-27 06:37:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:14,559 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:14,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:14,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:14,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:37:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:14,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:37:14,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:14,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:37:14,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 06:37:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:14,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:15,014 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:15,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439687238] [2021-08-27 06:37:15,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439687238] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:15,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:15,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2021-08-27 06:37:15,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598023974] [2021-08-27 06:37:15,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:37:15,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:37:15,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:37:15,016 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:15,410 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2021-08-27 06:37:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:37:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 06:37:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:15,412 INFO L225 Difference]: With dead ends: 198 [2021-08-27 06:37:15,412 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 06:37:15,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 77.2ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:37:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 06:37:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 146. [2021-08-27 06:37:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 142 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2021-08-27 06:37:15,415 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 21 [2021-08-27 06:37:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:15,415 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2021-08-27 06:37:15,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2021-08-27 06:37:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:37:15,416 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:15,416 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:15,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:15,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:15,626 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:15,626 INFO L82 PathProgramCache]: Analyzing trace with hash 124262505, now seen corresponding path program 1 times [2021-08-27 06:37:15,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:15,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673215386] [2021-08-27 06:37:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:15,627 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:15,628 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:15,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:37:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:15,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:37:15,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:15,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:15,961 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:37:15,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2021-08-27 06:37:16,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-08-27 06:37:16,159 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:16,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2021-08-27 06:37:16,256 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:16,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 43 [2021-08-27 06:37:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:16,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:17,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:37:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:19,315 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:19,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673215386] [2021-08-27 06:37:19,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673215386] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:19,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:19,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-08-27 06:37:19,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770896588] [2021-08-27 06:37:19,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:37:19,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:37:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2021-08-27 06:37:19,317 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:20,508 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2021-08-27 06:37:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:37:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:37:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:20,512 INFO L225 Difference]: With dead ends: 176 [2021-08-27 06:37:20,512 INFO L226 Difference]: Without dead ends: 176 [2021-08-27 06:37:20,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3263.4ms TimeCoverageRelationStatistics Valid=132, Invalid=333, Unknown=1, NotChecked=40, Total=506 [2021-08-27 06:37:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-08-27 06:37:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2021-08-27 06:37:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 141 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2021-08-27 06:37:20,516 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 23 [2021-08-27 06:37:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:20,516 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2021-08-27 06:37:20,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2021-08-27 06:37:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:37:20,517 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:20,517 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:20,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:20,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:20,725 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:37:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:20,725 INFO L82 PathProgramCache]: Analyzing trace with hash 124262506, now seen corresponding path program 1 times [2021-08-27 06:37:20,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:20,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206406957] [2021-08-27 06:37:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:20,726 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:20,738 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:20,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:37:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:21,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:37:21,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:21,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:21,093 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:21,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-08-27 06:37:21,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:21,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:37:21,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-08-27 06:37:21,235 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:21,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:37:21,253 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:37:21,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:37:21,356 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:21,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-08-27 06:37:21,364 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:21,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-08-27 06:37:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:21,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:36,008 WARN L207 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 26 [2021-08-27 06:37:45,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:37:45,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:37:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:45,620 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:45,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206406957] [2021-08-27 06:37:45,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206406957] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:45,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:45,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-08-27 06:37:45,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057626907] [2021-08-27 06:37:45,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:37:45,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:45,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:37:45,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=194, Unknown=3, NotChecked=0, Total=240 [2021-08-27 06:37:45,621 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:00,797 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 32) c_main_~end~0.offset) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) c_main_~end~0.offset)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (exists ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse2 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (and (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) c_main_~end~0.offset)))) (= (_ bv12 32) (select |c_#length| c_main_~end~0.base)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| c_main_~list~0.base)) (_ bv1 1))) (= (select |c_#length| .cse4) (_ bv12 32)) (not (= .cse4 c_main_~end~0.base)))) is different from false [2021-08-27 06:38:09,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 32) c_main_~end~0.offset) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) c_main_~end~0.offset)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) .cse0 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (exists ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse2 (bvadd (_ bv4 32) |main_#t~mem7.offset|))) (and (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) c_main_~end~0.offset)))) (= (_ bv12 32) (select |c_#length| c_main_~end~0.base)) (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (= (select |c_#length| .cse4) (_ bv12 32)) (not (= .cse4 c_main_~end~0.base)))) is different from false [2021-08-27 06:38:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:21,596 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2021-08-27 06:38:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-27 06:38:21,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:38:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:21,598 INFO L225 Difference]: With dead ends: 278 [2021-08-27 06:38:21,598 INFO L226 Difference]: Without dead ends: 278 [2021-08-27 06:38:21,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 56277.3ms TimeCoverageRelationStatistics Valid=503, Invalid=1750, Unknown=11, NotChecked=186, Total=2450 [2021-08-27 06:38:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-27 06:38:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 140. [2021-08-27 06:38:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 136 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2021-08-27 06:38:21,602 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 23 [2021-08-27 06:38:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:21,603 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2021-08-27 06:38:21,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2021-08-27 06:38:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:38:21,604 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:21,604 INFO L512 BasicCegarLoop]: trace 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-08-27 06:38:21,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:21,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:21,813 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr53ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1488771985, now seen corresponding path program 1 times [2021-08-27 06:38:21,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:21,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955385931] [2021-08-27 06:38:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:21,814 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:21,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:21,814 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:21,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:38:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:22,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:38:22,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:22,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:38:22,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 06:38:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:22,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:22,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:22,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955385931] [2021-08-27 06:38:22,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955385931] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:22,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:22,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2021-08-27 06:38:22,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5114017] [2021-08-27 06:38:22,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:38:22,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:38:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:38:22,380 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:22,992 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2021-08-27 06:38:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:38:22,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:38:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:22,993 INFO L225 Difference]: With dead ends: 191 [2021-08-27 06:38:22,993 INFO L226 Difference]: Without dead ends: 191 [2021-08-27 06:38:22,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 104.9ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:38:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-08-27 06:38:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2021-08-27 06:38:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 140 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2021-08-27 06:38:22,997 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 28 [2021-08-27 06:38:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:22,997 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2021-08-27 06:38:22,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2021-08-27 06:38:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:38:22,998 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:22,998 INFO L512 BasicCegarLoop]: trace histogram [2, 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-08-27 06:38:23,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:23,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:23,205 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:23,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1530790238, now seen corresponding path program 1 times [2021-08-27 06:38:23,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:23,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808244640] [2021-08-27 06:38:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:23,206 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:23,207 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:23,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 06:38:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:23,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 06:38:23,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:23,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:23,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:23,606 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:38:23,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:38:23,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:23,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:38:23,689 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:38:23,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:38:23,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:23,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:23,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:23,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:38:24,020 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:38:24,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-08-27 06:38:24,026 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:38:24,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-08-27 06:38:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:24,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:24,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:24,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808244640] [2021-08-27 06:38:24,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808244640] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:38:24,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:38:24,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-08-27 06:38:24,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238046011] [2021-08-27 06:38:24,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:38:24,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:24,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:38:24,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:38:24,362 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:25,354 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2021-08-27 06:38:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:38:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:38:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:25,355 INFO L225 Difference]: With dead ends: 167 [2021-08-27 06:38:25,355 INFO L226 Difference]: Without dead ends: 167 [2021-08-27 06:38:25,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 280.0ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:38:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-08-27 06:38:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2021-08-27 06:38:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 113 states have (on average 1.345132743362832) internal successors, (152), 143 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2021-08-27 06:38:25,359 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 28 [2021-08-27 06:38:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:25,359 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2021-08-27 06:38:25,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2021-08-27 06:38:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:38:25,360 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:25,360 INFO L512 BasicCegarLoop]: trace 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-08-27 06:38:25,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:25,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:25,569 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr40ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:25,569 INFO L82 PathProgramCache]: Analyzing trace with hash 66805131, now seen corresponding path program 1 times [2021-08-27 06:38:25,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:25,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725635391] [2021-08-27 06:38:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:25,570 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:25,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:25,571 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:25,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:38:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:25,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:38:25,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:25,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:38:25,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 06:38:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:25,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:26,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:26,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725635391] [2021-08-27 06:38:26,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725635391] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:26,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:26,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:38:26,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271186122] [2021-08-27 06:38:26,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:38:26,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:26,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:38:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:38:26,042 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:26,224 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2021-08-27 06:38:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:38:26,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:38:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:26,226 INFO L225 Difference]: With dead ends: 149 [2021-08-27 06:38:26,226 INFO L226 Difference]: Without dead ends: 149 [2021-08-27 06:38:26,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:38:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-27 06:38:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2021-08-27 06:38:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 141 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2021-08-27 06:38:26,229 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 28 [2021-08-27 06:38:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:26,229 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2021-08-27 06:38:26,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2021-08-27 06:38:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:38:26,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:26,230 INFO L512 BasicCegarLoop]: trace 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, 1, 1] [2021-08-27 06:38:26,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-08-27 06:38:26,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:26,440 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 36943448, now seen corresponding path program 1 times [2021-08-27 06:38:26,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:26,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601273128] [2021-08-27 06:38:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:26,441 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:26,442 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:26,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 06:38:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:26,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:38:26,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:26,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:26,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-08-27 06:38:26,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:38:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:26,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:26,999 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:26,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601273128] [2021-08-27 06:38:26,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601273128] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:26,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:27,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:38:27,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225584540] [2021-08-27 06:38:27,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:38:27,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:38:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:38:27,001 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:27,427 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2021-08-27 06:38:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:38:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:38:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:27,428 INFO L225 Difference]: With dead ends: 144 [2021-08-27 06:38:27,428 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 06:38:27,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:38:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 06:38:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-08-27 06:38:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 140 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2021-08-27 06:38:27,431 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 30 [2021-08-27 06:38:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:27,431 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2021-08-27 06:38:27,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2021-08-27 06:38:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:38:27,432 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:27,432 INFO L512 BasicCegarLoop]: trace 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, 1, 1] [2021-08-27 06:38:27,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:27,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:27,633 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 36943449, now seen corresponding path program 1 times [2021-08-27 06:38:27,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:27,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338007802] [2021-08-27 06:38:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:27,634 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:27,634 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:27,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 06:38:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:28,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:38:28,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:28,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:28,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:28,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-08-27 06:38:28,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-08-27 06:38:28,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-08-27 06:38:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:28,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:28,404 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:28,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338007802] [2021-08-27 06:38:28,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338007802] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:28,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:28,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:38:28,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940709836] [2021-08-27 06:38:28,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:38:28,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:38:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:38:28,406 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:29,173 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2021-08-27 06:38:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:38:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:38:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:29,174 INFO L225 Difference]: With dead ends: 143 [2021-08-27 06:38:29,175 INFO L226 Difference]: Without dead ends: 143 [2021-08-27 06:38:29,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 191.9ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:38:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-27 06:38:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-08-27 06:38:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 139 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2021-08-27 06:38:29,177 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 30 [2021-08-27 06:38:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:29,178 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2021-08-27 06:38:29,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2021-08-27 06:38:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:38:29,178 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:29,178 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1] [2021-08-27 06:38:29,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-08-27 06:38:29,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:29,389 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1625836410, now seen corresponding path program 1 times [2021-08-27 06:38:29,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:29,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624968350] [2021-08-27 06:38:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:29,390 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:29,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:29,391 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:29,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 06:38:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:29,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:38:29,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:29,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:29,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:30,001 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:38:30,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-08-27 06:38:30,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:30,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-08-27 06:38:30,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 06:38:30,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 06:38:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:30,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:30,298 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:30,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624968350] [2021-08-27 06:38:30,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624968350] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:30,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:30,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-08-27 06:38:30,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374853146] [2021-08-27 06:38:30,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:38:30,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:38:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:38:30,303 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:30,742 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2021-08-27 06:38:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:38:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:38:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:30,743 INFO L225 Difference]: With dead ends: 142 [2021-08-27 06:38:30,743 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 06:38:30,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:38:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 06:38:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2021-08-27 06:38:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 137 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2021-08-27 06:38:30,746 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 31 [2021-08-27 06:38:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:30,747 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2021-08-27 06:38:30,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2021-08-27 06:38:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:38:30,748 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:30,748 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1] [2021-08-27 06:38:30,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:30,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:30,959 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash -939174818, now seen corresponding path program 1 times [2021-08-27 06:38:30,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:30,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588276000] [2021-08-27 06:38:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:30,960 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:30,961 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:30,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 06:38:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:31,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:38:31,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:31,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:31,464 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:38:31,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-08-27 06:38:31,601 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-27 06:38:31,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2021-08-27 06:38:31,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-08-27 06:38:31,703 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:31,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-08-27 06:38:31,773 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:31,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2021-08-27 06:38:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:31,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:33,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (not (= c_main_~null~0.base (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset)))) is different from false [2021-08-27 06:38:34,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base))) c_main_~end~0.base) c_main_~end~0.offset) c_main_~null~0.base))) is different from false [2021-08-27 06:38:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:34,504 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:34,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588276000] [2021-08-27 06:38:34,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588276000] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:34,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:34,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 15 [2021-08-27 06:38:34,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680304215] [2021-08-27 06:38:34,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:38:34,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:38:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=127, Unknown=2, NotChecked=46, Total=210 [2021-08-27 06:38:34,505 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:36,962 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2021-08-27 06:38:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 06:38:36,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-08-27 06:38:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:36,963 INFO L225 Difference]: With dead ends: 163 [2021-08-27 06:38:36,963 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 06:38:36,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 4323.7ms TimeCoverageRelationStatistics Valid=236, Invalid=640, Unknown=2, NotChecked=114, Total=992 [2021-08-27 06:38:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 06:38:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2021-08-27 06:38:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 143 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2021-08-27 06:38:36,966 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 33 [2021-08-27 06:38:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:36,967 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2021-08-27 06:38:36,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2021-08-27 06:38:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 06:38:36,968 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:36,968 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:36,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:37,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:37,179 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:37,179 INFO L82 PathProgramCache]: Analyzing trace with hash 703031177, now seen corresponding path program 1 times [2021-08-27 06:38:37,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:37,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850207905] [2021-08-27 06:38:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:37,180 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:37,180 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:37,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-27 06:38:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:37,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:38:37,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:37,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:38:37,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 06:38:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:38:37,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:38:37,838 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:37,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850207905] [2021-08-27 06:38:37,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850207905] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:37,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:37,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-27 06:38:37,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985316170] [2021-08-27 06:38:37,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:38:37,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:38:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:38:37,839 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:38,007 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2021-08-27 06:38:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:38:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-08-27 06:38:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:38,008 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:38:38,008 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:38:38,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:38:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:38:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2021-08-27 06:38:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 146 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2021-08-27 06:38:38,012 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 34 [2021-08-27 06:38:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:38,012 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2021-08-27 06:38:38,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2021-08-27 06:38:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 06:38:38,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:38,012 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:38,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-08-27 06:38:38,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:38,221 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr74ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:38,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash 724025887, now seen corresponding path program 1 times [2021-08-27 06:38:38,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:38,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295836711] [2021-08-27 06:38:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:38,222 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:38,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:38,223 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:38,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-27 06:38:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:38,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:38:38,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:38:38,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:38:38,863 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:38,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295836711] [2021-08-27 06:38:38,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295836711] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:38,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:38,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:38:38,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739728127] [2021-08-27 06:38:38,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:38:38,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:38:38,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:38:38,864 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:38,944 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2021-08-27 06:38:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:38:38,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-08-27 06:38:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:38,945 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:38:38,945 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 06:38:38,946 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:38:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 06:38:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-08-27 06:38:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 148 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2021-08-27 06:38:38,949 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 34 [2021-08-27 06:38:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:38,949 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2021-08-27 06:38:38,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2021-08-27 06:38:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 06:38:38,950 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:38,950 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:38,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:39,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:39,150 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1167972262, now seen corresponding path program 1 times [2021-08-27 06:38:39,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:39,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767958381] [2021-08-27 06:38:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:39,151 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:39,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:39,153 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:39,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-27 06:38:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:39,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:38:39,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:39,789 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:38:39,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-08-27 06:38:39,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-08-27 06:38:39,948 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:39,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2021-08-27 06:38:40,031 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:40,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 46 [2021-08-27 06:38:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:40,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:41,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem11.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem11.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem11.base|) (bvadd |main_#t~mem11.offset| (_ bv4 32)) c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset)))))))) (_ bv1 1)))) is different from false [2021-08-27 06:38:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:41,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:41,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767958381] [2021-08-27 06:38:41,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767958381] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:41,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:41,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2021-08-27 06:38:41,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613528785] [2021-08-27 06:38:41,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:38:41,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:41,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:38:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=96, Unknown=1, NotChecked=20, Total=156 [2021-08-27 06:38:41,373 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:42,432 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2021-08-27 06:38:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:38:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-08-27 06:38:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:42,433 INFO L225 Difference]: With dead ends: 161 [2021-08-27 06:38:42,433 INFO L226 Difference]: Without dead ends: 161 [2021-08-27 06:38:42,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1387.1ms TimeCoverageRelationStatistics Valid=64, Invalid=149, Unknown=1, NotChecked=26, Total=240 [2021-08-27 06:38:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-27 06:38:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2021-08-27 06:38:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 122 states have (on average 1.278688524590164) internal successors, (156), 147 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2021-08-27 06:38:42,436 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 34 [2021-08-27 06:38:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:42,436 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2021-08-27 06:38:42,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2021-08-27 06:38:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 06:38:42,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:42,436 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:42,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:42,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:42,637 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:38:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1167972261, now seen corresponding path program 1 times [2021-08-27 06:38:42,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:42,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274292814] [2021-08-27 06:38:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:42,638 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:42,639 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:42,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-27 06:38:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:43,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 06:38:43,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:43,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:43,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:43,405 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:38:43,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2021-08-27 06:38:43,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-08-27 06:38:43,583 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:43,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-08-27 06:38:43,682 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:43,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 56 [2021-08-27 06:38:43,937 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:38:43,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:38:43,959 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-27 06:38:43,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58 [2021-08-27 06:38:44,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:44,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-08-27 06:38:44,150 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:44,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:38:44,165 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:38:44,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:38:44,263 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:44,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 47 [2021-08-27 06:38:44,273 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:44,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2021-08-27 06:38:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:44,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:59,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:39:00,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem7.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |main_#t~mem7.offset|) c_main_~end~0.base))) c_main_~end~0.base) c_main_~end~0.offset))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:39:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:00,337 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:00,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274292814] [2021-08-27 06:39:00,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274292814] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:00,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:00,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [] total 26 [2021-08-27 06:39:00,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22351056] [2021-08-27 06:39:00,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-27 06:39:00,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:00,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-27 06:39:00,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=527, Unknown=4, NotChecked=94, Total=702 [2021-08-27 06:39:00,339 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:18,453 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2021-08-27 06:39:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-27 06:39:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-08-27 06:39:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:18,454 INFO L225 Difference]: With dead ends: 179 [2021-08-27 06:39:18,454 INFO L226 Difference]: Without dead ends: 179 [2021-08-27 06:39:18,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 29888.4ms TimeCoverageRelationStatistics Valid=672, Invalid=2991, Unknown=5, NotChecked=238, Total=3906 [2021-08-27 06:39:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-27 06:39:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 148. [2021-08-27 06:39:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 144 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2021-08-27 06:39:18,458 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 34 [2021-08-27 06:39:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:18,458 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2021-08-27 06:39:18,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2021-08-27 06:39:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:39:18,459 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:18,459 INFO L512 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:18,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-08-27 06:39:18,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:18,672 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr60REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:39:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash 129788422, now seen corresponding path program 1 times [2021-08-27 06:39:18,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:18,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540053998] [2021-08-27 06:39:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:18,673 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:18,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:18,674 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:18,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-27 06:39:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:19,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:39:19,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:19,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 06:39:19,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 06:39:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:19,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:19,938 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-08-27 06:39:19,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-08-27 06:39:19,944 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-08-27 06:39:19,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-08-27 06:39:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:20,066 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:20,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540053998] [2021-08-27 06:39:20,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540053998] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:39:20,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:39:20,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-08-27 06:39:20,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256038158] [2021-08-27 06:39:20,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 06:39:20,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:20,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 06:39:20,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:39:20,069 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:21,452 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2021-08-27 06:39:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:39:21,452 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-08-27 06:39:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:21,453 INFO L225 Difference]: With dead ends: 200 [2021-08-27 06:39:21,453 INFO L226 Difference]: Without dead ends: 200 [2021-08-27 06:39:21,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 419.1ms TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:39:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-27 06:39:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 159. [2021-08-27 06:39:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 155 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2021-08-27 06:39:21,456 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 37 [2021-08-27 06:39:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:21,456 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2021-08-27 06:39:21,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2021-08-27 06:39:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:39:21,457 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:21,457 INFO L512 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:21,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:21,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:21,668 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr76ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 72 more)] === [2021-08-27 06:39:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -271526566, now seen corresponding path program 1 times [2021-08-27 06:39:21,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:21,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833376309] [2021-08-27 06:39:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:21,668 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:21,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:21,669 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:21,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-27 06:39:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:39:22,300 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:39:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:39:22,419 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-27 06:39:22,419 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:39:22,433 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr76ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:39:22,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:39:22,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:39:22,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:39:22,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:39:22,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:39:22,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:39:22,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:39:22,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:39:22,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:39:22,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:39:22,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:39:22,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:39:22,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:39:22,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:39:22,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:39:22,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:39:22,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:39:22,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:39:22,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:39:22,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:39:22,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:39:22,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:39:22,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:39:22,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:39:22,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:39:22,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:39:22,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:39:22,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 06:39:22,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 06:39:22,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-08-27 06:39:22,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 06:39:22,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-08-27 06:39:22,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-08-27 06:39:22,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71REQUIRES_VIOLATION [2021-08-27 06:39:22,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-08-27 06:39:22,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:22,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:22,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:22,664 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:39:22,675 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 06:39:22,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:39:22 BoogieIcfgContainer [2021-08-27 06:39:22,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:39:22,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:39:22,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:39:22,705 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:39:22,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:37:04" (3/4) ... [2021-08-27 06:39:22,708 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:39:22,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:39:22,709 INFO L168 Benchmark]: Toolchain (without parser) took 139392.03 ms. Allocated memory was 56.6 MB in the beginning and 161.5 MB in the end (delta: 104.9 MB). Free memory was 34.3 MB in the beginning and 58.9 MB in the end (delta: -24.5 MB). Peak memory consumption was 81.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:22,710 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 38.8 MB in the end (delta: 44.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:39:22,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.66 ms. Allocated memory is still 56.6 MB. Free memory was 34.2 MB in the beginning and 31.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:22,710 INFO L168 Benchmark]: Boogie Preprocessor took 74.25 ms. Allocated memory is still 56.6 MB. Free memory was 31.4 MB in the beginning and 28.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:22,710 INFO L168 Benchmark]: RCFGBuilder took 1064.80 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 28.0 MB in the beginning and 33.6 MB in the end (delta: -5.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:22,711 INFO L168 Benchmark]: TraceAbstraction took 137783.50 ms. Allocated memory was 75.5 MB in the beginning and 161.5 MB in the end (delta: 86.0 MB). Free memory was 33.2 MB in the beginning and 58.9 MB in the end (delta: -25.7 MB). Peak memory consumption was 61.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:22,711 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 161.5 MB. Free memory is still 58.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:39:22,716 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.19 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 38.8 MB in the end (delta: 44.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 460.66 ms. Allocated memory is still 56.6 MB. Free memory was 34.2 MB in the beginning and 31.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.25 ms. Allocated memory is still 56.6 MB. Free memory was 31.4 MB in the beginning and 28.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1064.80 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 28.0 MB in the beginning and 33.6 MB in the end (delta: -5.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 137783.50 ms. Allocated memory was 75.5 MB in the beginning and 161.5 MB in the end (delta: 86.0 MB). Free memory was 33.2 MB in the beginning and 58.9 MB in the end (delta: -25.7 MB). Peak memory consumption was 61.4 MB. Max. memory is 16.1 GB. * Witness Printer took 3.79 ms. Allocated memory is still 161.5 MB. Free memory is still 58.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={1:0}] [L1000] null->prev = ((void*)0) VAL [null={1:0}] [L1001] null->colour = BLACK VAL [null={1:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={2:0}, null={1:0}] [L1005] list->prev = null VAL [list={2:0}, null={1:0}] [L1006] list->colour = BLACK VAL [list={2:0}, null={1:0}] [L1008] struct TSLL* end = list; VAL [end={2:0}, list={2:0}, null={1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={2:0}, list={2:0}, null={1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={2:0}, list={2:0}, null={1:0}] [L1042] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, null={1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={2:0}, list={2:0}, null={1:0}] [L1045] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, null={1:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={2:0}, end->next={1:0}, list={2:0}, null={1:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={1:0}, list={2:0}, null={1:0}] [L1056] COND TRUE null != list VAL [end={1:0}, list={2:0}, null={1:0}] [L1058] EXPR list->colour VAL [end={1:0}, list={2:0}, list->colour=1, null={1:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={1:0}, list={2:0}, list->next={1:0}, null={1:0}] [L1067] end = list->next [L1068] free(list) VAL [end={1:0}, list={2:0}, null={1:0}] [L1068] free(list) VAL [end={1:0}, list={2:0}, null={1:0}] [L1068] free(list) [L1069] list = end VAL [end={1:0}, list={1:0}, null={1:0}] [L1056] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, null={1:0}] [L1073] return 0; VAL [\result=0, end={1:0}, list={1:0}, null={1:0}] - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 137694.3ms, OverallIterations: 25, TraceHistogramMax: 2, EmptinessCheckTime: 28.9ms, AutomataDifference: 68322.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2231 SDtfs, 3792 SDslu, 5937 SDs, 0 SdLazy, 7642 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16293.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1259 GetRequests, 946 SyntacticMatches, 19 SemanticMatches, 294 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 96943.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=0, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 110.0ms AutomataMinimizationTime, 24 MinimizatonAttempts, 555 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 235.6ms SsaConstructionTime, 1462.0ms SatisfiabilityAnalysisTime, 55564.7ms InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1096 ConstructedInterpolants, 59 QuantifiedInterpolants, 7743 SizeOfPredicates, 129 NumberOfNonLiveVariables, 3280 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 48 InterpolantComputations, 44 PerfectInterpolantSequences, 8/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:39:22,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...