./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-2.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:04:23,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:04:23,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:04:23,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:04:23,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:04:23,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:04:23,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:04:23,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:04:23,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:04:23,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:04:23,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:04:23,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:04:23,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:04:23,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:04:23,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:04:23,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:04:23,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:04:23,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:04:23,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:04:23,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:04:23,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:04:23,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:04:23,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:04:23,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:04:23,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:04:23,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:04:23,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:04:23,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:04:23,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:04:23,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:04:23,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:04:23,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:04:23,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:04:23,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:04:23,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:04:23,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:04:23,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:04:23,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:04:23,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:04:23,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:04:23,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:04:23,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:04:23,513 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:04:23,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:04:23,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:04:23,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:04:23,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:04:23,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:04:23,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:04:23,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:04:23,516 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:04:23,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:04:23,517 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:04:23,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:04:23,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:04:23,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:04:23,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:04:23,518 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:04:23,518 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:04:23,518 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:04:23,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:04:23,519 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:04:23,519 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:04:23,519 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:04:23,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:04:23,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:04:23,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:04:23,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:23,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:04:23,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:04:23,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:04:23,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:04:23,521 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:04:23,521 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2021-12-15 14:04:23,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:04:23,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:04:23,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:04:23,789 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:04:23,790 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:04:23,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-15 14:04:23,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508b12173/d6a3ba2692784e15b0e1547ce8da6333/FLAG93045a314 [2021-12-15 14:04:24,286 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:04:24,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-15 14:04:24,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508b12173/d6a3ba2692784e15b0e1547ce8da6333/FLAG93045a314 [2021-12-15 14:04:24,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508b12173/d6a3ba2692784e15b0e1547ce8da6333 [2021-12-15 14:04:24,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:04:24,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:04:24,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:24,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:04:24,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:04:24,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b43e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24, skipping insertion in model container [2021-12-15 14:04:24,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:04:24,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:04:25,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-12-15 14:04:25,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-12-15 14:04:25,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-12-15 14:04:25,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:25,026 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:04:25,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-12-15 14:04:25,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-12-15 14:04:25,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-12-15 14:04:25,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:25,095 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:04:25,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25 WrapperNode [2021-12-15 14:04:25,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:25,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:25,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:04:25,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:04:25,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,140 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2021-12-15 14:04:25,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:25,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:04:25,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:04:25,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:04:25,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:04:25,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:04:25,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:04:25,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:04:25,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:25,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:25,214 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-12-15 14:04:25,216 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-12-15 14:04:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 14:04:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:04:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:04:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:04:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:04:25,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:04:25,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:04:25,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:04:25,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:04:25,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:04:25,317 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:04:25,319 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:04:25,554 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:04:25,559 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:04:25,559 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-15 14:04:25,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25 BoogieIcfgContainer [2021-12-15 14:04:25,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:04:25,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:04:25,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:04:25,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:04:25,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:04:24" (1/3) ... [2021-12-15 14:04:25,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2312d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (2/3) ... [2021-12-15 14:04:25,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2312d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25" (3/3) ... [2021-12-15 14:04:25,567 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2021-12-15 14:04:25,571 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:04:25,587 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-12-15 14:04:25,637 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:04:25,643 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, mAutomataTypeConcurrency=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-12-15 14:04:25,643 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-12-15 14:04:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:25,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:25,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:25,671 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:04:25,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:25,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068394318] [2021-12-15 14:04:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:25,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:25,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068394318] [2021-12-15 14:04:25,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068394318] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:25,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:25,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:25,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610227689] [2021-12-15 14:04:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:25,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:25,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:25,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:25,906 INFO L87 Difference]: Start difference. First operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,023 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2021-12-15 14:04:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,032 INFO L225 Difference]: With dead ends: 117 [2021-12-15 14:04:26,033 INFO L226 Difference]: Without dead ends: 115 [2021-12-15 14:04:26,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,039 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 80 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-15 14:04:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2021-12-15 14:04:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2021-12-15 14:04:26,081 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 3 [2021-12-15 14:04:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,081 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2021-12-15 14:04:26,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2021-12-15 14:04:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:26,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:26,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:04:26,084 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:04:26,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857243615] [2021-12-15 14:04:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857243615] [2021-12-15 14:04:26,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857243615] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:26,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459479323] [2021-12-15 14:04:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:26,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,133 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,230 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2021-12-15 14:04:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,232 INFO L225 Difference]: With dead ends: 112 [2021-12-15 14:04:26,233 INFO L226 Difference]: Without dead ends: 112 [2021-12-15 14:04:26,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,235 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-15 14:04:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2021-12-15 14:04:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-12-15 14:04:26,253 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 3 [2021-12-15 14:04:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,255 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-12-15 14:04:26,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-12-15 14:04:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 14:04:26,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:04:26,257 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112040, now seen corresponding path program 1 times [2021-12-15 14:04:26,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847552521] [2021-12-15 14:04:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847552521] [2021-12-15 14:04:26,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847552521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:26,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89083678] [2021-12-15 14:04:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:26,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:26,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:26,360 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,466 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2021-12-15 14:04:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-15 14:04:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,470 INFO L225 Difference]: With dead ends: 97 [2021-12-15 14:04:26,470 INFO L226 Difference]: Without dead ends: 97 [2021-12-15 14:04:26,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,472 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-15 14:04:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2021-12-15 14:04:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2021-12-15 14:04:26,479 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 9 [2021-12-15 14:04:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,480 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2021-12-15 14:04:26,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2021-12-15 14:04:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 14:04:26,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:04:26,481 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112041, now seen corresponding path program 1 times [2021-12-15 14:04:26,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514775079] [2021-12-15 14:04:26,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514775079] [2021-12-15 14:04:26,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514775079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:26,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402827638] [2021-12-15 14:04:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:26,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:26,570 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,693 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2021-12-15 14:04:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:26,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-15 14:04:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,694 INFO L225 Difference]: With dead ends: 113 [2021-12-15 14:04:26,694 INFO L226 Difference]: Without dead ends: 113 [2021-12-15 14:04:26,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,696 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-15 14:04:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2021-12-15 14:04:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-12-15 14:04:26,703 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2021-12-15 14:04:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,703 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-12-15 14:04:26,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-12-15 14:04:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:04:26,705 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-15 14:04:26,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110827890] [2021-12-15 14:04:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110827890] [2021-12-15 14:04:26,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110827890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037680665] [2021-12-15 14:04:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,822 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,938 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-12-15 14:04:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 14:04:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,939 INFO L225 Difference]: With dead ends: 96 [2021-12-15 14:04:26,939 INFO L226 Difference]: Without dead ends: 96 [2021-12-15 14:04:26,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:26,940 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-15 14:04:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-15 14:04:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-12-15 14:04:26,945 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2021-12-15 14:04:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,946 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-12-15 14:04:26,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-12-15 14:04:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:04:26,947 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-15 14:04:26,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518834664] [2021-12-15 14:04:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518834664] [2021-12-15 14:04:26,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518834664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165523100] [2021-12-15 14:04:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:27,000 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,096 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2021-12-15 14:04:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 14:04:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,097 INFO L225 Difference]: With dead ends: 95 [2021-12-15 14:04:27,098 INFO L226 Difference]: Without dead ends: 95 [2021-12-15 14:04:27,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:27,099 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-15 14:04:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-15 14:04:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-15 14:04:27,104 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2021-12-15 14:04:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,104 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-15 14:04:27,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-15 14:04:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 14:04:27,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:04:27,106 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash 683852107, now seen corresponding path program 1 times [2021-12-15 14:04:27,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087246396] [2021-12-15 14:04:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,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-12-15 14:04:27,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087246396] [2021-12-15 14:04:27,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087246396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:27,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605108651] [2021-12-15 14:04:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:27,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:27,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:27,284 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,447 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2021-12-15 14:04:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-15 14:04:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,448 INFO L225 Difference]: With dead ends: 178 [2021-12-15 14:04:27,449 INFO L226 Difference]: Without dead ends: 178 [2021-12-15 14:04:27,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:27,453 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 279 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 284 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-15 14:04:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2021-12-15 14:04:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-12-15 14:04:27,461 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 13 [2021-12-15 14:04:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,461 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-12-15 14:04:27,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-12-15 14:04:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 14:04:27,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:04:27,463 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash -275416990, now seen corresponding path program 1 times [2021-12-15 14:04:27,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291439647] [2021-12-15 14:04:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:27,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291439647] [2021-12-15 14:04:27,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291439647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:27,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456147859] [2021-12-15 14:04:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:27,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:27,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:27,557 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,790 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-12-15 14:04:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:27,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 14:04:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,792 INFO L225 Difference]: With dead ends: 140 [2021-12-15 14:04:27,792 INFO L226 Difference]: Without dead ends: 140 [2021-12-15 14:04:27,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:04:27,793 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 314 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 210 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-15 14:04:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2021-12-15 14:04:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2021-12-15 14:04:27,797 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2021-12-15 14:04:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,797 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2021-12-15 14:04:27,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2021-12-15 14:04:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 14:04:27,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:04:27,798 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash -275416989, now seen corresponding path program 1 times [2021-12-15 14:04:27,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374591923] [2021-12-15 14:04:27,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:27,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374591923] [2021-12-15 14:04:27,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374591923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:27,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367207842] [2021-12-15 14:04:27,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:27,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:27,964 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,179 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2021-12-15 14:04:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:28,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 14:04:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,183 INFO L225 Difference]: With dead ends: 172 [2021-12-15 14:04:28,183 INFO L226 Difference]: Without dead ends: 172 [2021-12-15 14:04:28,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:28,184 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 254 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 216 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-15 14:04:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 112. [2021-12-15 14:04:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2021-12-15 14:04:28,188 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2021-12-15 14:04:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,188 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2021-12-15 14:04:28,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2021-12-15 14:04:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:28,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:04:28,189 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-15 14:04:28,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132638875] [2021-12-15 14:04:28,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:28,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132638875] [2021-12-15 14:04:28,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132638875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:28,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706380395] [2021-12-15 14:04:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:28,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:28,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:28,274 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,550 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2021-12-15 14:04:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:04:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:04:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,551 INFO L225 Difference]: With dead ends: 120 [2021-12-15 14:04:28,551 INFO L226 Difference]: Without dead ends: 120 [2021-12-15 14:04:28,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:04:28,552 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 210 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-15 14:04:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2021-12-15 14:04:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2021-12-15 14:04:28,555 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 16 [2021-12-15 14:04:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,555 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2021-12-15 14:04:28,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2021-12-15 14:04:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:28,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:04:28,556 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-15 14:04:28,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336793720] [2021-12-15 14:04:28,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:28,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336793720] [2021-12-15 14:04:28,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336793720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:28,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852430446] [2021-12-15 14:04:28,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:28,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:28,713 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,094 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2021-12-15 14:04:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 14:04:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:04:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,095 INFO L225 Difference]: With dead ends: 115 [2021-12-15 14:04:29,095 INFO L226 Difference]: Without dead ends: 115 [2021-12-15 14:04:29,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-15 14:04:29,096 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 240 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-15 14:04:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2021-12-15 14:04:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-12-15 14:04:29,099 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 16 [2021-12-15 14:04:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,099 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-12-15 14:04:29,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-12-15 14:04:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:04:29,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:29,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:04:29,100 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926215, now seen corresponding path program 1 times [2021-12-15 14:04:29,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461036072] [2021-12-15 14:04:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:29,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461036072] [2021-12-15 14:04:29,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461036072] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:29,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125713127] [2021-12-15 14:04:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:29,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:29,229 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,498 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2021-12-15 14:04:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:04:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,499 INFO L225 Difference]: With dead ends: 147 [2021-12-15 14:04:29,499 INFO L226 Difference]: Without dead ends: 147 [2021-12-15 14:04:29,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:04:29,500 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 265 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 322 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-15 14:04:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2021-12-15 14:04:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2021-12-15 14:04:29,503 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 17 [2021-12-15 14:04:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,503 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2021-12-15 14:04:29,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2021-12-15 14:04:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:04:29,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:29,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:04:29,504 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926214, now seen corresponding path program 1 times [2021-12-15 14:04:29,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014320405] [2021-12-15 14:04:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:29,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014320405] [2021-12-15 14:04:29,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014320405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:29,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050228489] [2021-12-15 14:04:29,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:29,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:29,637 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,884 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-12-15 14:04:29,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:29,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:04:29,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,885 INFO L225 Difference]: With dead ends: 157 [2021-12-15 14:04:29,885 INFO L226 Difference]: Without dead ends: 157 [2021-12-15 14:04:29,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:04:29,886 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 247 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 245 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-15 14:04:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2021-12-15 14:04:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-15 14:04:29,889 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2021-12-15 14:04:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,890 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-15 14:04:29,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-15 14:04:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:04:29,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:29,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:04:29,891 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087206, now seen corresponding path program 1 times [2021-12-15 14:04:29,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433187923] [2021-12-15 14:04:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:29,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433187923] [2021-12-15 14:04:29,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433187923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:29,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818753131] [2021-12-15 14:04:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:29,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:29,973 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,171 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2021-12-15 14:04:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:30,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:04:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,173 INFO L225 Difference]: With dead ends: 138 [2021-12-15 14:04:30,173 INFO L226 Difference]: Without dead ends: 138 [2021-12-15 14:04:30,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:04:30,174 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 287 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 207 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-15 14:04:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2021-12-15 14:04:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2021-12-15 14:04:30,178 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 18 [2021-12-15 14:04:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,178 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2021-12-15 14:04:30,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2021-12-15 14:04:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:04:30,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:30,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:04:30,180 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087205, now seen corresponding path program 1 times [2021-12-15 14:04:30,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838393666] [2021-12-15 14:04:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:30,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838393666] [2021-12-15 14:04:30,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838393666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:30,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494350481] [2021-12-15 14:04:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:30,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:30,353 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,565 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2021-12-15 14:04:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:30,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:04:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,567 INFO L225 Difference]: With dead ends: 159 [2021-12-15 14:04:30,567 INFO L226 Difference]: Without dead ends: 159 [2021-12-15 14:04:30,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:30,568 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 222 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 184 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-15 14:04:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2021-12-15 14:04:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2021-12-15 14:04:30,571 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2021-12-15 14:04:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,574 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2021-12-15 14:04:30,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2021-12-15 14:04:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:04:30,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,576 INFO L514 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-12-15 14:04:30,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:04:30,576 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1461687964, now seen corresponding path program 1 times [2021-12-15 14:04:30,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371140691] [2021-12-15 14:04:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:30,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371140691] [2021-12-15 14:04:30,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371140691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:30,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660392212] [2021-12-15 14:04:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:30,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:30,706 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,862 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2021-12-15 14:04:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:30,862 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:04:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,863 INFO L225 Difference]: With dead ends: 155 [2021-12-15 14:04:30,863 INFO L226 Difference]: Without dead ends: 155 [2021-12-15 14:04:30,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:30,864 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 172 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 258 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-15 14:04:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2021-12-15 14:04:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2021-12-15 14:04:30,867 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 21 [2021-12-15 14:04:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,867 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2021-12-15 14:04:30,867 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2021-12-15 14:04:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:04:30,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,868 INFO L514 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-12-15 14:04:30,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 14:04:30,868 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1905376220, now seen corresponding path program 1 times [2021-12-15 14:04:30,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368917616] [2021-12-15 14:04:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,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-12-15 14:04:30,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368917616] [2021-12-15 14:04:30,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368917616] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:30,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052367976] [2021-12-15 14:04:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:30,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:30,892 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,898 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2021-12-15 14:04:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:30,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:04:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,899 INFO L225 Difference]: With dead ends: 125 [2021-12-15 14:04:30,899 INFO L226 Difference]: Without dead ends: 125 [2021-12-15 14:04:30,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:30,900 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-15 14:04:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 14:04:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2021-12-15 14:04:30,904 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 21 [2021-12-15 14:04:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,904 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2021-12-15 14:04:30,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2021-12-15 14:04:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:04:30,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,906 INFO L514 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-12-15 14:04:30,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 14:04:30,907 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2137291894, now seen corresponding path program 1 times [2021-12-15 14:04:30,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463336238] [2021-12-15 14:04:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463336238] [2021-12-15 14:04:31,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463336238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:31,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:31,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 14:04:31,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680122671] [2021-12-15 14:04:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:31,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:31,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:31,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:31,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:31,013 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:31,277 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2021-12-15 14:04:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:04:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:31,278 INFO L225 Difference]: With dead ends: 161 [2021-12-15 14:04:31,278 INFO L226 Difference]: Without dead ends: 161 [2021-12-15 14:04:31,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:04:31,279 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 131 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:31,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 356 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-15 14:04:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2021-12-15 14:04:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.423728813559322) internal successors, (168), 138 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2021-12-15 14:04:31,283 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 21 [2021-12-15 14:04:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:31,283 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2021-12-15 14:04:31,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2021-12-15 14:04:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:04:31,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:31,284 INFO L514 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-12-15 14:04:31,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 14:04:31,284 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832435, now seen corresponding path program 1 times [2021-12-15 14:04:31,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:31,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105657099] [2021-12-15 14:04:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:31,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105657099] [2021-12-15 14:04:31,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105657099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:31,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:31,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:31,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033571513] [2021-12-15 14:04:31,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:31,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:31,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:31,325 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:31,417 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2021-12-15 14:04:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 14:04:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:31,418 INFO L225 Difference]: With dead ends: 138 [2021-12-15 14:04:31,418 INFO L226 Difference]: Without dead ends: 138 [2021-12-15 14:04:31,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:31,419 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 29 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:31,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-15 14:04:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-12-15 14:04:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2021-12-15 14:04:31,423 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 22 [2021-12-15 14:04:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:31,424 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2021-12-15 14:04:31,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2021-12-15 14:04:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:04:31,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:31,425 INFO L514 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-12-15 14:04:31,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 14:04:31,425 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:31,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832434, now seen corresponding path program 1 times [2021-12-15 14:04:31,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:31,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721487507] [2021-12-15 14:04:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:31,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721487507] [2021-12-15 14:04:31,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721487507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:31,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:31,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:31,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762539689] [2021-12-15 14:04:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:31,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:31,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:31,566 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:31,838 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2021-12-15 14:04:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:04:31,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 14:04:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:31,839 INFO L225 Difference]: With dead ends: 157 [2021-12-15 14:04:31,839 INFO L226 Difference]: Without dead ends: 157 [2021-12-15 14:04:31,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:04:31,840 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 180 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:31,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 340 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-15 14:04:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2021-12-15 14:04:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 137 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2021-12-15 14:04:31,843 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 22 [2021-12-15 14:04:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:31,844 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2021-12-15 14:04:31,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2021-12-15 14:04:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:31,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:31,844 INFO L514 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-12-15 14:04:31,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 14:04:31,845 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 227835007, now seen corresponding path program 1 times [2021-12-15 14:04:31,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:31,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502298701] [2021-12-15 14:04:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:31,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502298701] [2021-12-15 14:04:31,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502298701] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:31,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:31,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:31,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406284896] [2021-12-15 14:04:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:31,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:31,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:31,980 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:32,198 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2021-12-15 14:04:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:32,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:32,199 INFO L225 Difference]: With dead ends: 155 [2021-12-15 14:04:32,199 INFO L226 Difference]: Without dead ends: 155 [2021-12-15 14:04:32,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:32,200 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 201 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:32,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 357 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-15 14:04:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 138. [2021-12-15 14:04:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.38135593220339) internal successors, (163), 137 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2021-12-15 14:04:32,203 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 23 [2021-12-15 14:04:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:32,203 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2021-12-15 14:04:32,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2021-12-15 14:04:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:04:32,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:32,204 INFO L514 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-12-15 14:04:32,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-15 14:04:32,204 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 779247630, now seen corresponding path program 1 times [2021-12-15 14:04:32,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:32,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300854380] [2021-12-15 14:04:32,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:32,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300854380] [2021-12-15 14:04:32,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300854380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:32,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:32,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:32,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622800936] [2021-12-15 14:04:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:32,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:32,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:32,244 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:32,362 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2021-12-15 14:04:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:32,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 14:04:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:32,363 INFO L225 Difference]: With dead ends: 140 [2021-12-15 14:04:32,363 INFO L226 Difference]: Without dead ends: 140 [2021-12-15 14:04:32,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:32,364 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 78 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:32,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 163 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-15 14:04:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2021-12-15 14:04:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 138 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 164 transitions. [2021-12-15 14:04:32,367 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 164 transitions. Word has length 24 [2021-12-15 14:04:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:32,367 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 164 transitions. [2021-12-15 14:04:32,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2021-12-15 14:04:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:04:32,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:32,368 INFO L514 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-12-15 14:04:32,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-15 14:04:32,368 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 779247631, now seen corresponding path program 1 times [2021-12-15 14:04:32,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:32,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817856689] [2021-12-15 14:04:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:32,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:32,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817856689] [2021-12-15 14:04:32,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817856689] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:32,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871952766] [2021-12-15 14:04:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:32,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:32,520 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-12-15 14:04:32,521 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-12-15 14:04:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:04:32,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:32,767 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 23 treesize of output 15 [2021-12-15 14:04:32,771 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 28 treesize of output 16 [2021-12-15 14:04:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:32,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871952766] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:32,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:04:32,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2021-12-15 14:04:32,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701044630] [2021-12-15 14:04:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:32,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:32,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:04:32,817 INFO L87 Difference]: Start difference. First operand 139 states and 164 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:33,021 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2021-12-15 14:04:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:33,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 14:04:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:33,025 INFO L225 Difference]: With dead ends: 139 [2021-12-15 14:04:33,025 INFO L226 Difference]: Without dead ends: 139 [2021-12-15 14:04:33,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:04:33,026 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 63 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:33,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 177 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-15 14:04:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2021-12-15 14:04:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.3445378151260505) internal successors, (160), 137 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2021-12-15 14:04:33,028 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 24 [2021-12-15 14:04:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:33,029 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2021-12-15 14:04:33,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2021-12-15 14:04:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:04:33,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:33,029 INFO L514 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] [2021-12-15 14:04:33,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:33,239 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,SelfDestructingSolverStorable22 [2021-12-15 14:04:33,239 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash -342052636, now seen corresponding path program 1 times [2021-12-15 14:04:33,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:33,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900448234] [2021-12-15 14:04:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:33,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:33,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:33,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900448234] [2021-12-15 14:04:33,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900448234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:33,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:33,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 14:04:33,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930008711] [2021-12-15 14:04:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:33,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 14:04:33,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 14:04:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:04:33,429 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:33,734 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2021-12-15 14:04:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:04:33,735 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:04:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:33,736 INFO L225 Difference]: With dead ends: 150 [2021-12-15 14:04:33,736 INFO L226 Difference]: Without dead ends: 150 [2021-12-15 14:04:33,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-12-15 14:04:33,737 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:33,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 423 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-15 14:04:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2021-12-15 14:04:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 136 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2021-12-15 14:04:33,740 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 25 [2021-12-15 14:04:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:33,740 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2021-12-15 14:04:33,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2021-12-15 14:04:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:04:33,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:33,741 INFO L514 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] [2021-12-15 14:04:33,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-15 14:04:33,741 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492295, now seen corresponding path program 1 times [2021-12-15 14:04:33,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:33,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628400614] [2021-12-15 14:04:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:33,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:33,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:33,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628400614] [2021-12-15 14:04:33,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628400614] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:33,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:33,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:33,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747005900] [2021-12-15 14:04:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:33,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:33,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:33,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:33,768 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:33,778 INFO L93 Difference]: Finished difference Result 210 states and 233 transitions. [2021-12-15 14:04:33,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:33,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:04:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:33,780 INFO L225 Difference]: With dead ends: 210 [2021-12-15 14:04:33,780 INFO L226 Difference]: Without dead ends: 210 [2021-12-15 14:04:33,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:33,781 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:33,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-15 14:04:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 154. [2021-12-15 14:04:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 153 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2021-12-15 14:04:33,785 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 25 [2021-12-15 14:04:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:33,785 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2021-12-15 14:04:33,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2021-12-15 14:04:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 14:04:33,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:33,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:33,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-15 14:04:33,786 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:33,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1532665747, now seen corresponding path program 1 times [2021-12-15 14:04:33,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:33,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79697983] [2021-12-15 14:04:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:33,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:33,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:33,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79697983] [2021-12-15 14:04:33,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79697983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740922587] [2021-12-15 14:04:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:33,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:33,924 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-12-15 14:04:33,932 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-12-15 14:04:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:34,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 14:04:34,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:34,130 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 25 treesize of output 17 [2021-12-15 14:04:34,137 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-12-15 14:04:34,169 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-12-15 14:04:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:34,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:34,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740922587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:34,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:04:34,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2021-12-15 14:04:34,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443407648] [2021-12-15 14:04:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:34,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:34,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:04:34,191 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:34,411 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2021-12-15 14:04:34,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:34,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 14:04:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:34,413 INFO L225 Difference]: With dead ends: 172 [2021-12-15 14:04:34,413 INFO L226 Difference]: Without dead ends: 172 [2021-12-15 14:04:34,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-12-15 14:04:34,414 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:34,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 330 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-15 14:04:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2021-12-15 14:04:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 166 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 191 transitions. [2021-12-15 14:04:34,417 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 191 transitions. Word has length 26 [2021-12-15 14:04:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:34,418 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 191 transitions. [2021-12-15 14:04:34,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2021-12-15 14:04:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 14:04:34,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:34,418 INFO L514 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-12-15 14:04:34,444 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-12-15 14:04:34,618 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,SelfDestructingSolverStorable25 [2021-12-15 14:04:34,619 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash -301886117, now seen corresponding path program 1 times [2021-12-15 14:04:34,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:34,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235210751] [2021-12-15 14:04:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:34,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:34,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:34,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235210751] [2021-12-15 14:04:34,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235210751] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:34,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056042601] [2021-12-15 14:04:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:34,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:34,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:34,755 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-12-15 14:04:34,756 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-12-15 14:04:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:34,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-15 14:04:34,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:34,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-12-15 14:04:34,969 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:04:34,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-12-15 14:04:35,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-15 14:04:35,115 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:35,116 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 27 treesize of output 28 [2021-12-15 14:04:35,206 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:35,206 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 30 treesize of output 28 [2021-12-15 14:04:35,253 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:35,253 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 30 treesize of output 28 [2021-12-15 14:04:35,311 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:35,311 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 27 treesize of output 28 [2021-12-15 14:04:35,347 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 24 treesize of output 12 [2021-12-15 14:04:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:35,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:35,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:35,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:35,421 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:35,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:35,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:35,451 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:35,452 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-15 14:04:35,461 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:35,461 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 141 treesize of output 128 [2021-12-15 14:04:35,473 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:35,474 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 112 treesize of output 111 [2021-12-15 14:04:35,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 102 treesize of output 98 [2021-12-15 14:04:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:04:35,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056042601] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:35,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:35,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2021-12-15 14:04:35,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319282063] [2021-12-15 14:04:35,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:35,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-15 14:04:35,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:35,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-15 14:04:35,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=392, Unknown=5, NotChecked=220, Total=702 [2021-12-15 14:04:35,704 INFO L87 Difference]: Start difference. First operand 167 states and 191 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:36,390 INFO L93 Difference]: Finished difference Result 283 states and 309 transitions. [2021-12-15 14:04:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 14:04:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 14:04:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:36,392 INFO L225 Difference]: With dead ends: 283 [2021-12-15 14:04:36,392 INFO L226 Difference]: Without dead ends: 283 [2021-12-15 14:04:36,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=752, Unknown=9, NotChecked=310, Total=1260 [2021-12-15 14:04:36,393 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 341 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 976 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:36,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 801 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 814 Invalid, 0 Unknown, 976 Unchecked, 0.4s Time] [2021-12-15 14:04:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-15 14:04:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 177. [2021-12-15 14:04:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 176 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2021-12-15 14:04:36,397 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 28 [2021-12-15 14:04:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:36,397 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2021-12-15 14:04:36,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2021-12-15 14:04:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:04:36,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:36,398 INFO L514 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-12-15 14:04:36,423 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-12-15 14:04:36,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:36,610 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -768530862, now seen corresponding path program 1 times [2021-12-15 14:04:36,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:36,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312788067] [2021-12-15 14:04:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:36,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:36,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:36,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312788067] [2021-12-15 14:04:36,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312788067] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:36,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771574222] [2021-12-15 14:04:36,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:36,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:36,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:36,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:04:36,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 14:04:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:36,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 14:04:36,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:37,039 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 14:04:37,039 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 19 treesize of output 18 [2021-12-15 14:04:37,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:37,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:37,119 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:04:37,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 14:04:37,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:37,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:37,202 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:04:37,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2021-12-15 14:04:37,250 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:04:37,250 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 28 treesize of output 15 [2021-12-15 14:04:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:37,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:43,479 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:43,480 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 120 treesize of output 99 [2021-12-15 14:04:44,798 INFO L354 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2021-12-15 14:04:44,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 64 [2021-12-15 14:04:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:44,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771574222] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:44,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:44,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2021-12-15 14:04:44,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679905762] [2021-12-15 14:04:44,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:44,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 14:04:44,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 14:04:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=501, Unknown=3, NotChecked=0, Total=600 [2021-12-15 14:04:44,965 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:45,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)))) (and (forall ((v_ArrVal_949 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (or (not (= 1 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) .cse0 (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not .cse0)))) is different from false [2021-12-15 14:04:45,724 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_ArrVal_949 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (or (not (= 1 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) .cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= |c_ULTIMATE.start_main_~x~0#1.base| (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_949 Int)) (or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_949)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not .cse0)) (= (select |c_#valid| (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2021-12-15 14:04:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:49,082 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2021-12-15 14:04:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-15 14:04:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 14:04:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:49,084 INFO L225 Difference]: With dead ends: 271 [2021-12-15 14:04:49,084 INFO L226 Difference]: Without dead ends: 271 [2021-12-15 14:04:49,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=318, Invalid=1325, Unknown=5, NotChecked=158, Total=1806 [2021-12-15 14:04:49,085 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 376 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:49,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 598 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 653 Invalid, 0 Unknown, 322 Unchecked, 0.4s Time] [2021-12-15 14:04:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-15 14:04:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 216. [2021-12-15 14:04:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 215 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2021-12-15 14:04:49,089 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 29 [2021-12-15 14:04:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:49,089 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2021-12-15 14:04:49,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2021-12-15 14:04:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:04:49,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:49,090 INFO L514 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-12-15 14:04:49,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:49,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-15 14:04:49,290 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash -768530861, now seen corresponding path program 1 times [2021-12-15 14:04:49,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:49,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438315551] [2021-12-15 14:04:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:49,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:49,329 ERROR L253 erpolLogProxyWrapper]: Interpolant 13 not inductive [2021-12-15 14:04:49,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-15 14:04:49,340 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 14:04:49,347 INFO L158 Benchmark]: Toolchain (without parser) took 24681.91ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 69.0MB in the beginning and 79.9MB in the end (delta: -10.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2021-12-15 14:04:49,347 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:04:49,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.72ms. Allocated memory is still 102.8MB. Free memory was 68.7MB in the beginning and 70.2MB in the end (delta: -1.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-15 14:04:49,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 102.8MB. Free memory was 70.2MB in the beginning and 68.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:04:49,347 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:04:49,348 INFO L158 Benchmark]: RCFGBuilder took 376.47ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 48.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 14:04:49,348 INFO L158 Benchmark]: TraceAbstraction took 23783.96ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 48.6MB in the beginning and 79.9MB in the end (delta: -31.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-12-15 14:04:49,349 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.17ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.72ms. Allocated memory is still 102.8MB. Free memory was 68.7MB in the beginning and 70.2MB in the end (delta: -1.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 102.8MB. Free memory was 70.2MB in the beginning and 68.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.47ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 48.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23783.96ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 48.6MB in the beginning and 79.9MB in the end (delta: -31.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 14:04:49,382 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-circular-2.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:04:51,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:04:51,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:04:51,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:04:51,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:04:51,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:04:51,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:04:51,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:04:51,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:04:51,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:04:51,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:04:51,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:04:51,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:04:51,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:04:51,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:04:51,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:04:51,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:04:51,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:04:51,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:04:51,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:04:51,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:04:51,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:04:51,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:04:51,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:04:51,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:04:51,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:04:51,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:04:51,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:04:51,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:04:51,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:04:51,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:04:51,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:04:51,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:04:51,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:04:51,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:04:51,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:04:51,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:04:51,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:04:51,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:04:51,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:04:51,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:04:51,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-15 14:04:51,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:04:51,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:04:51,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:04:51,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:04:51,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:04:51,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:04:51,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:04:51,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:04:51,336 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:04:51,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:04:51,337 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:04:51,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:04:51,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:04:51,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:04:51,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:04:51,338 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:04:51,338 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:04:51,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:04:51,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:04:51,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:04:51,339 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 14:04:51,339 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 14:04:51,339 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:04:51,339 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:04:51,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:04:51,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:04:51,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:04:51,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:51,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:04:51,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:04:51,341 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 14:04:51,341 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 14:04:51,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:04:51,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 14:04:51,341 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2021-12-15 14:04:51,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:04:51,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:04:51,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:04:51,657 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:04:51,658 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:04:51,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-15 14:04:51,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec01dc465/b6b849ec50764554b1a458f93e79b546/FLAGa7924073e [2021-12-15 14:04:52,218 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:04:52,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-12-15 14:04:52,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec01dc465/b6b849ec50764554b1a458f93e79b546/FLAGa7924073e [2021-12-15 14:04:52,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec01dc465/b6b849ec50764554b1a458f93e79b546 [2021-12-15 14:04:52,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:04:52,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:04:52,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:52,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:04:52,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:04:52,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:52" (1/1) ... [2021-12-15 14:04:52,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35eece2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:52, skipping insertion in model container [2021-12-15 14:04:52,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:52" (1/1) ... [2021-12-15 14:04:52,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:04:52,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:04:52,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-12-15 14:04:52,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-12-15 14:04:52,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-12-15 14:04:52,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:52,981 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:04:53,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-12-15 14:04:53,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-12-15 14:04:53,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-12-15 14:04:53,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:53,064 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:04:53,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53 WrapperNode [2021-12-15 14:04:53,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:53,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:53,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:04:53,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:04:53,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,134 INFO L137 Inliner]: procedures = 122, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2021-12-15 14:04:53,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:53,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:04:53,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:04:53,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:04:53,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:04:53,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:04:53,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:04:53,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:04:53,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:53,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:53,224 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-12-15 14:04:53,250 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-12-15 14:04:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-15 14:04:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:04:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:04:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:04:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:04:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:04:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-15 14:04:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 14:04:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:04:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:04:53,427 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:04:53,428 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:04:53,854 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:04:53,859 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:04:53,860 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-15 14:04:53,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:53 BoogieIcfgContainer [2021-12-15 14:04:53,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:04:53,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:04:53,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:04:53,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:04:53,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:04:52" (1/3) ... [2021-12-15 14:04:53,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e09998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:53, skipping insertion in model container [2021-12-15 14:04:53,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (2/3) ... [2021-12-15 14:04:53,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e09998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:53, skipping insertion in model container [2021-12-15 14:04:53,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:53" (3/3) ... [2021-12-15 14:04:53,868 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2021-12-15 14:04:53,872 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:04:53,873 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-12-15 14:04:53,920 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:04:53,931 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, mAutomataTypeConcurrency=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-12-15 14:04:53,932 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-12-15 14:04:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:53,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:53,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:53,949 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:04:53,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:53,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294879149] [2021-12-15 14:04:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:53,963 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:53,971 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-12-15 14:04:53,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 14:04:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:54,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 14:04:54,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:54,117 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-12-15 14:04:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:54,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:54,129 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:54,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294879149] [2021-12-15 14:04:54,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294879149] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:54,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:54,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:54,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134670373] [2021-12-15 14:04:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:54,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:54,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:54,170 INFO L87 Difference]: Start difference. First operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:54,327 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2021-12-15 14:04:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:54,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:54,336 INFO L225 Difference]: With dead ends: 115 [2021-12-15 14:04:54,336 INFO L226 Difference]: Without dead ends: 113 [2021-12-15 14:04:54,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:54,340 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:54,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 78 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-15 14:04:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2021-12-15 14:04:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2021-12-15 14:04:54,382 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 3 [2021-12-15 14:04:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:54,382 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2021-12-15 14:04:54,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2021-12-15 14:04:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:54,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:54,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:54,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-15 14:04:54,594 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-12-15 14:04:54,595 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:54,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:04:54,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:54,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682397514] [2021-12-15 14:04:54,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:54,597 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:54,598 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-12-15 14:04:54,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 14:04:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:54,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:04:54,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:54,672 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-12-15 14:04:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:54,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:54,686 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:54,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682397514] [2021-12-15 14:04:54,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682397514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:54,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:54,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:54,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749199979] [2021-12-15 14:04:54,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:54,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:54,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:54,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:54,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:54,688 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:54,883 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-12-15 14:04:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:54,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:54,885 INFO L225 Difference]: With dead ends: 110 [2021-12-15 14:04:54,885 INFO L226 Difference]: Without dead ends: 110 [2021-12-15 14:04:54,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:54,887 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 90 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:54,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 78 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-15 14:04:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2021-12-15 14:04:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2021-12-15 14:04:54,894 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 3 [2021-12-15 14:04:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:54,894 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2021-12-15 14:04:54,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2021-12-15 14:04:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 14:04:54,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:54,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:54,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:55,102 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-12-15 14:04:55,102 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:55,103 INFO L85 PathProgramCache]: Analyzing trace with hash 59261800, now seen corresponding path program 1 times [2021-12-15 14:04:55,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:55,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674805729] [2021-12-15 14:04:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:55,105 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:55,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:55,106 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-12-15 14:04:55,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 14:04:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:55,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:04:55,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:55,178 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-12-15 14:04:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:55,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:55,211 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:55,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674805729] [2021-12-15 14:04:55,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674805729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:55,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:55,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:55,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058324505] [2021-12-15 14:04:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:55,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:55,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:55,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:55,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:55,217 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:55,430 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2021-12-15 14:04:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-15 14:04:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:55,432 INFO L225 Difference]: With dead ends: 95 [2021-12-15 14:04:55,432 INFO L226 Difference]: Without dead ends: 95 [2021-12-15 14:04:55,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:55,433 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 146 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:55,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 52 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-15 14:04:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2021-12-15 14:04:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-15 14:04:55,439 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 8 [2021-12-15 14:04:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:55,439 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-15 14:04:55,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-15 14:04:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 14:04:55,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:55,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:55,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:55,649 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-12-15 14:04:55,649 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:55,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 59261801, now seen corresponding path program 1 times [2021-12-15 14:04:55,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:55,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822476800] [2021-12-15 14:04:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:55,651 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:55,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:55,652 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-12-15 14:04:55,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 14:04:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:55,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 14:04:55,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:55,724 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-12-15 14:04:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:55,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:55,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:55,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822476800] [2021-12-15 14:04:55,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822476800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:55,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:55,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:55,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404691665] [2021-12-15 14:04:55,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:55,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:55,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:55,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:55,778 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:56,043 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2021-12-15 14:04:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-15 14:04:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:56,044 INFO L225 Difference]: With dead ends: 110 [2021-12-15 14:04:56,044 INFO L226 Difference]: Without dead ends: 110 [2021-12-15 14:04:56,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:56,045 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 100 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:56,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 97 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-15 14:04:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2021-12-15 14:04:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-12-15 14:04:56,055 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 8 [2021-12-15 14:04:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:56,055 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-12-15 14:04:56,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-12-15 14:04:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 14:04:56,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:56,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:56,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-15 14:04:56,271 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-12-15 14:04:56,271 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:56,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-12-15 14:04:56,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:56,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892253066] [2021-12-15 14:04:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:56,273 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:56,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:56,274 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-12-15 14:04:56,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 14:04:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:56,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 14:04:56,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:56,381 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-12-15 14:04:56,396 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-12-15 14:04:56,415 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-12-15 14:04:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:56,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:56,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:56,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892253066] [2021-12-15 14:04:56,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892253066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:56,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:56,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:56,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908043052] [2021-12-15 14:04:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:56,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:56,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:56,425 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:56,671 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2021-12-15 14:04:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 14:04:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:56,673 INFO L225 Difference]: With dead ends: 93 [2021-12-15 14:04:56,673 INFO L226 Difference]: Without dead ends: 93 [2021-12-15 14:04:56,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:56,674 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:56,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 221 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-15 14:04:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-15 14:04:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2021-12-15 14:04:56,680 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 11 [2021-12-15 14:04:56,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:56,680 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2021-12-15 14:04:56,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2021-12-15 14:04:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 14:04:56,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:56,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:56,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:56,887 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-12-15 14:04:56,888 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-12-15 14:04:56,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:56,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115483369] [2021-12-15 14:04:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:56,889 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:56,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:56,890 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-12-15 14:04:56,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-15 14:04:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:56,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 14:04:56,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:57,000 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-12-15 14:04:57,034 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-12-15 14:04:57,040 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-12-15 14:04:57,068 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 17 treesize of output 9 [2021-12-15 14:04:57,076 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-12-15 14:04:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:57,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:57,089 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:57,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115483369] [2021-12-15 14:04:57,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115483369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:57,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:57,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:57,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238593229] [2021-12-15 14:04:57,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:57,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:57,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:57,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:57,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:57,091 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:57,363 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-12-15 14:04:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 14:04:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:57,368 INFO L225 Difference]: With dead ends: 92 [2021-12-15 14:04:57,368 INFO L226 Difference]: Without dead ends: 92 [2021-12-15 14:04:57,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:57,369 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:57,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-15 14:04:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-15 14:04:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-12-15 14:04:57,374 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 11 [2021-12-15 14:04:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:57,374 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-12-15 14:04:57,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-12-15 14:04:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:57,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:57,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:57,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:57,575 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-12-15 14:04:57,576 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1249789621, now seen corresponding path program 1 times [2021-12-15 14:04:57,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:57,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53753713] [2021-12-15 14:04:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:57,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:57,577 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-12-15 14:04:57,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-15 14:04:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:57,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 14:04:57,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:57,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-15 14:04:57,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:57,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12-15 14:04:57,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:57,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12-15 14:04:57,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:57,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12-15 14:04:57,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 14:04:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:57,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:57,839 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:57,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53753713] [2021-12-15 14:04:57,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53753713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:57,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:57,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:57,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002546134] [2021-12-15 14:04:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:57,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:57,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:57,842 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:58,131 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2021-12-15 14:04:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:58,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 14:04:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:58,132 INFO L225 Difference]: With dead ends: 175 [2021-12-15 14:04:58,133 INFO L226 Difference]: Without dead ends: 175 [2021-12-15 14:04:58,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:58,134 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 274 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:58,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 263 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-15 14:04:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 95. [2021-12-15 14:04:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-15 14:04:58,149 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2021-12-15 14:04:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:58,149 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-15 14:04:58,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-15 14:04:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 14:04:58,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:58,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:58,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:58,361 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-12-15 14:04:58,362 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -88768416, now seen corresponding path program 1 times [2021-12-15 14:04:58,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:58,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785808859] [2021-12-15 14:04:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:58,363 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:58,364 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-12-15 14:04:58,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-15 14:04:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:58,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-15 14:04:58,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:58,483 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-12-15 14:04:58,501 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-12-15 14:04:58,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:58,537 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-12-15 14:04:58,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:58,558 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-12-15 14:04:58,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:58,632 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-12-15 14:04:58,647 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-12-15 14:04:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:58,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:58,668 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:58,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785808859] [2021-12-15 14:04:58,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785808859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:58,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:58,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:04:58,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521517687] [2021-12-15 14:04:58,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:58,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:58,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:58,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:58,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:58,670 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:59,037 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2021-12-15 14:04:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-15 14:04:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:59,038 INFO L225 Difference]: With dead ends: 144 [2021-12-15 14:04:59,038 INFO L226 Difference]: Without dead ends: 144 [2021-12-15 14:04:59,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:59,039 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 255 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:59,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 155 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-15 14:04:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 97. [2021-12-15 14:04:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-15 14:04:59,043 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 13 [2021-12-15 14:04:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:59,044 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-15 14:04:59,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-15 14:04:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 14:04:59,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:59,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:59,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-15 14:04:59,253 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-12-15 14:04:59,254 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:04:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:59,254 INFO L85 PathProgramCache]: Analyzing trace with hash -88768415, now seen corresponding path program 1 times [2021-12-15 14:04:59,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:59,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396984568] [2021-12-15 14:04:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:59,255 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:59,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:59,255 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-12-15 14:04:59,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-15 14:04:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:59,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 14:04:59,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:59,354 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-12-15 14:04:59,373 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-12-15 14:04:59,379 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-12-15 14:04:59,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:59,409 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-12-15 14:04:59,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:59,416 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-12-15 14:04:59,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:59,435 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-12-15 14:04:59,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:59,441 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-12-15 14:04:59,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:59,528 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-12-15 14:04:59,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:59,534 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-12-15 14:04:59,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 15 treesize of output 7 [2021-12-15 14:04:59,558 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-12-15 14:04:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:59,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:59,596 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:59,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396984568] [2021-12-15 14:04:59,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396984568] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:59,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:59,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:04:59,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447460202] [2021-12-15 14:04:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:59,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:59,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:59,599 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:00,022 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2021-12-15 14:05:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:05:00,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-15 14:05:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:00,023 INFO L225 Difference]: With dead ends: 169 [2021-12-15 14:05:00,023 INFO L226 Difference]: Without dead ends: 169 [2021-12-15 14:05:00,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:05:00,024 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 249 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:00,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 197 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:05:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-15 14:05:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 109. [2021-12-15 14:05:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 108 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2021-12-15 14:05:00,028 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 13 [2021-12-15 14:05:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:00,028 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2021-12-15 14:05:00,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2021-12-15 14:05:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:05:00,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:00,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:00,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:00,229 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-12-15 14:05:00,230 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-12-15 14:05:00,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:00,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10042417] [2021-12-15 14:05:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:00,231 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:00,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:00,232 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-12-15 14:05:00,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-15 14:05:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:00,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:05:00,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:00,354 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-15 14:05:00,354 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 21 [2021-12-15 14:05:00,449 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-15 14:05:00,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-15 14:05:00,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-15 14:05:00,660 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:00,660 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 49 treesize of output 48 [2021-12-15 14:05:00,711 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 46 treesize of output 30 [2021-12-15 14:05:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:00,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:00,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10042417] [2021-12-15 14:05:00,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10042417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:00,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:00,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:05:00,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057729399] [2021-12-15 14:05:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:00,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:05:00,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:05:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:05:00,838 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:01,478 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2021-12-15 14:05:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:05:01,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:05:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:01,479 INFO L225 Difference]: With dead ends: 167 [2021-12-15 14:05:01,479 INFO L226 Difference]: Without dead ends: 167 [2021-12-15 14:05:01,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:05:01,480 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 179 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:01,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 302 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 223 Invalid, 0 Unknown, 167 Unchecked, 0.4s Time] [2021-12-15 14:05:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-15 14:05:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 111. [2021-12-15 14:05:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 110 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2021-12-15 14:05:01,484 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 15 [2021-12-15 14:05:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:01,484 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2021-12-15 14:05:01,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2021-12-15 14:05:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:05:01,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:01,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:01,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:01,685 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-12-15 14:05:01,686 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-12-15 14:05:01,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:01,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500710382] [2021-12-15 14:05:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:01,687 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:01,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:01,687 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-12-15 14:05:01,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-15 14:05:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:01,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 14:05:01,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:01,780 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-12-15 14:05:01,813 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:01,814 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 14 treesize of output 14 [2021-12-15 14:05:01,823 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-12-15 14:05:01,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-15 14:05:01,853 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-12-15 14:05:01,933 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:01,933 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 37 [2021-12-15 14:05:01,937 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 18 treesize of output 20 [2021-12-15 14:05:01,961 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-12-15 14:05:01,964 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 25 treesize of output 13 [2021-12-15 14:05:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:02,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:02,001 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:02,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500710382] [2021-12-15 14:05:02,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500710382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:02,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:02,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:05:02,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328032301] [2021-12-15 14:05:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:02,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:05:02,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:05:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:05:02,003 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:02,667 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2021-12-15 14:05:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 14:05:02,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:05:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:02,668 INFO L225 Difference]: With dead ends: 114 [2021-12-15 14:05:02,668 INFO L226 Difference]: Without dead ends: 114 [2021-12-15 14:05:02,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-15 14:05:02,670 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 153 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:02,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 169 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:05:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-15 14:05:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2021-12-15 14:05:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-12-15 14:05:02,673 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 15 [2021-12-15 14:05:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:02,673 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-12-15 14:05:02,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-12-15 14:05:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:05:02,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:02,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:02,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:02,879 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-12-15 14:05:02,879 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1200058809, now seen corresponding path program 1 times [2021-12-15 14:05:02,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:02,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834672423] [2021-12-15 14:05:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:02,880 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:02,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:02,881 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-12-15 14:05:02,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-15 14:05:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:02,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 14:05:02,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:02,974 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-12-15 14:05:02,991 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-12-15 14:05:02,997 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-12-15 14:05:03,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,023 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-12-15 14:05:03,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,031 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-12-15 14:05:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,052 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-12-15 14:05:03,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,060 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-12-15 14:05:03,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,137 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-12-15 14:05:03,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,143 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-12-15 14:05:03,156 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-12-15 14:05:03,263 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:03,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 19 treesize of output 13 [2021-12-15 14:05:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:03,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:03,272 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:03,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834672423] [2021-12-15 14:05:03,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834672423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:03,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:03,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:05:03,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300458468] [2021-12-15 14:05:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:03,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:05:03,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:05:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:05:03,274 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:03,465 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-15 14:05:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:05:03,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:05:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:03,467 INFO L225 Difference]: With dead ends: 107 [2021-12-15 14:05:03,467 INFO L226 Difference]: Without dead ends: 107 [2021-12-15 14:05:03,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:05:03,468 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:03,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 220 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2021-12-15 14:05:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-15 14:05:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2021-12-15 14:05:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2021-12-15 14:05:03,471 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 16 [2021-12-15 14:05:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:03,471 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2021-12-15 14:05:03,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2021-12-15 14:05:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:05:03,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:03,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:03,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:03,681 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-12-15 14:05:03,681 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1200058810, now seen corresponding path program 1 times [2021-12-15 14:05:03,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:03,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626332622] [2021-12-15 14:05:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:03,682 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:03,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:03,684 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-12-15 14:05:03,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-15 14:05:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:03,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 14:05:03,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:03,816 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-12-15 14:05:03,833 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-12-15 14:05:03,839 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-12-15 14:05:03,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,860 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-12-15 14:05:03,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,869 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-12-15 14:05:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,889 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-12-15 14:05:03,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,894 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-12-15 14:05:03,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,954 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-12-15 14:05:03,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:03,960 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-12-15 14:05:04,104 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:04,105 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 38 treesize of output 24 [2021-12-15 14:05:04,120 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:04,120 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 19 treesize of output 13 [2021-12-15 14:05:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:04,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:04,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626332622] [2021-12-15 14:05:04,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626332622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:04,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:04,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:05:04,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479434975] [2021-12-15 14:05:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:04,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:05:04,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:05:04,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:05:04,138 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:04,412 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2021-12-15 14:05:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:05:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:05:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:04,414 INFO L225 Difference]: With dead ends: 108 [2021-12-15 14:05:04,414 INFO L226 Difference]: Without dead ends: 108 [2021-12-15 14:05:04,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:05:04,414 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:04,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 255 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2021-12-15 14:05:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-15 14:05:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2021-12-15 14:05:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-15 14:05:04,417 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 16 [2021-12-15 14:05:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:04,417 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-15 14:05:04,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-15 14:05:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:05:04,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:04,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:04,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:04,627 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-12-15 14:05:04,627 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1452897384, now seen corresponding path program 1 times [2021-12-15 14:05:04,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169768146] [2021-12-15 14:05:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:04,628 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:04,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:04,629 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-12-15 14:05:04,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-15 14:05:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:04,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 14:05:04,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:04,749 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 11 [2021-12-15 14:05:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:04,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:04,768 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:04,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169768146] [2021-12-15 14:05:04,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169768146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:04,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:04,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:05:04,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738217143] [2021-12-15 14:05:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:04,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:05:04,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:04,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:05:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:05:04,770 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:05,229 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2021-12-15 14:05:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:05:05,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:05:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:05,231 INFO L225 Difference]: With dead ends: 141 [2021-12-15 14:05:05,231 INFO L226 Difference]: Without dead ends: 141 [2021-12-15 14:05:05,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:05:05,232 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 165 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:05,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 177 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:05:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-15 14:05:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2021-12-15 14:05:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2021-12-15 14:05:05,234 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 17 [2021-12-15 14:05:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:05,235 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2021-12-15 14:05:05,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2021-12-15 14:05:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:05:05,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:05,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:05,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:05,444 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-12-15 14:05:05,445 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1452897383, now seen corresponding path program 1 times [2021-12-15 14:05:05,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:05,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988064880] [2021-12-15 14:05:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:05,446 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:05,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:05,447 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-12-15 14:05:05,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-15 14:05:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:05,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 14:05:05,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:05,644 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 23 treesize of output 15 [2021-12-15 14:05:05,649 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 34 treesize of output 18 [2021-12-15 14:05:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:05,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:05,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:05,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988064880] [2021-12-15 14:05:05,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988064880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:05,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:05,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:05:05,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915759810] [2021-12-15 14:05:05,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:05,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:05:05,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:05,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:05:05,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:05:05,727 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:06,657 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2021-12-15 14:05:06,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:05:06,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:05:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:06,659 INFO L225 Difference]: With dead ends: 141 [2021-12-15 14:05:06,659 INFO L226 Difference]: Without dead ends: 141 [2021-12-15 14:05:06,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:05:06,660 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:06,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 198 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-15 14:05:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-15 14:05:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-15 14:05:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-15 14:05:06,663 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2021-12-15 14:05:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:06,663 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-15 14:05:06,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-15 14:05:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:05:06,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:06,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:06,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:06,876 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-12-15 14:05:06,876 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash -370010073, now seen corresponding path program 1 times [2021-12-15 14:05:06,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:06,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732610274] [2021-12-15 14:05:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:06,877 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:06,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:06,878 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-12-15 14:05:06,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-15 14:05:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:06,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-15 14:05:06,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:06,983 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-12-15 14:05:06,988 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-12-15 14:05:07,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:07,014 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-12-15 14:05:07,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:07,020 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-12-15 14:05:07,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:07,035 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-12-15 14:05:07,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:07,040 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-12-15 14:05:07,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:07,104 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-12-15 14:05:07,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:07,110 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-12-15 14:05:07,118 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-12-15 14:05:07,142 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-12-15 14:05:07,146 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-12-15 14:05:07,191 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-12-15 14:05:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:07,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:07,208 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:07,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732610274] [2021-12-15 14:05:07,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732610274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:07,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:07,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:05:07,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32808569] [2021-12-15 14:05:07,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:07,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:05:07,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:07,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:05:07,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:05:07,209 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:07,691 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2021-12-15 14:05:07,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:05:07,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 14:05:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:07,694 INFO L225 Difference]: With dead ends: 146 [2021-12-15 14:05:07,694 INFO L226 Difference]: Without dead ends: 146 [2021-12-15 14:05:07,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:05:07,695 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 154 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:07,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 357 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:05:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-15 14:05:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 105. [2021-12-15 14:05:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.380952380952381) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-12-15 14:05:07,697 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 19 [2021-12-15 14:05:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:07,698 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-12-15 14:05:07,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-12-15 14:05:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:05:07,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:07,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:07,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:07,908 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-12-15 14:05:07,908 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash -666970825, now seen corresponding path program 1 times [2021-12-15 14:05:07,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:07,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863522908] [2021-12-15 14:05:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:07,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:07,911 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-12-15 14:05:07,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-15 14:05:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:08,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 14:05:08,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:08,058 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 12 treesize of output 14 [2021-12-15 14:05:08,076 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 12 treesize of output 14 [2021-12-15 14:05:08,099 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:08,100 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 13 treesize of output 13 [2021-12-15 14:05:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:08,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:08,111 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:08,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863522908] [2021-12-15 14:05:08,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863522908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:08,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:08,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:05:08,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424750530] [2021-12-15 14:05:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:08,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:05:08,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:08,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:05:08,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:05:08,113 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:08,230 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2021-12-15 14:05:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:05:08,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 14:05:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:08,231 INFO L225 Difference]: With dead ends: 103 [2021-12-15 14:05:08,231 INFO L226 Difference]: Without dead ends: 103 [2021-12-15 14:05:08,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:08,232 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 112 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:08,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 51 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-15 14:05:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-15 14:05:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 102 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2021-12-15 14:05:08,235 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 19 [2021-12-15 14:05:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:08,236 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2021-12-15 14:05:08,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2021-12-15 14:05:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:05:08,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:08,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:08,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:08,446 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-12-15 14:05:08,447 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:08,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1858278108, now seen corresponding path program 1 times [2021-12-15 14:05:08,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261855338] [2021-12-15 14:05:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:08,448 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:08,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:08,449 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-12-15 14:05:08,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-15 14:05:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:08,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 14:05:08,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:08,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:08,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261855338] [2021-12-15 14:05:08,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261855338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:08,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:08,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:05:08,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609676700] [2021-12-15 14:05:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:08,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:05:08,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:05:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:05:08,554 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:08,561 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-12-15 14:05:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:05:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 14:05:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:08,562 INFO L225 Difference]: With dead ends: 105 [2021-12-15 14:05:08,562 INFO L226 Difference]: Without dead ends: 105 [2021-12-15 14:05:08,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:05:08,563 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:08,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:05:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-15 14:05:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-15 14:05:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-12-15 14:05:08,569 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 20 [2021-12-15 14:05:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:08,569 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-12-15 14:05:08,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-12-15 14:05:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:05:08,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:08,574 INFO L514 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-12-15 14:05:08,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:08,783 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-12-15 14:05:08,783 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1772093387, now seen corresponding path program 1 times [2021-12-15 14:05:08,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:08,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074153811] [2021-12-15 14:05:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:08,784 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:08,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:08,786 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-12-15 14:05:08,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-15 14:05:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:08,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:05:08,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:08,948 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 11 [2021-12-15 14:05:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:08,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:08,956 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074153811] [2021-12-15 14:05:08,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074153811] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:08,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:08,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:05:08,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036781920] [2021-12-15 14:05:08,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:08,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:05:08,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:08,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:05:08,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:08,958 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:09,154 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2021-12-15 14:05:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:05:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:05:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:09,155 INFO L225 Difference]: With dead ends: 104 [2021-12-15 14:05:09,155 INFO L226 Difference]: Without dead ends: 104 [2021-12-15 14:05:09,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:05:09,156 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:09,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 157 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:05:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-15 14:05:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-15 14:05:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-12-15 14:05:09,159 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 21 [2021-12-15 14:05:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:09,159 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-12-15 14:05:09,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-12-15 14:05:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:05:09,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:09,160 INFO L514 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-12-15 14:05:09,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:09,363 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-12-15 14:05:09,363 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1772093388, now seen corresponding path program 1 times [2021-12-15 14:05:09,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:09,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550204491] [2021-12-15 14:05:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:09,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:09,366 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-12-15 14:05:09,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-15 14:05:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:09,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 14:05:09,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:09,582 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 23 treesize of output 15 [2021-12-15 14:05:09,584 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 34 treesize of output 18 [2021-12-15 14:05:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:09,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:09,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:09,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550204491] [2021-12-15 14:05:09,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550204491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:09,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:09,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:05:09,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778736887] [2021-12-15 14:05:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:09,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:05:09,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:09,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:05:09,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:09,618 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:10,000 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2021-12-15 14:05:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:05:10,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:05:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:10,002 INFO L225 Difference]: With dead ends: 103 [2021-12-15 14:05:10,002 INFO L226 Difference]: Without dead ends: 103 [2021-12-15 14:05:10,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:05:10,003 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:10,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 161 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:05:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-15 14:05:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-15 14:05:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2021-12-15 14:05:10,006 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 21 [2021-12-15 14:05:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:10,006 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2021-12-15 14:05:10,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2021-12-15 14:05:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:05:10,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:10,007 INFO L514 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-12-15 14:05:10,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:10,216 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-12-15 14:05:10,216 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2133696844, now seen corresponding path program 1 times [2021-12-15 14:05:10,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:10,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060360835] [2021-12-15 14:05:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:10,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:10,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:10,218 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-12-15 14:05:10,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-15 14:05:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:10,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 14:05:10,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:10,350 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 11 [2021-12-15 14:05:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:10,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:10,368 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:10,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060360835] [2021-12-15 14:05:10,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060360835] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:10,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:10,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:10,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853919842] [2021-12-15 14:05:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:10,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:10,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:10,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:10,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:10,369 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:10,631 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-15 14:05:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:05:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:05:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:10,632 INFO L225 Difference]: With dead ends: 105 [2021-12-15 14:05:10,632 INFO L226 Difference]: Without dead ends: 105 [2021-12-15 14:05:10,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:05:10,633 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:10,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 145 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:05:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-15 14:05:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-12-15 14:05:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-12-15 14:05:10,636 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 23 [2021-12-15 14:05:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:10,636 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-12-15 14:05:10,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-12-15 14:05:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:05:10,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:10,637 INFO L514 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-12-15 14:05:10,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:10,845 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-12-15 14:05:10,846 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:10,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2133696845, now seen corresponding path program 1 times [2021-12-15 14:05:10,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:10,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383733503] [2021-12-15 14:05:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:10,847 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:10,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:10,848 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-12-15 14:05:10,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-15 14:05:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:10,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 14:05:10,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:11,073 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 23 treesize of output 15 [2021-12-15 14:05:11,075 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 34 treesize of output 18 [2021-12-15 14:05:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:11,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:11,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:11,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383733503] [2021-12-15 14:05:11,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383733503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:11,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:11,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:11,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87441191] [2021-12-15 14:05:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:11,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:11,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:11,159 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:11,761 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-15 14:05:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:05:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:05:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:11,763 INFO L225 Difference]: With dead ends: 105 [2021-12-15 14:05:11,764 INFO L226 Difference]: Without dead ends: 105 [2021-12-15 14:05:11,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:05:11,764 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:11,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:05:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-15 14:05:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-12-15 14:05:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.313953488372093) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-12-15 14:05:11,767 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 23 [2021-12-15 14:05:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:11,767 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-12-15 14:05:11,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2021-12-15 14:05:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:05:11,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:11,768 INFO L514 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-12-15 14:05:11,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-15 14:05:11,975 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-12-15 14:05:11,975 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -651056198, now seen corresponding path program 1 times [2021-12-15 14:05:11,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925976723] [2021-12-15 14:05:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:11,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:11,977 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-12-15 14:05:11,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-15 14:05:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:12,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 14:05:12,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:12,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:12,106 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:12,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925976723] [2021-12-15 14:05:12,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925976723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:12,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:12,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:05:12,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853519565] [2021-12-15 14:05:12,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:12,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:05:12,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:12,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:05:12,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:05:12,108 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:12,138 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2021-12-15 14:05:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:05:12,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:05:12,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:12,140 INFO L225 Difference]: With dead ends: 173 [2021-12-15 14:05:12,140 INFO L226 Difference]: Without dead ends: 173 [2021-12-15 14:05:12,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:05:12,141 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:12,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:05:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-15 14:05:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2021-12-15 14:05:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.3) internal successors, (130), 117 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2021-12-15 14:05:12,145 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 23 [2021-12-15 14:05:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:12,145 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2021-12-15 14:05:12,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2021-12-15 14:05:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:05:12,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:12,145 INFO L514 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-12-15 14:05:12,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:12,345 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-12-15 14:05:12,346 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1303799964, now seen corresponding path program 1 times [2021-12-15 14:05:12,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:12,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402244574] [2021-12-15 14:05:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:12,347 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:12,347 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-12-15 14:05:12,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-15 14:05:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:12,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-15 14:05:12,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:12,458 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-12-15 14:05:12,462 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-12-15 14:05:12,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:12,481 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-12-15 14:05:12,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:12,486 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-12-15 14:05:12,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:12,500 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-12-15 14:05:12,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:12,504 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-12-15 14:05:12,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:12,574 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-12-15 14:05:12,578 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-12-15 14:05:12,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:12,591 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-12-15 14:05:14,941 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:14,942 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 55 treesize of output 37 [2021-12-15 14:05:14,948 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:14,948 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 32 treesize of output 22 [2021-12-15 14:05:14,982 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 22 treesize of output 10 [2021-12-15 14:05:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:15,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:15,024 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:15,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402244574] [2021-12-15 14:05:15,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402244574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:15,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:15,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-15 14:05:15,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083501331] [2021-12-15 14:05:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:15,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:05:15,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:05:15,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:05:15,025 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:19,494 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2021-12-15 14:05:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:05:19,495 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 14:05:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:19,496 INFO L225 Difference]: With dead ends: 128 [2021-12-15 14:05:19,496 INFO L226 Difference]: Without dead ends: 128 [2021-12-15 14:05:19,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2021-12-15 14:05:19,496 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 52 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:19,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 453 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 80 Unchecked, 0.3s Time] [2021-12-15 14:05:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-15 14:05:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2021-12-15 14:05:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.292929292929293) internal successors, (128), 116 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2021-12-15 14:05:19,499 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 24 [2021-12-15 14:05:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:19,500 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2021-12-15 14:05:19,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2021-12-15 14:05:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:05:19,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:19,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:19,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:19,709 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-12-15 14:05:19,710 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1783269649, now seen corresponding path program 1 times [2021-12-15 14:05:19,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:19,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942125234] [2021-12-15 14:05:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:19,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:19,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:19,712 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-12-15 14:05:19,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-15 14:05:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:19,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 14:05:19,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:19,931 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 25 treesize of output 17 [2021-12-15 14:05:19,934 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-12-15 14:05:19,976 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-12-15 14:05:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:19,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:19,994 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:19,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942125234] [2021-12-15 14:05:19,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942125234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:19,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:19,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:05:19,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500473702] [2021-12-15 14:05:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:19,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:05:19,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:19,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:05:19,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:05:19,995 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:20,522 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2021-12-15 14:05:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:05:20,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:05:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:20,523 INFO L225 Difference]: With dead ends: 128 [2021-12-15 14:05:20,523 INFO L226 Difference]: Without dead ends: 128 [2021-12-15 14:05:20,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:05:20,524 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:20,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 301 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:05:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-15 14:05:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2021-12-15 14:05:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 107 states have (on average 1.280373831775701) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2021-12-15 14:05:20,527 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 25 [2021-12-15 14:05:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:20,528 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2021-12-15 14:05:20,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2021-12-15 14:05:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:05:20,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:20,528 INFO L514 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] [2021-12-15 14:05:20,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-15 14:05:20,731 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-12-15 14:05:20,731 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:20,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1432037180, now seen corresponding path program 1 times [2021-12-15 14:05:20,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634173175] [2021-12-15 14:05:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:20,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:20,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:20,734 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:05:20,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-15 14:05:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:20,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 14:05:20,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:20,872 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-12-15 14:05:20,919 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:20,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 14 [2021-12-15 14:05:20,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-15 14:05:21,034 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:21,035 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 27 treesize of output 28 [2021-12-15 14:05:21,117 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:21,117 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 30 treesize of output 28 [2021-12-15 14:05:21,152 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:21,153 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 30 treesize of output 28 [2021-12-15 14:05:21,205 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:21,206 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 27 treesize of output 28 [2021-12-15 14:05:21,227 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 24 treesize of output 12 [2021-12-15 14:05:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:21,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:21,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:05:21,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:05:21,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:05:21,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:05:21,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:05:21,355 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:21,355 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-15 14:05:21,369 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:21,369 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 245 treesize of output 220 [2021-12-15 14:05:21,384 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:21,384 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 204 treesize of output 197 [2021-12-15 14:05:21,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 188 treesize of output 180 [2021-12-15 14:05:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-15 14:05:21,643 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:21,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634173175] [2021-12-15 14:05:21,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634173175] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:21,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 14:05:21,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-12-15 14:05:21,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177571580] [2021-12-15 14:05:21,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:21,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 14:05:21,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:21,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 14:05:21,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=172, Unknown=5, NotChecked=150, Total=380 [2021-12-15 14:05:21,645 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:22,610 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2021-12-15 14:05:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 14:05:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:05:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:22,611 INFO L225 Difference]: With dead ends: 230 [2021-12-15 14:05:22,611 INFO L226 Difference]: Without dead ends: 230 [2021-12-15 14:05:22,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=389, Unknown=5, NotChecked=230, Total=756 [2021-12-15 14:05:22,612 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 180 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 741 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:22,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 569 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 607 Invalid, 0 Unknown, 741 Unchecked, 0.7s Time] [2021-12-15 14:05:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-15 14:05:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 139. [2021-12-15 14:05:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-12-15 14:05:22,622 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 25 [2021-12-15 14:05:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:22,623 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-12-15 14:05:22,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-12-15 14:05:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 14:05:22,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:22,623 INFO L514 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] [2021-12-15 14:05:22,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:22,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:05:22,834 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-12-15 14:05:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1443483791, now seen corresponding path program 1 times [2021-12-15 14:05:22,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:22,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631003982] [2021-12-15 14:05:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:22,834 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:22,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:22,835 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:05:22,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-15 14:05:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:22,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 14:05:22,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:22,966 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-12-15 14:05:23,022 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 14:05:23,023 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 20 treesize of output 27 [2021-12-15 14:05:23,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-15 14:05:23,159 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,159 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 31 treesize of output 32 [2021-12-15 14:05:23,255 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,255 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 34 treesize of output 32 [2021-12-15 14:05:23,301 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,301 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 34 treesize of output 32 [2021-12-15 14:05:23,361 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,361 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 31 treesize of output 32 [2021-12-15 14:05:23,388 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 28 treesize of output 16 [2021-12-15 14:05:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:23,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:23,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_900) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-15 14:05:23,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_900)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-15 14:05:23,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_900)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-15 14:05:23,625 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:23,625 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2021-12-15 14:05:23,637 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:23,637 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 268 treesize of output 243 [2021-12-15 14:05:23,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 228 treesize of output 220 [2021-12-15 14:05:23,657 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:23,657 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 220 treesize of output 212