./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/memsafety/test-0504.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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:52:06,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:52:06,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:52:06,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:52:06,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:52:06,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:52:06,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:52:06,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:52:06,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:52:06,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:52:06,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:52:06,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:52:06,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:52:06,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:52:06,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:52:06,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:52:06,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:52:06,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:52:06,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:52:06,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:52:06,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:52:06,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:52:06,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:52:06,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:52:06,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:52:06,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:52:06,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:52:06,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:52:06,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:52:06,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:52:06,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:52:06,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:52:06,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:52:06,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:52:06,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:52:06,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:52:06,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:52:06,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:52:06,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:52:06,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:52:06,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:52:06,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 05:52:06,298 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:52:06,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:52:06,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:52:06,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:52:06,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:52:06,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:52:06,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:52:06,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:52:06,301 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:52:06,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:52:06,302 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:52:06,302 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:52:06,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:52:06,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:52:06,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:52:06,302 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:52:06,303 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:52:06,303 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:52:06,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:52:06,303 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:52:06,303 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:52:06,303 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:52:06,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:52:06,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:52:06,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:52:06,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:52:06,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:52:06,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:52:06,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:52:06,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:52:06,306 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:52:06,306 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2021-12-16 05:52:06,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:52:06,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:52:06,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:52:06,541 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:52:06,541 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:52:06,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2021-12-16 05:52:06,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff04ca84/e8bbe514e7514379b6adfd4c2a886705/FLAG35195b8e1 [2021-12-16 05:52:06,939 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:52:06,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2021-12-16 05:52:06,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff04ca84/e8bbe514e7514379b6adfd4c2a886705/FLAG35195b8e1 [2021-12-16 05:52:07,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff04ca84/e8bbe514e7514379b6adfd4c2a886705 [2021-12-16 05:52:07,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:52:07,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:52:07,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:52:07,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:52:07,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:52:07,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f49ac66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07, skipping insertion in model container [2021-12-16 05:52:07,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:52:07,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:52:07,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:52:07,671 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:52:07,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:52:07,721 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:52:07,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07 WrapperNode [2021-12-16 05:52:07,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:52:07,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:52:07,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:52:07,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:52:07,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,773 INFO L137 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2021-12-16 05:52:07,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:52:07,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:52:07,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:52:07,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:52:07,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:52:07,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:52:07,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:52:07,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:52:07,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:52:07,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:07,848 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-16 05:52:07,889 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-16 05:52:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:52:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:52:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:52:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:52:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:52:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:52:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:52:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:52:07,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:52:07,998 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:52:07,999 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:52:08,193 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:52:08,197 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:52:08,198 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 05:52:08,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:08 BoogieIcfgContainer [2021-12-16 05:52:08,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:52:08,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:52:08,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:52:08,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:52:08,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:52:07" (1/3) ... [2021-12-16 05:52:08,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d160ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:08, skipping insertion in model container [2021-12-16 05:52:08,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07" (2/3) ... [2021-12-16 05:52:08,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d160ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:08, skipping insertion in model container [2021-12-16 05:52:08,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:08" (3/3) ... [2021-12-16 05:52:08,223 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504.i [2021-12-16 05:52:08,227 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:52:08,228 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-12-16 05:52:08,264 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:52:08,270 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-16 05:52:08,270 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-12-16 05:52:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 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-16 05:52:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:52:08,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:52:08,291 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2021-12-16 05:52:08,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081537639] [2021-12-16 05:52:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:08,381 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-16 05:52:08,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:08,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081537639] [2021-12-16 05:52:08,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081537639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:08,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:08,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:08,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260266512] [2021-12-16 05:52:08,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:08,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 05:52:08,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 05:52:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:52:08,405 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 05:52:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:08,416 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-16 05:52:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 05:52:08,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-16 05:52:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:08,422 INFO L225 Difference]: With dead ends: 87 [2021-12-16 05:52:08,423 INFO L226 Difference]: Without dead ends: 85 [2021-12-16 05:52:08,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:52:08,426 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:08,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-16 05:52:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-16 05:52:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2021-12-16 05:52:08,465 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2021-12-16 05:52:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:08,466 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-12-16 05:52:08,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 05:52:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2021-12-16 05:52:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:52:08,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:52:08,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:52:08,467 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2021-12-16 05:52:08,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227351963] [2021-12-16 05:52:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:08,532 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-16 05:52:08,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:08,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227351963] [2021-12-16 05:52:08,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227351963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:08,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:08,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:08,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896143935] [2021-12-16 05:52:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:08,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:08,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:08,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:08,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:08,536 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 05:52:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:08,554 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-16 05:52:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:08,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-16 05:52:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:08,556 INFO L225 Difference]: With dead ends: 133 [2021-12-16 05:52:08,556 INFO L226 Difference]: Without dead ends: 133 [2021-12-16 05:52:08,557 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-16 05:52:08,558 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:08,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-16 05:52:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2021-12-16 05:52:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 0 states have call successors, (0), 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-16 05:52:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2021-12-16 05:52:08,566 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2021-12-16 05:52:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:08,566 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2021-12-16 05:52:08,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 05:52:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2021-12-16 05:52:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:52:08,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:52:08,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:52:08,567 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:08,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2021-12-16 05:52:08,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220335728] [2021-12-16 05:52:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:08,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:08,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220335728] [2021-12-16 05:52:08,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220335728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:08,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:08,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:08,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845904822] [2021-12-16 05:52:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:08,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:08,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:08,596 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 05:52:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:08,663 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2021-12-16 05:52:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:08,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-16 05:52:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:08,664 INFO L225 Difference]: With dead ends: 130 [2021-12-16 05:52:08,665 INFO L226 Difference]: Without dead ends: 130 [2021-12-16 05:52:08,665 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-16 05:52:08,666 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:08,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-16 05:52:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2021-12-16 05:52:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 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-16 05:52:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2021-12-16 05:52:08,678 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2021-12-16 05:52:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:08,678 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2021-12-16 05:52:08,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 05:52:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2021-12-16 05:52:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:52:08,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:52:08,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:52:08,680 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,681 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2021-12-16 05:52:08,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576333092] [2021-12-16 05:52:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:08,730 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-16 05:52:08,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:08,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576333092] [2021-12-16 05:52:08,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576333092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:08,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:08,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:08,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364879972] [2021-12-16 05:52:08,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:08,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:08,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:08,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:08,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:08,733 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 05:52:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:08,815 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2021-12-16 05:52:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-16 05:52:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:08,817 INFO L225 Difference]: With dead ends: 138 [2021-12-16 05:52:08,818 INFO L226 Difference]: Without dead ends: 138 [2021-12-16 05:52:08,819 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-16 05:52:08,820 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:08,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-16 05:52:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2021-12-16 05:52:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 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-16 05:52:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2021-12-16 05:52:08,831 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2021-12-16 05:52:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:08,832 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2021-12-16 05:52:08,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 05:52:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2021-12-16 05:52:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:52:08,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:08,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:52:08,833 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2021-12-16 05:52:08,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247749008] [2021-12-16 05:52:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:08,861 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-16 05:52:08,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:08,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247749008] [2021-12-16 05:52:08,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247749008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:08,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:08,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:08,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232141005] [2021-12-16 05:52:08,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:08,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:08,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:08,865 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:52:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:08,906 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2021-12-16 05:52:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:08,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-16 05:52:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:08,908 INFO L225 Difference]: With dead ends: 103 [2021-12-16 05:52:08,908 INFO L226 Difference]: Without dead ends: 100 [2021-12-16 05:52:08,908 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-16 05:52:08,909 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:08,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-16 05:52:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-16 05:52:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 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-16 05:52:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2021-12-16 05:52:08,914 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2021-12-16 05:52:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:08,915 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2021-12-16 05:52:08,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:52:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2021-12-16 05:52:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 05:52:08,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:08,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:52:08,916 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2021-12-16 05:52:08,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711430071] [2021-12-16 05:52:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,016 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-16 05:52:09,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711430071] [2021-12-16 05:52:09,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711430071] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:52:09,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396425750] [2021-12-16 05:52:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:52:09,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:52:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:52:09,019 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-16 05:52:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,122 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2021-12-16 05:52:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-16 05:52:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,123 INFO L225 Difference]: With dead ends: 126 [2021-12-16 05:52:09,123 INFO L226 Difference]: Without dead ends: 126 [2021-12-16 05:52:09,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:52:09,124 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 154 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 68 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-16 05:52:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2021-12-16 05:52:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 05:52:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2021-12-16 05:52:09,129 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2021-12-16 05:52:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,129 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2021-12-16 05:52:09,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-16 05:52:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2021-12-16 05:52:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:52:09,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:52:09,130 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2021-12-16 05:52:09,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629414849] [2021-12-16 05:52:09,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:09,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629414849] [2021-12-16 05:52:09,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629414849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:09,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891060793] [2021-12-16 05:52:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,166 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,197 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2021-12-16 05:52:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 05:52:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,198 INFO L225 Difference]: With dead ends: 88 [2021-12-16 05:52:09,198 INFO L226 Difference]: Without dead ends: 88 [2021-12-16 05:52:09,199 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-16 05:52:09,199 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-16 05:52:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-16 05:52:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 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-16 05:52:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-16 05:52:09,211 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2021-12-16 05:52:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,211 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-16 05:52:09,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-16 05:52:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:52:09,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:52:09,212 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2021-12-16 05:52:09,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306969433] [2021-12-16 05:52:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,262 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-16 05:52:09,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306969433] [2021-12-16 05:52:09,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306969433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:09,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662005895] [2021-12-16 05:52:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,265 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,311 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2021-12-16 05:52:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 05:52:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,312 INFO L225 Difference]: With dead ends: 84 [2021-12-16 05:52:09,312 INFO L226 Difference]: Without dead ends: 84 [2021-12-16 05:52:09,312 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-16 05:52:09,312 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-16 05:52:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-16 05:52:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 05:52:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-12-16 05:52:09,330 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2021-12-16 05:52:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,330 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-12-16 05:52:09,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-12-16 05:52:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:52:09,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,331 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:52:09,332 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2021-12-16 05:52:09,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555805463] [2021-12-16 05:52:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:09,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555805463] [2021-12-16 05:52:09,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555805463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:09,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996163318] [2021-12-16 05:52:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:09,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:09,388 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-16 05:52:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,494 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-16 05:52:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-16 05:52:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,495 INFO L225 Difference]: With dead ends: 114 [2021-12-16 05:52:09,495 INFO L226 Difference]: Without dead ends: 114 [2021-12-16 05:52:09,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 05:52:09,496 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-16 05:52:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2021-12-16 05:52:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 05:52:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2021-12-16 05:52:09,499 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2021-12-16 05:52:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,499 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2021-12-16 05:52:09,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-16 05:52:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2021-12-16 05:52:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:52:09,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,500 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:52:09,500 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2021-12-16 05:52:09,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212754730] [2021-12-16 05:52:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:09,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212754730] [2021-12-16 05:52:09,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212754730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:09,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245939386] [2021-12-16 05:52:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:09,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:09,582 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-16 05:52:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,666 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2021-12-16 05:52:09,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:52:09,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-16 05:52:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,667 INFO L225 Difference]: With dead ends: 153 [2021-12-16 05:52:09,667 INFO L226 Difference]: Without dead ends: 153 [2021-12-16 05:52:09,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 05:52:09,668 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-16 05:52:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2021-12-16 05:52:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 05:52:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2021-12-16 05:52:09,673 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2021-12-16 05:52:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,673 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2021-12-16 05:52:09,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-16 05:52:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2021-12-16 05:52:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 05:52:09,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,674 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:52:09,674 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2021-12-16 05:52:09,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31514148] [2021-12-16 05:52:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:09,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31514148] [2021-12-16 05:52:09,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31514148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:52:09,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800724541] [2021-12-16 05:52:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:09,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:09,724 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-16 05:52:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,762 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-12-16 05:52:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:52:09,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-16 05:52:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,766 INFO L225 Difference]: With dead ends: 113 [2021-12-16 05:52:09,766 INFO L226 Difference]: Without dead ends: 113 [2021-12-16 05:52:09,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 05:52:09,767 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-16 05:52:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2021-12-16 05:52:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 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-16 05:52:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2021-12-16 05:52:09,773 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2021-12-16 05:52:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,774 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2021-12-16 05:52:09,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-16 05:52:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2021-12-16 05:52:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 05:52:09,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,776 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-16 05:52:09,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:52:09,777 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,777 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2021-12-16 05:52:09,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802426287] [2021-12-16 05:52:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,844 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-16 05:52:09,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802426287] [2021-12-16 05:52:09,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802426287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:52:09,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65601097] [2021-12-16 05:52:09,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:52:09,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:52:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:52:09,847 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-16 05:52:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,937 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-16 05:52:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:52:09,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-16 05:52:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,938 INFO L225 Difference]: With dead ends: 170 [2021-12-16 05:52:09,938 INFO L226 Difference]: Without dead ends: 170 [2021-12-16 05:52:09,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:52:09,939 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-16 05:52:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2021-12-16 05:52:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 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-16 05:52:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2021-12-16 05:52:09,941 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2021-12-16 05:52:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,941 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2021-12-16 05:52:09,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-16 05:52:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2021-12-16 05:52:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 05:52:09,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,942 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-16 05:52:09,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:52:09,943 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2021-12-16 05:52:09,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095440511] [2021-12-16 05:52:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,066 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-16 05:52:10,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095440511] [2021-12-16 05:52:10,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095440511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:52:10,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632592795] [2021-12-16 05:52:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:52:10,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:52:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:52:10,069 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-16 05:52:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,331 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2021-12-16 05:52:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:52:10,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-16 05:52:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,333 INFO L225 Difference]: With dead ends: 184 [2021-12-16 05:52:10,333 INFO L226 Difference]: Without dead ends: 184 [2021-12-16 05:52:10,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-12-16 05:52:10,333 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 179 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 199 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:52:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-16 05:52:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2021-12-16 05:52:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2021-12-16 05:52:10,335 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2021-12-16 05:52:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,336 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2021-12-16 05:52:10,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-16 05:52:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2021-12-16 05:52:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 05:52:10,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,336 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:10,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:52:10,336 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2021-12-16 05:52:10,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702317530] [2021-12-16 05:52:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:52:10,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702317530] [2021-12-16 05:52:10,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702317530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:10,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392342807] [2021-12-16 05:52:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:10,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:10,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:10,373 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-16 05:52:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,422 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2021-12-16 05:52:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 20 [2021-12-16 05:52:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,424 INFO L225 Difference]: With dead ends: 135 [2021-12-16 05:52:10,424 INFO L226 Difference]: Without dead ends: 135 [2021-12-16 05:52:10,424 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-16 05:52:10,424 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-16 05:52:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2021-12-16 05:52:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 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-16 05:52:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2021-12-16 05:52:10,427 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2021-12-16 05:52:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,427 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2021-12-16 05:52:10,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-16 05:52:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2021-12-16 05:52:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 05:52:10,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,428 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:10,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:52:10,428 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2021-12-16 05:52:10,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259238598] [2021-12-16 05:52:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259238598] [2021-12-16 05:52:10,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259238598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:52:10,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728385759] [2021-12-16 05:52:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:52:10,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:52:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:52:10,467 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-16 05:52:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,591 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2021-12-16 05:52:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:52:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-16 05:52:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,592 INFO L225 Difference]: With dead ends: 194 [2021-12-16 05:52:10,592 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 05:52:10,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:10,593 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 05:52:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2021-12-16 05:52:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 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-16 05:52:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2021-12-16 05:52:10,601 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2021-12-16 05:52:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,601 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2021-12-16 05:52:10,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-16 05:52:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2021-12-16 05:52:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 05:52:10,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,602 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] [2021-12-16 05:52:10,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:52:10,602 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2021-12-16 05:52:10,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936805848] [2021-12-16 05:52:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936805848] [2021-12-16 05:52:10,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936805848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:52:10,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577466588] [2021-12-16 05:52:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:52:10,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:52:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:52:10,668 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-16 05:52:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,807 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2021-12-16 05:52:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:52:10,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-16 05:52:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,808 INFO L225 Difference]: With dead ends: 195 [2021-12-16 05:52:10,808 INFO L226 Difference]: Without dead ends: 195 [2021-12-16 05:52:10,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-16 05:52:10,808 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 93 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 236 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-16 05:52:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2021-12-16 05:52:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 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-16 05:52:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2021-12-16 05:52:10,811 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2021-12-16 05:52:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,811 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2021-12-16 05:52:10,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-16 05:52:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2021-12-16 05:52:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:52:10,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,811 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] [2021-12-16 05:52:10,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:52:10,811 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2021-12-16 05:52:10,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623978397] [2021-12-16 05:52:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623978397] [2021-12-16 05:52:10,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623978397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:52:10,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325762045] [2021-12-16 05:52:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:52:10,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:52:10,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:52:10,855 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-16 05:52:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,940 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2021-12-16 05:52:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:52:10,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-16 05:52:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,942 INFO L225 Difference]: With dead ends: 167 [2021-12-16 05:52:10,942 INFO L226 Difference]: Without dead ends: 167 [2021-12-16 05:52:10,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:10,943 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-16 05:52:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2021-12-16 05:52:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 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-16 05:52:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2021-12-16 05:52:10,945 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2021-12-16 05:52:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,945 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2021-12-16 05:52:10,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-16 05:52:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2021-12-16 05:52:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:52:10,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,946 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, 1] [2021-12-16 05:52:10,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:52:10,947 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2021-12-16 05:52:10,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483258295] [2021-12-16 05:52:10,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:11,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:11,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483258295] [2021-12-16 05:52:11,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483258295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:11,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551368193] [2021-12-16 05:52:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:11,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:11,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:11,072 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-16 05:52:11,075 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-16 05:52:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:11,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-16 05:52:11,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:11,267 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-16 05:52:11,274 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-16 05:52:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 05:52:11,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,317 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 23 treesize of output 22 [2021-12-16 05:52:11,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,345 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-16 05:52:11,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,359 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-16 05:52:11,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,376 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 23 treesize of output 22 [2021-12-16 05:52:11,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,393 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 23 treesize of output 22 [2021-12-16 05:52:11,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,412 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 23 treesize of output 22 [2021-12-16 05:52:11,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:11,417 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 23 treesize of output 22 [2021-12-16 05:52:11,487 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-16 05:52:11,490 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-16 05:52:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:11,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:11,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551368193] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:11,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:11,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2021-12-16 05:52:11,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367120969] [2021-12-16 05:52:11,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:11,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:52:11,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:52:11,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:52:11,752 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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-16 05:52:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:11,931 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2021-12-16 05:52:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:52:11,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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 27 [2021-12-16 05:52:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:11,933 INFO L225 Difference]: With dead ends: 186 [2021-12-16 05:52:11,933 INFO L226 Difference]: Without dead ends: 186 [2021-12-16 05:52:11,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:52:11,934 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 183 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:11,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 266 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-16 05:52:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2021-12-16 05:52:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 states have internal predecessors, (195), 0 states have call successors, (0), 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-16 05:52:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2021-12-16 05:52:11,939 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2021-12-16 05:52:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:11,940 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2021-12-16 05:52:11,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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-16 05:52:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2021-12-16 05:52:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:52:11,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:11,942 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-16 05:52:11,970 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-16 05:52:12,167 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,SelfDestructingSolverStorable17 [2021-12-16 05:52:12,167 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2021-12-16 05:52:12,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:12,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144916338] [2021-12-16 05:52:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:12,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:12,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:12,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144916338] [2021-12-16 05:52:12,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144916338] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:12,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648629790] [2021-12-16 05:52:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:12,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:12,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:12,268 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-16 05:52:12,283 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-16 05:52:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:12,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 05:52:12,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:12,397 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-16 05:52:12,443 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:12,443 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 17 treesize of output 21 [2021-12-16 05:52:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:12,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:12,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648629790] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:12,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:12,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-16 05:52:12,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300455687] [2021-12-16 05:52:12,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:12,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:52:12,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:12,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:52:12,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:52:12,654 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 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-16 05:52:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:12,719 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2021-12-16 05:52:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:52:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 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 27 [2021-12-16 05:52:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:12,721 INFO L225 Difference]: With dead ends: 181 [2021-12-16 05:52:12,721 INFO L226 Difference]: Without dead ends: 181 [2021-12-16 05:52:12,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:12,722 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 175 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:12,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 141 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-12-16 05:52:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-16 05:52:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2021-12-16 05:52:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 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-16 05:52:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2021-12-16 05:52:12,727 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2021-12-16 05:52:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:12,727 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2021-12-16 05:52:12,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 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-16 05:52:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2021-12-16 05:52:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:52:12,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:12,729 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-16 05:52:12,770 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-16 05:52:12,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:12,953 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:12,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2021-12-16 05:52:12,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:12,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35591085] [2021-12-16 05:52:12,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:12,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:13,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35591085] [2021-12-16 05:52:13,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35591085] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:13,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269470621] [2021-12-16 05:52:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:13,021 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:13,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:13,022 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-16 05:52:13,064 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-16 05:52:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:13,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 05:52:13,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:13,172 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-16 05:52:13,181 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-16 05:52:13,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:13,262 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-16 05:52:13,267 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:13,268 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 11 treesize of output 11 [2021-12-16 05:52:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:13,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:13,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269470621] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:13,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:13,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-16 05:52:13,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996165260] [2021-12-16 05:52:13,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:13,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:52:13,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:52:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:52:13,611 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 05:52:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:13,739 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-12-16 05:52:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:52:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 27 [2021-12-16 05:52:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:13,740 INFO L225 Difference]: With dead ends: 247 [2021-12-16 05:52:13,740 INFO L226 Difference]: Without dead ends: 247 [2021-12-16 05:52:13,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:52:13,741 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:13,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 200 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2021-12-16 05:52:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-16 05:52:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 192. [2021-12-16 05:52:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 177 states have (on average 1.2937853107344632) internal successors, (229), 191 states have internal predecessors, (229), 0 states have call successors, (0), 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-16 05:52:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2021-12-16 05:52:13,744 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 27 [2021-12-16 05:52:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:13,744 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2021-12-16 05:52:13,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 05:52:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2021-12-16 05:52:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:52:13,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:13,745 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-16 05:52:13,763 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-16 05:52:13,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:13,962 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2021-12-16 05:52:13,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:13,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324802902] [2021-12-16 05:52:13,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:13,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:14,014 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-16 05:52:14,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:14,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324802902] [2021-12-16 05:52:14,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324802902] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:14,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074486415] [2021-12-16 05:52:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:14,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:14,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:14,027 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-16 05:52:14,036 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-16 05:52:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:14,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 05:52:14,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:14,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-16 05:52:14,239 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-16 05:52:14,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:14,352 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-16 05:52:14,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074486415] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:14,352 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:14,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2021-12-16 05:52:14,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915726593] [2021-12-16 05:52:14,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:14,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:52:14,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:14,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:52:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:14,353 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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-16 05:52:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:14,477 INFO L93 Difference]: Finished difference Result 194 states and 230 transitions. [2021-12-16 05:52:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:52:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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-16 05:52:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:14,478 INFO L225 Difference]: With dead ends: 194 [2021-12-16 05:52:14,478 INFO L226 Difference]: Without dead ends: 182 [2021-12-16 05:52:14,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:52:14,479 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:14,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 230 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2021-12-16 05:52:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-16 05:52:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-16 05:52:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 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-16 05:52:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2021-12-16 05:52:14,482 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 28 [2021-12-16 05:52:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:14,482 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2021-12-16 05:52:14,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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-16 05:52:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2021-12-16 05:52:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 05:52:14,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:14,483 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, 1, 1, 1, 1, 1] [2021-12-16 05:52:14,513 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-16 05:52:14,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:14,699 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2021-12-16 05:52:14,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:14,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837906201] [2021-12-16 05:52:14,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:14,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:14,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837906201] [2021-12-16 05:52:14,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837906201] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:14,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611101965] [2021-12-16 05:52:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:14,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:14,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:14,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 05:52:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:14,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-16 05:52:14,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:14,965 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-16 05:52:14,970 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-16 05:52:15,005 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-16 05:52:15,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:15,022 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-16 05:52:15,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:15,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-16 05:52:15,064 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:15,065 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 11 treesize of output 11 [2021-12-16 05:52:15,069 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 14 treesize of output 16 [2021-12-16 05:52:15,125 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 23 treesize of output 18 [2021-12-16 05:52:15,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 05:52:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:15,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:15,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611101965] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:15,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:15,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 4] total 17 [2021-12-16 05:52:15,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105969363] [2021-12-16 05:52:15,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:15,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 05:52:15,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 05:52:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:52:15,485 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 05:52:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:15,947 INFO L93 Difference]: Finished difference Result 307 states and 363 transitions. [2021-12-16 05:52:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 05:52:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 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 31 [2021-12-16 05:52:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:15,950 INFO L225 Difference]: With dead ends: 307 [2021-12-16 05:52:15,950 INFO L226 Difference]: Without dead ends: 307 [2021-12-16 05:52:15,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2021-12-16 05:52:15,950 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 431 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:15,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 397 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 472 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2021-12-16 05:52:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-16 05:52:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2021-12-16 05:52:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 197 states have (on average 1.284263959390863) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 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-16 05:52:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-12-16 05:52:15,954 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 31 [2021-12-16 05:52:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:15,954 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-12-16 05:52:15,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 05:52:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-12-16 05:52:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:52:15,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:15,955 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:15,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:16,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-16 05:52:16,163 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2021-12-16 05:52:16,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:16,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134310928] [2021-12-16 05:52:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:16,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:16,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:16,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134310928] [2021-12-16 05:52:16,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134310928] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:16,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778000651] [2021-12-16 05:52:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:16,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:16,248 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:16,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 05:52:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:16,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 05:52:16,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:16,397 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-16 05:52:16,414 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-16 05:52:16,431 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-12-16 05:52:16,431 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 21 treesize of output 29 [2021-12-16 05:52:16,466 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:52:16,466 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 33 treesize of output 24 [2021-12-16 05:52:16,488 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-16 05:52:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:16,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:16,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778000651] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:16,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:16,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-16 05:52:16,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749563704] [2021-12-16 05:52:16,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:16,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 05:52:16,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:16,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 05:52:16,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:52:16,635 INFO L87 Difference]: Start difference. First operand 212 states and 253 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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-16 05:52:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:16,768 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2021-12-16 05:52:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:52:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 32 [2021-12-16 05:52:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:16,770 INFO L225 Difference]: With dead ends: 230 [2021-12-16 05:52:16,770 INFO L226 Difference]: Without dead ends: 230 [2021-12-16 05:52:16,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-12-16 05:52:16,770 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:16,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 317 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 167 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2021-12-16 05:52:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-16 05:52:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 211. [2021-12-16 05:52:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 197 states have (on average 1.2741116751269035) internal successors, (251), 210 states have internal predecessors, (251), 0 states have call successors, (0), 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-16 05:52:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2021-12-16 05:52:16,774 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 32 [2021-12-16 05:52:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:16,774 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2021-12-16 05:52:16,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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-16 05:52:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2021-12-16 05:52:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:52:16,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:16,775 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:16,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:16,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:16,992 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:16,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2021-12-16 05:52:16,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:16,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769547894] [2021-12-16 05:52:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:16,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:17,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:17,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769547894] [2021-12-16 05:52:17,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769547894] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:17,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189230204] [2021-12-16 05:52:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:17,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:17,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:17,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 05:52:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:17,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-16 05:52:17,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:17,236 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-16 05:52:17,240 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-16 05:52:17,302 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-16 05:52:17,306 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-16 05:52:17,338 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-16 05:52:17,338 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 15 treesize of output 15 [2021-12-16 05:52:17,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-16 05:52:17,405 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:52:17,405 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 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-16 05:52:17,417 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:52:17,417 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 33 treesize of output 24 [2021-12-16 05:52:17,469 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:52:17,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-16 05:52:17,473 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:52:17,473 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 36 treesize of output 16 [2021-12-16 05:52:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:17,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:17,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189230204] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:17,833 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:17,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2021-12-16 05:52:17,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236000399] [2021-12-16 05:52:17,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:17,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 05:52:17,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 05:52:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:52:17,835 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 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-16 05:52:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:18,170 INFO L93 Difference]: Finished difference Result 276 states and 328 transitions. [2021-12-16 05:52:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:52:18,170 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 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 32 [2021-12-16 05:52:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:18,171 INFO L225 Difference]: With dead ends: 276 [2021-12-16 05:52:18,171 INFO L226 Difference]: Without dead ends: 276 [2021-12-16 05:52:18,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2021-12-16 05:52:18,172 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 146 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:18,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 471 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 156 Unchecked, 0.1s Time] [2021-12-16 05:52:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-16 05:52:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 210. [2021-12-16 05:52:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 197 states have (on average 1.263959390862944) internal successors, (249), 209 states have internal predecessors, (249), 0 states have call successors, (0), 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-16 05:52:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 249 transitions. [2021-12-16 05:52:18,175 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 249 transitions. Word has length 32 [2021-12-16 05:52:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:18,175 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 249 transitions. [2021-12-16 05:52:18,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 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-16 05:52:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 249 transitions. [2021-12-16 05:52:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:52:18,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:18,176 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:18,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:18,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:18,383 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2021-12-16 05:52:18,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109602597] [2021-12-16 05:52:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:18,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:18,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:18,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109602597] [2021-12-16 05:52:18,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109602597] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154561507] [2021-12-16 05:52:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:18,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:18,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:18,507 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:18,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 05:52:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:18,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 05:52:18,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:52:18,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:52:18,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154561507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:18,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:52:18,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2021-12-16 05:52:18,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064090418] [2021-12-16 05:52:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:18,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:52:18,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:18,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:52:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:52:18,758 INFO L87 Difference]: Start difference. First operand 210 states and 249 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:52:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:18,863 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2021-12-16 05:52:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:52:18,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 33 [2021-12-16 05:52:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:18,864 INFO L225 Difference]: With dead ends: 224 [2021-12-16 05:52:18,864 INFO L226 Difference]: Without dead ends: 224 [2021-12-16 05:52:18,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:52:18,865 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 120 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:18,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-16 05:52:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 210. [2021-12-16 05:52:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 197 states have (on average 1.2588832487309645) internal successors, (248), 209 states have internal predecessors, (248), 0 states have call successors, (0), 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-16 05:52:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 248 transitions. [2021-12-16 05:52:18,868 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 248 transitions. Word has length 33 [2021-12-16 05:52:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:18,868 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 248 transitions. [2021-12-16 05:52:18,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:52:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 248 transitions. [2021-12-16 05:52:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 05:52:18,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:18,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:18,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:19,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-16 05:52:19,087 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2021-12-16 05:52:19,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439376919] [2021-12-16 05:52:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:19,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:52:19,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:19,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439376919] [2021-12-16 05:52:19,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439376919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:19,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:19,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:52:19,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870086929] [2021-12-16 05:52:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:19,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:52:19,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:52:19,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:52:19,130 INFO L87 Difference]: Start difference. First operand 210 states and 248 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-16 05:52:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:19,185 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2021-12-16 05:52:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:52:19,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 36 [2021-12-16 05:52:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:19,186 INFO L225 Difference]: With dead ends: 216 [2021-12-16 05:52:19,186 INFO L226 Difference]: Without dead ends: 216 [2021-12-16 05:52:19,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:19,188 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 106 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:19,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-16 05:52:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 181. [2021-12-16 05:52:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 180 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 05:52:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2021-12-16 05:52:19,192 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 36 [2021-12-16 05:52:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:19,192 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2021-12-16 05:52:19,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-16 05:52:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2021-12-16 05:52:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 05:52:19,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:19,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:19,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 05:52:19,193 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2021-12-16 05:52:19,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:19,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005472044] [2021-12-16 05:52:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:19,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:19,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:19,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005472044] [2021-12-16 05:52:19,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005472044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:19,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:19,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:52:19,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370266513] [2021-12-16 05:52:19,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:19,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:52:19,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:19,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:52:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:19,261 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 05:52:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:19,475 INFO L93 Difference]: Finished difference Result 215 states and 243 transitions. [2021-12-16 05:52:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:52:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 05:52:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:19,476 INFO L225 Difference]: With dead ends: 215 [2021-12-16 05:52:19,476 INFO L226 Difference]: Without dead ends: 215 [2021-12-16 05:52:19,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:52:19,477 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:19,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 177 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:52:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-12-16 05:52:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 190. [2021-12-16 05:52:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 177 states have (on average 1.2429378531073447) internal successors, (220), 189 states have internal predecessors, (220), 0 states have call successors, (0), 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-16 05:52:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2021-12-16 05:52:19,480 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 36 [2021-12-16 05:52:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:19,481 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2021-12-16 05:52:19,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 05:52:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2021-12-16 05:52:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 05:52:19,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:19,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:19,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-16 05:52:19,481 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2021-12-16 05:52:19,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:19,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290061585] [2021-12-16 05:52:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:19,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:19,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:19,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290061585] [2021-12-16 05:52:19,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290061585] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:19,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:19,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:52:19,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440028591] [2021-12-16 05:52:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:19,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:52:19,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:19,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:52:19,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:19,585 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 05:52:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:19,788 INFO L93 Difference]: Finished difference Result 259 states and 293 transitions. [2021-12-16 05:52:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:52:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 05:52:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:19,789 INFO L225 Difference]: With dead ends: 259 [2021-12-16 05:52:19,789 INFO L226 Difference]: Without dead ends: 259 [2021-12-16 05:52:19,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:52:19,790 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:19,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 249 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-16 05:52:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 190. [2021-12-16 05:52:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 177 states have (on average 1.2372881355932204) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 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-16 05:52:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2021-12-16 05:52:19,793 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 36 [2021-12-16 05:52:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:19,793 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2021-12-16 05:52:19,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 05:52:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2021-12-16 05:52:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 05:52:19,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:19,793 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:19,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-16 05:52:19,794 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2021-12-16 05:52:19,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:19,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018199366] [2021-12-16 05:52:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:19,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:20,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:20,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018199366] [2021-12-16 05:52:20,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018199366] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:20,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570587778] [2021-12-16 05:52:20,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:20,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:20,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:20,071 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:20,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 05:52:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:20,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-16 05:52:20,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:20,271 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-16 05:52:20,288 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-16 05:52:20,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:20,305 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-16 05:52:20,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:20,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 05:52:20,417 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:20,417 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 17 treesize of output 21 [2021-12-16 05:52:20,473 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 23 treesize of output 23 [2021-12-16 05:52:20,501 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 23 treesize of output 23 [2021-12-16 05:52:20,543 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 23 treesize of output 23 [2021-12-16 05:52:20,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 23 treesize of output 23 [2021-12-16 05:52:20,590 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 23 treesize of output 23 [2021-12-16 05:52:20,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:20,706 INFO L354 Elim1Store]: treesize reduction 34, result has 46.0 percent of original size [2021-12-16 05:52:20,706 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 2 case distinctions, treesize of input 30 treesize of output 44 [2021-12-16 05:52:20,792 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:20,793 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 62 treesize of output 59 [2021-12-16 05:52:21,185 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:21,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2021-12-16 05:52:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:21,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:23,917 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-16 05:52:23,917 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 2 case distinctions, treesize of input 57 treesize of output 50 [2021-12-16 05:52:23,923 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 90 treesize of output 86 [2021-12-16 05:52:23,928 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 55 treesize of output 51 [2021-12-16 05:52:23,933 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 47 treesize of output 45 [2021-12-16 05:52:23,937 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 78 treesize of output 74 [2021-12-16 05:52:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:26,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570587778] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:26,004 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:26,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2021-12-16 05:52:26,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449863595] [2021-12-16 05:52:26,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:26,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-16 05:52:26,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:26,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-16 05:52:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=866, Unknown=19, NotChecked=0, Total=992 [2021-12-16 05:52:26,005 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 05:52:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:26,832 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2021-12-16 05:52:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-16 05:52:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 states have internal predecessors, (107), 0 states have call successors, (0), 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 38 [2021-12-16 05:52:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:26,834 INFO L225 Difference]: With dead ends: 239 [2021-12-16 05:52:26,834 INFO L226 Difference]: Without dead ends: 239 [2021-12-16 05:52:26,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=316, Invalid=1914, Unknown=26, NotChecked=0, Total=2256 [2021-12-16 05:52:26,841 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:26,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 690 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 268 Invalid, 0 Unknown, 333 Unchecked, 0.2s Time] [2021-12-16 05:52:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-16 05:52:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-12-16 05:52:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 232 states have internal predecessors, (268), 0 states have call successors, (0), 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-16 05:52:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2021-12-16 05:52:26,859 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 38 [2021-12-16 05:52:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:26,859 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2021-12-16 05:52:26,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 05:52:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2021-12-16 05:52:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 05:52:26,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:26,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:26,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:27,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-16 05:52:27,090 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2021-12-16 05:52:27,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:27,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779376502] [2021-12-16 05:52:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:27,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:27,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:27,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779376502] [2021-12-16 05:52:27,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779376502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:27,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:27,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:52:27,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617941120] [2021-12-16 05:52:27,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:27,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:52:27,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:52:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:52:27,162 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 05:52:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:27,423 INFO L93 Difference]: Finished difference Result 341 states and 383 transitions. [2021-12-16 05:52:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:52:27,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-12-16 05:52:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:27,424 INFO L225 Difference]: With dead ends: 341 [2021-12-16 05:52:27,424 INFO L226 Difference]: Without dead ends: 341 [2021-12-16 05:52:27,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2021-12-16 05:52:27,425 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:27,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 424 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:52:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-16 05:52:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 235. [2021-12-16 05:52:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 234 states have internal predecessors, (270), 0 states have call successors, (0), 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-16 05:52:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2021-12-16 05:52:27,428 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 38 [2021-12-16 05:52:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:27,428 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2021-12-16 05:52:27,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 05:52:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2021-12-16 05:52:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 05:52:27,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:27,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:27,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-16 05:52:27,429 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2021-12-16 05:52:27,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:27,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753765201] [2021-12-16 05:52:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:27,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:27,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:27,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753765201] [2021-12-16 05:52:27,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753765201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:27,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:27,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:52:27,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696024412] [2021-12-16 05:52:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:27,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:52:27,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:52:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:52:27,494 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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-16 05:52:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:27,767 INFO L93 Difference]: Finished difference Result 340 states and 382 transitions. [2021-12-16 05:52:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 05:52:27,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-12-16 05:52:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:27,769 INFO L225 Difference]: With dead ends: 340 [2021-12-16 05:52:27,769 INFO L226 Difference]: Without dead ends: 340 [2021-12-16 05:52:27,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:52:27,769 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:27,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 355 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:52:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-12-16 05:52:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 236. [2021-12-16 05:52:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 223 states have (on average 1.2152466367713004) internal successors, (271), 235 states have internal predecessors, (271), 0 states have call successors, (0), 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-16 05:52:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 271 transitions. [2021-12-16 05:52:27,772 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 271 transitions. Word has length 39 [2021-12-16 05:52:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:27,772 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 271 transitions. [2021-12-16 05:52:27,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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-16 05:52:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2021-12-16 05:52:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-16 05:52:27,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:27,773 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:27,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-16 05:52:27,773 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1467279643, now seen corresponding path program 1 times [2021-12-16 05:52:27,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:27,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14934568] [2021-12-16 05:52:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:27,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:27,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14934568] [2021-12-16 05:52:27,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14934568] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681606832] [2021-12-16 05:52:27,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:27,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:27,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:27,870 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:27,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-16 05:52:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:28,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-16 05:52:28,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:28,053 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-16 05:52:28,057 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-16 05:52:28,159 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:52:28,160 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 18 [2021-12-16 05:52:28,186 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:28,186 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 17 treesize of output 21 [2021-12-16 05:52:28,236 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-16 05:52:28,271 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:52:28,272 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:52:28,287 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:52:28,287 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:52:28,328 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:28,329 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-16 05:52:28,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-16 05:52:28,395 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:52:28,396 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 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-16 05:52:28,436 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:52:28,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2021-12-16 05:52:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:28,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:28,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681606832] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:28,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:28,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 4] total 16 [2021-12-16 05:52:28,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029887969] [2021-12-16 05:52:28,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:28,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-16 05:52:28,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:28,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 05:52:28,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-16 05:52:28,958 INFO L87 Difference]: Start difference. First operand 236 states and 271 transitions. Second operand has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 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-16 05:52:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:29,227 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2021-12-16 05:52:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:52:29,227 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 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) Word has length 40 [2021-12-16 05:52:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:29,228 INFO L225 Difference]: With dead ends: 252 [2021-12-16 05:52:29,228 INFO L226 Difference]: Without dead ends: 252 [2021-12-16 05:52:29,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-12-16 05:52:29,229 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 212 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:29,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 304 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 182 Invalid, 0 Unknown, 168 Unchecked, 0.1s Time] [2021-12-16 05:52:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-16 05:52:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 194. [2021-12-16 05:52:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 181 states have (on average 1.2265193370165746) internal successors, (222), 193 states have internal predecessors, (222), 0 states have call successors, (0), 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-16 05:52:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2021-12-16 05:52:29,233 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 40 [2021-12-16 05:52:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:29,233 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2021-12-16 05:52:29,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 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-16 05:52:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2021-12-16 05:52:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-16 05:52:29,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:29,234 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:29,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:29,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-16 05:52:29,443 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2021-12-16 05:52:29,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:29,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671564974] [2021-12-16 05:52:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:29,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:29,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:29,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671564974] [2021-12-16 05:52:29,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671564974] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:29,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649247705] [2021-12-16 05:52:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:29,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:29,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:29,516 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:29,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-16 05:52:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:29,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 05:52:29,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:29,685 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-16 05:52:29,728 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:29,728 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 11 treesize of output 11 [2021-12-16 05:52:29,780 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-16 05:52:29,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:29,831 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 16 treesize of output 16 [2021-12-16 05:52:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:29,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:29,969 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 11 treesize of output 9 [2021-12-16 05:52:29,971 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 20 treesize of output 18 [2021-12-16 05:52:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:30,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649247705] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:30,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:30,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2021-12-16 05:52:30,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301865868] [2021-12-16 05:52:30,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:30,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-16 05:52:30,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 05:52:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-12-16 05:52:30,134 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 05:52:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:30,652 INFO L93 Difference]: Finished difference Result 275 states and 306 transitions. [2021-12-16 05:52:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:52:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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 40 [2021-12-16 05:52:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:30,653 INFO L225 Difference]: With dead ends: 275 [2021-12-16 05:52:30,653 INFO L226 Difference]: Without dead ends: 275 [2021-12-16 05:52:30,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2021-12-16 05:52:30,654 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 302 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:30,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 680 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 785 Invalid, 0 Unknown, 23 Unchecked, 0.3s Time] [2021-12-16 05:52:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-16 05:52:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2021-12-16 05:52:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 181 states have (on average 1.2209944751381216) internal successors, (221), 193 states have internal predecessors, (221), 0 states have call successors, (0), 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-16 05:52:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2021-12-16 05:52:30,657 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 40 [2021-12-16 05:52:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:30,657 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2021-12-16 05:52:30,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 05:52:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2021-12-16 05:52:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-16 05:52:30,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:30,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:30,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:30,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-16 05:52:30,864 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2021-12-16 05:52:30,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:30,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292748724] [2021-12-16 05:52:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:30,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 05:52:30,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:30,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292748724] [2021-12-16 05:52:30,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292748724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:30,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:30,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:30,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900993508] [2021-12-16 05:52:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:30,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:30,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:30,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:30,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:30,893 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 05:52:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:30,937 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2021-12-16 05:52:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:30,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 40 [2021-12-16 05:52:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:30,939 INFO L225 Difference]: With dead ends: 193 [2021-12-16 05:52:30,939 INFO L226 Difference]: Without dead ends: 193 [2021-12-16 05:52:30,939 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-16 05:52:30,939 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:30,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-16 05:52:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-12-16 05:52:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 181 states have (on average 1.2099447513812154) internal successors, (219), 192 states have internal predecessors, (219), 0 states have call successors, (0), 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-16 05:52:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2021-12-16 05:52:30,942 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 40 [2021-12-16 05:52:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:30,942 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2021-12-16 05:52:30,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 05:52:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2021-12-16 05:52:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 05:52:30,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:30,943 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:30,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-16 05:52:30,943 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:30,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2021-12-16 05:52:30,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:30,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895776968] [2021-12-16 05:52:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:30,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:31,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:31,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895776968] [2021-12-16 05:52:31,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895776968] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:31,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738657484] [2021-12-16 05:52:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:31,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:31,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:31,153 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-16 05:52:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:31,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-16 05:52:31,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:31,339 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-16 05:52:31,349 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-16 05:52:31,352 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-16 05:52:31,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,377 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 23 treesize of output 22 [2021-12-16 05:52:31,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,382 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 23 treesize of output 22 [2021-12-16 05:52:31,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,412 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-16 05:52:31,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,418 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-16 05:52:31,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,429 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 23 treesize of output 22 [2021-12-16 05:52:31,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,433 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 23 treesize of output 22 [2021-12-16 05:52:31,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,444 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 23 treesize of output 22 [2021-12-16 05:52:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:31,450 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 23 treesize of output 22 [2021-12-16 05:52:31,534 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:31,534 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 17 treesize of output 21 [2021-12-16 05:52:31,589 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 16 treesize of output 18 [2021-12-16 05:52:31,596 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 16 treesize of output 18 [2021-12-16 05:52:31,614 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 16 treesize of output 18 [2021-12-16 05:52:31,619 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 16 treesize of output 18 [2021-12-16 05:52:31,639 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 16 treesize of output 18 [2021-12-16 05:52:31,644 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 16 treesize of output 18 [2021-12-16 05:52:31,662 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 16 treesize of output 18 [2021-12-16 05:52:31,669 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 16 treesize of output 18 [2021-12-16 05:52:31,684 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 16 treesize of output 18 [2021-12-16 05:52:31,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-16 05:52:31,769 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-16 05:52:31,770 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 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-16 05:52:31,782 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-16 05:52:31,783 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 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-16 05:52:31,856 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:31,856 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 59 treesize of output 56 [2021-12-16 05:52:31,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 26 treesize of output 28 [2021-12-16 05:52:32,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:32,111 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 40 treesize of output 30 [2021-12-16 05:52:32,115 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 19 treesize of output 11 [2021-12-16 05:52:32,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-16 05:52:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:32,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:32,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_2481 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)))))) is different from false [2021-12-16 05:52:32,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse0 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1)))) is different from false [2021-12-16 05:52:32,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1)))) is different from false [2021-12-16 05:52:32,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)))))) is different from false [2021-12-16 05:52:33,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-16 05:52:33,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (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_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (forall ((v_ArrVal_2462 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse0 0))))) is different from false [2021-12-16 05:52:33,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (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|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_2462 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-16 05:52:33,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (v_ArrVal_2454 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2454) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2462 Int) (v_ArrVal_2453 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2453) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-16 05:52:33,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (v_ArrVal_2452 Int) (v_ArrVal_2454 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_2452) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2454) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2450 Int) (v_ArrVal_2462 Int) (v_ArrVal_2453 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_2450) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2453) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-16 05:52:34,022 INFO L354 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2021-12-16 05:52:34,022 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 5 case distinctions, treesize of input 262 treesize of output 198 [2021-12-16 05:52:34,101 INFO L354 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2021-12-16 05:52:34,101 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 5 case distinctions, treesize of input 198 treesize of output 190 [2021-12-16 05:52:34,104 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 232 treesize of output 220 [2021-12-16 05:52:34,111 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-12-16 05:52:34,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 236 treesize of output 214 [2021-12-16 05:52:34,119 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 321 treesize of output 307 [2021-12-16 05:52:34,138 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-12-16 05:52:34,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 347 treesize of output 321 [2021-12-16 05:52:34,142 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 321 treesize of output 305 [2021-12-16 05:52:34,157 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 345 treesize of output 337 [2021-12-16 05:52:34,175 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 141 treesize of output 137 [2021-12-16 05:52:34,189 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 137 treesize of output 129 [2021-12-16 05:52:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-16 05:52:34,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738657484] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:34,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:34,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 37 [2021-12-16 05:52:34,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114227459] [2021-12-16 05:52:34,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:34,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-16 05:52:34,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:34,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-16 05:52:34,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=704, Unknown=9, NotChecked=558, Total=1406 [2021-12-16 05:52:34,641 INFO L87 Difference]: Start difference. First operand 193 states and 219 transitions. Second operand has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 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-16 05:52:37,480 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse6 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~last~0#1.base|)) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse4 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse4) 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (= 1 .cse6) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= .cse6 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-16 05:52:39,491 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse6 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse4 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse4) 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (= 1 .cse6) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= .cse6 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-16 05:52:41,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse0 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-16 05:52:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:42,408 INFO L93 Difference]: Finished difference Result 345 states and 388 transitions. [2021-12-16 05:52:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-16 05:52:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 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) Word has length 42 [2021-12-16 05:52:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:42,409 INFO L225 Difference]: With dead ends: 345 [2021-12-16 05:52:42,410 INFO L226 Difference]: Without dead ends: 345 [2021-12-16 05:52:42,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 61 SyntacticMatches, 20 SemanticMatches, 61 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=433, Invalid=2153, Unknown=12, NotChecked=1308, Total=3906 [2021-12-16 05:52:42,411 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 204 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1579 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:42,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 790 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 552 Invalid, 0 Unknown, 1579 Unchecked, 0.3s Time] [2021-12-16 05:52:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-16 05:52:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 255. [2021-12-16 05:52:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 243 states have (on average 1.1975308641975309) internal successors, (291), 254 states have internal predecessors, (291), 0 states have call successors, (0), 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-16 05:52:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2021-12-16 05:52:42,415 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 42 [2021-12-16 05:52:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:42,415 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2021-12-16 05:52:42,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 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-16 05:52:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2021-12-16 05:52:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 05:52:42,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:42,416 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:42,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:42,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-16 05:52:42,627 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2021-12-16 05:52:42,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388841862] [2021-12-16 05:52:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:42,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:42,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:42,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388841862] [2021-12-16 05:52:42,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388841862] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:42,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069643623] [2021-12-16 05:52:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:42,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:42,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:42,839 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:42,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-16 05:52:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:43,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-16 05:52:43,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:43,016 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-16 05:52:43,101 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-16 05:52:43,111 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:43,112 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 11 treesize of output 11 [2021-12-16 05:52:43,290 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-16 05:52:43,293 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-16 05:52:43,325 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:43,325 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-16 05:52:43,328 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-16 05:52:43,383 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-16 05:52:43,385 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-16 05:52:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:43,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:43,535 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2643 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))))) (forall ((v_ArrVal_2643 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 12)))) is different from false [2021-12-16 05:52:43,542 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:43,542 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 45 treesize of output 46 [2021-12-16 05:52:43,546 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:43,546 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 35 treesize of output 36 [2021-12-16 05:52:43,553 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:43,553 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 62 treesize of output 65 [2021-12-16 05:52:43,563 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:43,563 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 96 treesize of output 93 [2021-12-16 05:52:43,567 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 40 treesize of output 32 [2021-12-16 05:52:43,570 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 66 treesize of output 58 [2021-12-16 05:52:43,664 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:43,665 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 24 treesize of output 25 [2021-12-16 05:52:43,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:43,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:43,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-16 05:52:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:43,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069643623] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:43,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:43,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2021-12-16 05:52:43,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822035862] [2021-12-16 05:52:43,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:43,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-16 05:52:43,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:43,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-16 05:52:43,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=397, Unknown=1, NotChecked=40, Total=506 [2021-12-16 05:52:43,889 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 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-16 05:52:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:44,491 INFO L93 Difference]: Finished difference Result 365 states and 414 transitions. [2021-12-16 05:52:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 05:52:44,491 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 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) Word has length 42 [2021-12-16 05:52:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:44,492 INFO L225 Difference]: With dead ends: 365 [2021-12-16 05:52:44,492 INFO L226 Difference]: Without dead ends: 365 [2021-12-16 05:52:44,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=722, Unknown=1, NotChecked=56, Total=930 [2021-12-16 05:52:44,493 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 222 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:44,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 714 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 720 Invalid, 0 Unknown, 191 Unchecked, 0.4s Time] [2021-12-16 05:52:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-16 05:52:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 309. [2021-12-16 05:52:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 297 states have (on average 1.2053872053872055) internal successors, (358), 308 states have internal predecessors, (358), 0 states have call successors, (0), 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-16 05:52:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 358 transitions. [2021-12-16 05:52:44,496 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 358 transitions. Word has length 42 [2021-12-16 05:52:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:44,496 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 358 transitions. [2021-12-16 05:52:44,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 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-16 05:52:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 358 transitions. [2021-12-16 05:52:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 05:52:44,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:44,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:44,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:44,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-16 05:52:44,715 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2021-12-16 05:52:44,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:44,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440630815] [2021-12-16 05:52:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:44,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:45,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:45,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440630815] [2021-12-16 05:52:45,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440630815] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:45,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953225040] [2021-12-16 05:52:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:45,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:45,025 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:45,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-16 05:52:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:45,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-16 05:52:45,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:45,215 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-16 05:52:45,218 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-16 05:52:45,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:45,245 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-16 05:52:45,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:45,250 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-16 05:52:45,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:45,260 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-16 05:52:45,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:45,264 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-16 05:52:45,362 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-16 05:52:45,363 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 23 treesize of output 18 [2021-12-16 05:52:45,375 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-16 05:52:45,376 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 23 treesize of output 18 [2021-12-16 05:52:45,482 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-12-16 05:52:45,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2021-12-16 05:52:45,499 INFO L354 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2021-12-16 05:52:45,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2021-12-16 05:52:45,510 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 13 treesize of output 9 [2021-12-16 05:52:45,529 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 13 treesize of output 9 [2021-12-16 05:52:45,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-12-16 05:52:45,554 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 5 treesize of output 3 [2021-12-16 05:52:45,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:45,611 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 33 treesize of output 32 [2021-12-16 05:52:45,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:45,614 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 33 treesize of output 32 [2021-12-16 05:52:45,628 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 31 treesize of output 30 [2021-12-16 05:52:45,630 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 31 treesize of output 30 [2021-12-16 05:52:45,672 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-16 05:52:45,672 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 31 treesize of output 34 [2021-12-16 05:52:45,682 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-16 05:52:45,683 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 40 [2021-12-16 05:52:45,988 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-16 05:52:45,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 57 [2021-12-16 05:52:46,005 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-16 05:52:46,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2021-12-16 05:52:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:46,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:46,512 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 6 treesize of output 4 [2021-12-16 05:52:46,594 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 6 treesize of output 4 [2021-12-16 05:52:46,685 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 6 treesize of output 4 [2021-12-16 05:52:46,784 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 6 treesize of output 4 [2021-12-16 05:52:46,806 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 6 treesize of output 4 [2021-12-16 05:52:46,916 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 6 treesize of output 4 [2021-12-16 05:52:47,048 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 6 treesize of output 4 [2021-12-16 05:52:47,071 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 6 treesize of output 4 [2021-12-16 05:52:47,213 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 6 treesize of output 4 [2021-12-16 05:52:47,369 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 6 treesize of output 4 [2021-12-16 05:52:47,389 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 6 treesize of output 4 [2021-12-16 05:52:47,582 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 6 treesize of output 4 [2021-12-16 05:52:47,602 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 6 treesize of output 4 [2021-12-16 05:52:47,630 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 6 treesize of output 4 [2021-12-16 05:52:47,848 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 6 treesize of output 4 [2021-12-16 05:52:48,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:48,138 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 2 case distinctions, treesize of input 545 treesize of output 489 [2021-12-16 05:52:48,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,151 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:48,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 468 [2021-12-16 05:52:48,156 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:48,156 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 2 case distinctions, treesize of input 468 treesize of output 323 [2021-12-16 05:52:48,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,170 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:48,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 182 [2021-12-16 05:52:48,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,234 INFO L354 Elim1Store]: treesize reduction 63, result has 49.2 percent of original size [2021-12-16 05:52:48,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 182 treesize of output 210 [2021-12-16 05:52:48,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:48,245 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 247 treesize of output 245 [2021-12-16 05:52:48,255 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 05:52:48,255 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 251 treesize of output 248 [2021-12-16 05:52:48,305 INFO L354 Elim1Store]: treesize reduction 95, result has 39.1 percent of original size [2021-12-16 05:52:48,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 248 treesize of output 260 [2021-12-16 05:52:48,316 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:48,317 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 375 treesize of output 369 [2021-12-16 05:52:48,334 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 267 treesize of output 265 [2021-12-16 05:52:48,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:48,342 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 238 treesize of output 228 [2021-12-16 05:52:48,424 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 6 treesize of output 4 [2021-12-16 05:52:48,451 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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-16 05:52:48,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2021-12-16 05:52:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:48,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953225040] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:48,470 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:48,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 22] total 54 [2021-12-16 05:52:48,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571231975] [2021-12-16 05:52:48,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:48,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-16 05:52:48,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-16 05:52:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2184, Unknown=459, NotChecked=0, Total=2862 [2021-12-16 05:52:48,472 INFO L87 Difference]: Start difference. First operand 309 states and 358 transitions. Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 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-16 05:52:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:52,239 INFO L93 Difference]: Finished difference Result 555 states and 661 transitions. [2021-12-16 05:52:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-16 05:52:52,239 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 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) Word has length 42 [2021-12-16 05:52:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:52,241 INFO L225 Difference]: With dead ends: 555 [2021-12-16 05:52:52,241 INFO L226 Difference]: Without dead ends: 555 [2021-12-16 05:52:52,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=931, Invalid=7367, Unknown=822, NotChecked=0, Total=9120 [2021-12-16 05:52:52,244 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 671 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:52,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 1423 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1600 Invalid, 0 Unknown, 744 Unchecked, 0.8s Time] [2021-12-16 05:52:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-12-16 05:52:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 337. [2021-12-16 05:52:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.1938461538461538) internal successors, (388), 336 states have internal predecessors, (388), 0 states have call successors, (0), 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-16 05:52:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 388 transitions. [2021-12-16 05:52:52,253 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 388 transitions. Word has length 42 [2021-12-16 05:52:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:52,253 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 388 transitions. [2021-12-16 05:52:52,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 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-16 05:52:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 388 transitions. [2021-12-16 05:52:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 05:52:52,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:52,256 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:52,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:52,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:52,480 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2021-12-16 05:52:52,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:52,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315593931] [2021-12-16 05:52:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:52,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:52,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:52,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315593931] [2021-12-16 05:52:52,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315593931] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:52,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91574444] [2021-12-16 05:52:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:52,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:52,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:52,636 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:52,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-16 05:52:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:52,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-16 05:52:52,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:52,824 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-16 05:52:52,877 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:52,877 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-16 05:52:52,970 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-16 05:52:52,996 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:52,996 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-16 05:52:53,046 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-16 05:52:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:53,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:53,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2961 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2961) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))))) is different from false [2021-12-16 05:52:53,105 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:53,105 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 23 treesize of output 24 [2021-12-16 05:52:53,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:53,112 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 39 treesize of output 42 [2021-12-16 05:52:53,115 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 22 treesize of output 18 [2021-12-16 05:52:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:53,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91574444] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:53,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:53,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2021-12-16 05:52:53,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619054205] [2021-12-16 05:52:53,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:53,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 05:52:53,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:53,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 05:52:53,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2021-12-16 05:52:53,331 INFO L87 Difference]: Start difference. First operand 337 states and 388 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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-16 05:52:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:53,648 INFO L93 Difference]: Finished difference Result 372 states and 412 transitions. [2021-12-16 05:52:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 05:52:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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 43 [2021-12-16 05:52:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:53,650 INFO L225 Difference]: With dead ends: 372 [2021-12-16 05:52:53,650 INFO L226 Difference]: Without dead ends: 372 [2021-12-16 05:52:53,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=544, Unknown=1, NotChecked=50, Total=756 [2021-12-16 05:52:53,650 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 188 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:53,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 528 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 535 Invalid, 0 Unknown, 241 Unchecked, 0.2s Time] [2021-12-16 05:52:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-12-16 05:52:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 337. [2021-12-16 05:52:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.1876923076923076) internal successors, (386), 336 states have internal predecessors, (386), 0 states have call successors, (0), 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-16 05:52:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 386 transitions. [2021-12-16 05:52:53,656 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 386 transitions. Word has length 43 [2021-12-16 05:52:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:53,656 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 386 transitions. [2021-12-16 05:52:53,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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-16 05:52:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 386 transitions. [2021-12-16 05:52:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-16 05:52:53,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:53,657 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:53,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:53,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-16 05:52:53,875 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2021-12-16 05:52:53,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:53,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676132553] [2021-12-16 05:52:53,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:53,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:54,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:54,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676132553] [2021-12-16 05:52:54,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676132553] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:54,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013826879] [2021-12-16 05:52:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:54,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:54,080 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:54,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-16 05:52:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:54,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-16 05:52:54,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:54,271 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-16 05:52:54,340 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:54,340 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 11 treesize of output 11 [2021-12-16 05:52:54,451 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-16 05:52:54,470 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 14 treesize of output 16 [2021-12-16 05:52:54,493 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-16 05:52:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:54,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:54,557 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:54,557 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 19 treesize of output 23 [2021-12-16 05:52:54,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2021-12-16 05:52:54,645 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:54,645 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 22 treesize of output 23 [2021-12-16 05:52:54,650 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:54,650 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 36 treesize of output 39 [2021-12-16 05:52:54,653 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 11 treesize of output 7 [2021-12-16 05:52:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:54,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013826879] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:54,833 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:54,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2021-12-16 05:52:54,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327569373] [2021-12-16 05:52:54,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:54,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-16 05:52:54,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-16 05:52:54,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=432, Unknown=1, NotChecked=42, Total=552 [2021-12-16 05:52:54,835 INFO L87 Difference]: Start difference. First operand 337 states and 386 transitions. Second operand has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 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-16 05:52:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:55,593 INFO L93 Difference]: Finished difference Result 438 states and 496 transitions. [2021-12-16 05:52:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-16 05:52:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 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) Word has length 44 [2021-12-16 05:52:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:55,595 INFO L225 Difference]: With dead ends: 438 [2021-12-16 05:52:55,595 INFO L226 Difference]: Without dead ends: 438 [2021-12-16 05:52:55,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=400, Invalid=1583, Unknown=1, NotChecked=86, Total=2070 [2021-12-16 05:52:55,596 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 319 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:55,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 465 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 814 Invalid, 0 Unknown, 273 Unchecked, 0.4s Time] [2021-12-16 05:52:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-16 05:52:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 384. [2021-12-16 05:52:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 372 states have (on average 1.2150537634408602) internal successors, (452), 383 states have internal predecessors, (452), 0 states have call successors, (0), 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-16 05:52:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 452 transitions. [2021-12-16 05:52:55,600 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 452 transitions. Word has length 44 [2021-12-16 05:52:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:55,600 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 452 transitions. [2021-12-16 05:52:55,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 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-16 05:52:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 452 transitions. [2021-12-16 05:52:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-16 05:52:55,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:55,600 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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-16 05:52:55,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:55,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-16 05:52:55,811 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash 489910956, now seen corresponding path program 1 times [2021-12-16 05:52:55,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302605856] [2021-12-16 05:52:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:55,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:55,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:55,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302605856] [2021-12-16 05:52:55,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302605856] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:55,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079365957] [2021-12-16 05:52:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:55,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:55,908 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:55,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-16 05:52:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:56,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 05:52:56,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:52:56,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:56,348 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:56,348 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 21 treesize of output 25 [2021-12-16 05:52:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:52:56,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079365957] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:56,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:56,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2021-12-16 05:52:56,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237506188] [2021-12-16 05:52:56,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:56,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 05:52:56,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 05:52:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:52:56,547 INFO L87 Difference]: Start difference. First operand 384 states and 452 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 05:52:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:56,675 INFO L93 Difference]: Finished difference Result 385 states and 449 transitions. [2021-12-16 05:52:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:52:56,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 46 [2021-12-16 05:52:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:56,676 INFO L225 Difference]: With dead ends: 385 [2021-12-16 05:52:56,676 INFO L226 Difference]: Without dead ends: 385 [2021-12-16 05:52:56,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:52:56,677 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:56,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 145 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-12-16 05:52:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2021-12-16 05:52:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 347 states have (on average 1.2132564841498559) internal successors, (421), 358 states have internal predecessors, (421), 0 states have call successors, (0), 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-16 05:52:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2021-12-16 05:52:56,683 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 46 [2021-12-16 05:52:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:56,683 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2021-12-16 05:52:56,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 05:52:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2021-12-16 05:52:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-16 05:52:56,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:56,684 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:56,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:56,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-16 05:52:56,895 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-16 05:52:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2021-12-16 05:52:56,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:56,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264148575] [2021-12-16 05:52:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:56,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:57,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:57,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264148575] [2021-12-16 05:52:57,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264148575] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:57,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885304047] [2021-12-16 05:52:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:57,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:57,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:57,270 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:52:57,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-16 05:52:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:57,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-16 05:52:57,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:57,465 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-16 05:52:57,468 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-16 05:52:57,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,477 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 23 treesize of output 22 [2021-12-16 05:52:57,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,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 23 treesize of output 22 [2021-12-16 05:52:57,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,491 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-16 05:52:57,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,497 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-16 05:52:57,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,530 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:57,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 05:52:57,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 05:52:57,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,549 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:57,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 05:52:57,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 05:52:57,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,670 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-16 05:52:57,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2021-12-16 05:52:57,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,689 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-16 05:52:57,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 37 [2021-12-16 05:52:57,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,862 INFO L354 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2021-12-16 05:52:57,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 68 [2021-12-16 05:52:57,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:57,896 INFO L354 Elim1Store]: treesize reduction 64, result has 39.6 percent of original size [2021-12-16 05:52:57,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 63 [2021-12-16 05:53:06,272 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-12-16 05:53:06,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2021-12-16 05:53:06,291 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-12-16 05:53:06,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2021-12-16 05:53:06,316 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 13 treesize of output 9 [2021-12-16 05:53:06,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:06,359 INFO L354 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2021-12-16 05:53:06,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 23 [2021-12-16 05:53:06,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 5 treesize of output 3 [2021-12-16 05:53:06,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:06,405 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 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-16 05:53:06,545 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:53:06,545 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 43 treesize of output 45 [2021-12-16 05:53:06,557 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:53:06,557 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 48 treesize of output 48 [2021-12-16 05:53:06,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:06,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:06,618 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:53:06,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 05:53:06,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:06,754 INFO L354 Elim1Store]: treesize reduction 38, result has 40.6 percent of original size [2021-12-16 05:53:06,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 63 [2021-12-16 05:53:06,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:06,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2021-12-16 05:53:07,022 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:07,023 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 38 treesize of output 34 [2021-12-16 05:53:07,033 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:07,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 34 [2021-12-16 05:53:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:07,335 INFO L328 TraceCheckSpWp]: Computing backward predicates...