./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/hash_fun.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/hash_fun.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:10:30,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:10:30,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:10:30,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:10:30,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:10:30,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:10:30,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:10:30,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:10:30,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:10:30,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:10:30,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:10:30,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:10:30,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:10:30,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:10:30,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:10:30,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:10:30,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:10:30,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:10:30,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:10:30,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:10:30,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:10:30,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:10:30,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:10:30,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:10:30,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:10:30,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:10:30,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:10:30,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:10:30,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:10:30,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:10:30,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:10:30,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:10:30,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:10:30,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:10:30,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:10:30,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:10:30,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:10:30,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:10:30,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:10:30,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:10:30,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:10:30,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 09:10:30,447 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:10:30,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:10:30,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:10:30,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:10:30,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:10:30,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:10:30,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:10:30,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:10:30,452 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:10:30,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:10:30,453 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:10:30,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 09:10:30,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:10:30,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:10:30,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:10:30,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:10:30,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:10:30,454 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:10:30,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:10:30,454 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:10:30,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:10:30,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:10:30,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:10:30,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:10:30,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:10:30,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:10:30,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:10:30,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:10:30,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 09:10:30,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 09:10:30,456 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:10:30,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:10:30,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:10:30,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:10:30,457 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 ! call(reach_error())) ) 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 -> 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b [2021-12-17 09:10:30,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:10:30,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:10:30,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:10:30,698 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:10:30,699 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:10:30,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/hash_fun.i [2021-12-17 09:10:30,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390f42047/44def6b73ba940a1b1fe65d043b9306f/FLAG56a898c96 [2021-12-17 09:10:31,141 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:10:31,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i [2021-12-17 09:10:31,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390f42047/44def6b73ba940a1b1fe65d043b9306f/FLAG56a898c96 [2021-12-17 09:10:31,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390f42047/44def6b73ba940a1b1fe65d043b9306f [2021-12-17 09:10:31,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:10:31,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:10:31,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:10:31,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:10:31,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:10:31,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:31,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d66b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31, skipping insertion in model container [2021-12-17 09:10:31,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:31,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:10:31,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:10:31,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i[23732,23745] [2021-12-17 09:10:31,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:10:31,852 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:10:31,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i[23732,23745] [2021-12-17 09:10:31,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:10:31,936 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:10:31,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31 WrapperNode [2021-12-17 09:10:31,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:10:31,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:10:31,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:10:31,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:10:31,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:31,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:31,980 INFO L137 Inliner]: procedures = 125, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2021-12-17 09:10:31,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:10:31,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:10:31,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:10:31,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:10:31,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:31,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:31,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:32,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:32,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:32,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:32,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:32,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:10:32,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:10:32,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:10:32,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:10:32,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (1/1) ... [2021-12-17 09:10:32,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:10:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:32,064 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-17 09:10:32,083 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-17 09:10:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 09:10:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 09:10:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 09:10:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:10:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 09:10:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 09:10:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 09:10:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:10:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 09:10:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 09:10:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:10:32,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:10:32,216 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:10:32,217 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:10:32,371 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:10:32,376 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:10:32,376 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 09:10:32,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:10:32 BoogieIcfgContainer [2021-12-17 09:10:32,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:10:32,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:10:32,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:10:32,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:10:32,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:10:31" (1/3) ... [2021-12-17 09:10:32,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350ecdc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:10:32, skipping insertion in model container [2021-12-17 09:10:32,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:10:31" (2/3) ... [2021-12-17 09:10:32,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350ecdc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:10:32, skipping insertion in model container [2021-12-17 09:10:32,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:10:32" (3/3) ... [2021-12-17 09:10:32,385 INFO L111 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2021-12-17 09:10:32,389 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:10:32,389 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:10:32,422 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:10:32,426 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-17 09:10:32,426 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:10:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 09:10:32,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:32,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:32,441 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash 859985196, now seen corresponding path program 1 times [2021-12-17 09:10:32,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:32,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395845525] [2021-12-17 09:10:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:32,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:32,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:32,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395845525] [2021-12-17 09:10:32,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395845525] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:10:32,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:10:32,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 09:10:32,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634292264] [2021-12-17 09:10:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:10:32,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 09:10:32,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:32,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 09:10:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 09:10:32,599 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:32,624 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2021-12-17 09:10:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 09:10:32,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-17 09:10:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:32,633 INFO L225 Difference]: With dead ends: 30 [2021-12-17 09:10:32,633 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 09:10:32,635 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-17 09:10:32,639 INFO L933 BasicCegarLoop]: 23 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, 23 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-17 09:10:32,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:10:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 09:10:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 09:10:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-17 09:10:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-12-17 09:10:32,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2021-12-17 09:10:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:32,660 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-17 09:10:32,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-12-17 09:10:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 09:10:32,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:32,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:32,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 09:10:32,662 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1231547617, now seen corresponding path program 1 times [2021-12-17 09:10:32,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:32,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837262211] [2021-12-17 09:10:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:32,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:32,753 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-17 09:10:32,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837262211] [2021-12-17 09:10:32,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837262211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:10:32,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:10:32,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 09:10:32,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653074808] [2021-12-17 09:10:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:10:32,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 09:10:32,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 09:10:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 09:10:32,757 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:32,799 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-12-17 09:10:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:10:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 09:10:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:32,802 INFO L225 Difference]: With dead ends: 29 [2021-12-17 09:10:32,802 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 09:10:32,803 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-17 09:10:32,805 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:32,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:10:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 09:10:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-17 09:10:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-12-17 09:10:32,813 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 9 [2021-12-17 09:10:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:32,813 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-17 09:10:32,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2021-12-17 09:10:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 09:10:32,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:32,814 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:32,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 09:10:32,815 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:32,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2121530184, now seen corresponding path program 1 times [2021-12-17 09:10:32,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:32,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807139099] [2021-12-17 09:10:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:32,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:32,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:32,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807139099] [2021-12-17 09:10:32,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807139099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:32,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403382207] [2021-12-17 09:10:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:32,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:32,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:32,963 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-17 09:10:32,983 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-17 09:10:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:33,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-17 09:10:33,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:33,138 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-17 09:10:33,294 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-17 09:10:33,318 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:10:33,334 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-17 09:10:33,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:33,346 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 20 treesize of output 22 [2021-12-17 09:10:33,357 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:10:33,358 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-17 09:10:33,538 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 37 treesize of output 25 [2021-12-17 09:10:33,548 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 21 treesize of output 9 [2021-12-17 09:10:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:33,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:33,640 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:33,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-17 09:10:33,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:10:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:33,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403382207] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:10:33,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:10:33,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-17 09:10:33,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60429791] [2021-12-17 09:10:33,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:33,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 09:10:33,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 09:10:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:10:33,675 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:33,767 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2021-12-17 09:10:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:10:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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-17 09:10:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:33,769 INFO L225 Difference]: With dead ends: 30 [2021-12-17 09:10:33,769 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 09:10:33,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:10:33,770 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:33,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 36 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:10:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 09:10:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2021-12-17 09:10:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2021-12-17 09:10:33,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2021-12-17 09:10:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:33,775 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2021-12-17 09:10:33,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2021-12-17 09:10:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 09:10:33,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:33,776 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:33,802 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-17 09:10:33,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:33,990 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528262, now seen corresponding path program 1 times [2021-12-17 09:10:33,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:33,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565084003] [2021-12-17 09:10:33,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:33,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:34,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:34,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565084003] [2021-12-17 09:10:34,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565084003] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:34,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849194398] [2021-12-17 09:10:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:34,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:34,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:34,092 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-17 09:10:34,098 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-17 09:10:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:34,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-17 09:10:34,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:34,222 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-17 09:10:34,230 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:10:34,235 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-17 09:10:34,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:34,240 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-17 09:10:34,340 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 36 treesize of output 24 [2021-12-17 09:10:34,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 09:10:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:34,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:34,412 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:34,413 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 20 treesize of output 21 [2021-12-17 09:10:34,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-12-17 09:10:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:34,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849194398] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:10:34,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:10:34,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-17 09:10:34,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547068810] [2021-12-17 09:10:34,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:34,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 09:10:34,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 09:10:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-17 09:10:34,451 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:34,552 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-12-17 09:10:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:10:34,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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-17 09:10:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:34,554 INFO L225 Difference]: With dead ends: 32 [2021-12-17 09:10:34,554 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 09:10:34,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-17 09:10:34,555 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:34,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 44 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:10:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 09:10:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-17 09:10:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2021-12-17 09:10:34,559 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2021-12-17 09:10:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:34,560 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2021-12-17 09:10:34,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2021-12-17 09:10:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 09:10:34,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:34,561 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:34,582 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-17 09:10:34,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 09:10:34,775 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2123144338, now seen corresponding path program 1 times [2021-12-17 09:10:34,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737414521] [2021-12-17 09:10:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:34,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:34,928 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-17 09:10:34,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:34,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737414521] [2021-12-17 09:10:34,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737414521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:34,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859851384] [2021-12-17 09:10:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:34,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:34,930 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-17 09:10:34,956 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-17 09:10:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:35,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-17 09:10:35,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:35,025 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-17 09:10:35,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:35,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:10:35,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:35,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:10:35,129 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:10:35,130 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-17 09:10:35,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:35,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:35,254 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-17 09:10:35,254 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2021-12-17 09:10:35,262 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:10:35,264 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2021-12-17 09:10:35,305 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 26 treesize of output 10 [2021-12-17 09:10:35,309 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 26 treesize of output 10 [2021-12-17 09:10:35,321 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-17 09:10:35,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:35,588 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-17 09:10:35,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859851384] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:10:35,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:10:35,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-17 09:10:35,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722564512] [2021-12-17 09:10:35,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:35,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:10:35,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:35,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:10:35,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:10:35,591 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:35,639 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-12-17 09:10:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:10:35,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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-17 09:10:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:35,641 INFO L225 Difference]: With dead ends: 44 [2021-12-17 09:10:35,641 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 09:10:35,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:10:35,642 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:35,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 96 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2021-12-17 09:10:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 09:10:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 09:10:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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-17 09:10:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-12-17 09:10:35,647 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 20 [2021-12-17 09:10:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:35,648 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-17 09:10:35,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-12-17 09:10:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 09:10:35,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:35,649 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:35,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 09:10:35,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:35,872 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -153301193, now seen corresponding path program 2 times [2021-12-17 09:10:35,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:35,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059933778] [2021-12-17 09:10:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:35,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:36,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:36,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059933778] [2021-12-17 09:10:36,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059933778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:36,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951134711] [2021-12-17 09:10:36,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:10:36,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:36,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:36,072 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-17 09:10:36,080 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-17 09:10:36,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:10:36,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:10:36,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-17 09:10:36,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:36,192 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-17 09:10:36,252 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-17 09:10:36,265 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:10:36,269 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-17 09:10:36,284 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-17 09:10:36,285 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 25 treesize of output 29 [2021-12-17 09:10:36,289 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 20 treesize of output 22 [2021-12-17 09:10:36,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:10:36,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2021-12-17 09:10:36,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 40 [2021-12-17 09:10:36,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,471 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:10:36,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2021-12-17 09:10:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:36,650 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-17 09:10:36,650 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 81 [2021-12-17 09:10:36,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,661 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:10:36,661 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 1 case distinctions, treesize of input 53 treesize of output 46 [2021-12-17 09:10:36,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-17 09:10:36,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,805 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 56 treesize of output 32 [2021-12-17 09:10:36,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:36,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-17 09:10:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:36,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:36,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_299 (Array Int Int))) (<= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_299) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2021-12-17 09:10:37,140 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:37,141 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 156 treesize of output 157 [2021-12-17 09:10:37,168 INFO L354 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2021-12-17 09:10:37,169 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 7074 treesize of output 6476 [2021-12-17 09:10:37,245 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 1237 treesize of output 1221 [2021-12-17 09:10:37,259 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 615 treesize of output 607 [2021-12-17 09:10:37,275 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 1213 treesize of output 1181 [2021-12-17 09:10:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-17 09:10:38,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951134711] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:10:38,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:10:38,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-17 09:10:38,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829558497] [2021-12-17 09:10:38,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:38,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 09:10:38,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 09:10:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2021-12-17 09:10:38,746 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:39,022 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-12-17 09:10:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 09:10:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 09:10:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:39,023 INFO L225 Difference]: With dead ends: 44 [2021-12-17 09:10:39,024 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 09:10:39,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=197, Unknown=3, NotChecked=30, Total=306 [2021-12-17 09:10:39,024 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:39,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 91 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2021-12-17 09:10:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 09:10:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2021-12-17 09:10:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2021-12-17 09:10:39,029 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 26 [2021-12-17 09:10:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:39,029 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2021-12-17 09:10:39,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2021-12-17 09:10:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 09:10:39,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:39,033 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:39,058 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-17 09:10:39,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:39,234 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:39,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash -153299271, now seen corresponding path program 1 times [2021-12-17 09:10:39,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:39,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995469354] [2021-12-17 09:10:39,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:39,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:39,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:39,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995469354] [2021-12-17 09:10:39,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995469354] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:39,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578613495] [2021-12-17 09:10:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:39,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:39,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:39,361 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-17 09:10:39,389 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-17 09:10:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:39,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-17 09:10:39,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:39,534 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-17 09:10:39,541 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:10:39,545 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-17 09:10:39,549 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 10 treesize of output 9 [2021-12-17 09:10:39,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,552 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-17 09:10:39,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2021-12-17 09:10:39,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 39 [2021-12-17 09:10:39,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:10:39,743 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:10:39,743 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 23 treesize of output 23 [2021-12-17 09:10:39,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:39,943 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-17 09:10:39,944 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 80 [2021-12-17 09:10:39,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,954 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:10:39,954 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2021-12-17 09:10:39,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:39,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:10:40,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:40,060 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 55 treesize of output 31 [2021-12-17 09:10:40,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:40,068 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 19 treesize of output 7 [2021-12-17 09:10:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:40,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:40,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_421) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) is different from false [2021-12-17 09:10:40,336 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:40,336 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 158 treesize of output 159 [2021-12-17 09:10:40,363 INFO L354 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2021-12-17 09:10:40,364 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 1678 treesize of output 1584 [2021-12-17 09:10:40,384 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 299 treesize of output 295 [2021-12-17 09:10:40,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 295 treesize of output 287 [2021-12-17 09:10:40,396 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 139 treesize of output 137 [2021-12-17 09:10:40,402 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 10 treesize of output 8 [2021-12-17 09:10:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-17 09:10:40,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578613495] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:10:40,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:10:40,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-12-17 09:10:40,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185062517] [2021-12-17 09:10:40,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:40,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 09:10:40,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:40,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 09:10:40,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2021-12-17 09:10:40,534 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 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-17 09:10:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:41,952 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2021-12-17 09:10:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 09:10:41,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 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 26 [2021-12-17 09:10:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:41,953 INFO L225 Difference]: With dead ends: 42 [2021-12-17 09:10:41,953 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 09:10:41,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=98, Invalid=245, Unknown=3, NotChecked=34, Total=380 [2021-12-17 09:10:41,954 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:41,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 95 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2021-12-17 09:10:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 09:10:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-17 09:10:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-12-17 09:10:41,959 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 26 [2021-12-17 09:10:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:41,959 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-12-17 09:10:41,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 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-17 09:10:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-12-17 09:10:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 09:10:41,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:41,961 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 09:10:41,983 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-17 09:10:42,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:42,162 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:42,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1774735439, now seen corresponding path program 3 times [2021-12-17 09:10:42,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:42,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753743633] [2021-12-17 09:10:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:42,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:42,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:42,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753743633] [2021-12-17 09:10:42,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753743633] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:42,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042281437] [2021-12-17 09:10:42,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:10:42,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:42,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:42,342 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-17 09:10:42,343 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-17 09:10:42,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 09:10:42,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:10:42,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-17 09:10:42,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:42,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 27 [2021-12-17 09:10:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 35 [2021-12-17 09:10:42,554 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 10 treesize of output 9 [2021-12-17 09:10:42,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 54 [2021-12-17 09:10:42,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,694 INFO L354 Elim1Store]: treesize reduction 182, result has 6.7 percent of original size [2021-12-17 09:10:42,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 64 [2021-12-17 09:10:42,705 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:10:42,705 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 23 treesize of output 23 [2021-12-17 09:10:42,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:42,894 INFO L354 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2021-12-17 09:10:42,895 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 7 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 101 [2021-12-17 09:10:42,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:42,904 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:10:42,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2021-12-17 09:10:43,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:43,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:43,075 INFO L354 Elim1Store]: treesize reduction 174, result has 8.9 percent of original size [2021-12-17 09:10:43,075 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 86 [2021-12-17 09:10:43,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:43,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:43,085 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:10:43,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 83 [2021-12-17 09:10:43,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:43,146 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 09:10:43,147 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 52 [2021-12-17 09:10:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:43,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:43,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2021-12-17 09:10:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:43,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:44,394 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 10 treesize of output 8 [2021-12-17 09:10:46,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 Int) (v_ArrVal_548 Int)) (or (and (forall ((v_ArrVal_541 Int) (v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_539 Int) (v_ArrVal_537 Int)) (= (let ((.cse6 (+ v_ArrVal_539 4))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_540) .cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_541)))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_539))))) (store .cse7 v_ArrVal_548 (store (store (select .cse7 v_ArrVal_548) 4 v_ArrVal_539) 0 v_ArrVal_550))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_548) 4))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_540) .cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_537)))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_540))))) (store .cse4 v_ArrVal_548 (store (store (select .cse4 v_ArrVal_548) 4 v_ArrVal_540) 0 v_ArrVal_552))))) (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_548))) v_ArrVal_548) 4)) (+ .cse2 4)))))) 0)) (forall ((v_ArrVal_541 Int) (v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_539 Int) (v_ArrVal_537 Int)) (= (let ((.cse14 (+ v_ArrVal_539 4))) (select (let ((.cse9 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_540) .cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_537)))) (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_540))))) (store .cse12 v_ArrVal_548 (store (store (select .cse12 v_ArrVal_548) 4 v_ArrVal_540) 0 v_ArrVal_552))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_548)) v_ArrVal_548) 4))) (select (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse11)) .cse11)))) (+ (select (select (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_540) .cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_541)))) (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_539))))) (store .cse16 v_ArrVal_548 (store (store (select .cse16 v_ArrVal_548) 4 v_ArrVal_539) 0 v_ArrVal_550))))) (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) v_ArrVal_548) 4) 4))) 0))) (= v_ArrVal_548 v_ArrVal_540) (<= |c_#StackHeapBarrier| v_ArrVal_548) (<= |c_#StackHeapBarrier| v_ArrVal_540))) is different from false [2021-12-17 09:10:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-12-17 09:10:48,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042281437] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:10:48,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:10:48,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2021-12-17 09:10:48,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547479740] [2021-12-17 09:10:48,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:48,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 09:10:48,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:10:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 09:10:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=200, Unknown=1, NotChecked=28, Total=272 [2021-12-17 09:10:48,147 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:51,082 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2021-12-17 09:10:51,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 09:10:51,083 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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-17 09:10:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:51,083 INFO L225 Difference]: With dead ends: 60 [2021-12-17 09:10:51,084 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 09:10:51,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=65, Invalid=318, Unknown=1, NotChecked=36, Total=420 [2021-12-17 09:10:51,085 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:51,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 226 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2021-12-17 09:10:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 09:10:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-12-17 09:10:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2021-12-17 09:10:51,089 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 31 [2021-12-17 09:10:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:51,089 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-12-17 09:10:51,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:10:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2021-12-17 09:10:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 09:10:51,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:51,091 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 09:10:51,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 09:10:51,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:51,296 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash -212280090, now seen corresponding path program 4 times [2021-12-17 09:10:51,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:10:51,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160602460] [2021-12-17 09:10:51,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:51,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:10:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:51,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:10:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160602460] [2021-12-17 09:10:51,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160602460] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402628245] [2021-12-17 09:10:51,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:10:51,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:10:51,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:10:51,625 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-17 09:10:51,633 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-17 09:10:51,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:10:51,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:10:51,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 135 conjunts are in the unsatisfiable core [2021-12-17 09:10:51,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:51,804 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-17 09:10:51,812 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:10:51,816 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-17 09:10:51,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:51,821 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 20 treesize of output 22 [2021-12-17 09:10:51,825 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 10 treesize of output 9 [2021-12-17 09:10:51,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:51,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:51,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:51,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2021-12-17 09:10:51,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:51,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:10:51,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:51,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 39 [2021-12-17 09:10:51,984 INFO L354 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2021-12-17 09:10:51,984 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 33 treesize of output 45 [2021-12-17 09:10:52,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,186 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:10:52,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 72 [2021-12-17 09:10:52,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2021-12-17 09:10:52,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 51 [2021-12-17 09:10:52,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,225 INFO L354 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2021-12-17 09:10:52,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2021-12-17 09:10:52,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:52,472 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-17 09:10:52,472 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 108 [2021-12-17 09:10:52,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,481 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:10:52,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2021-12-17 09:10:52,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 09:10:52,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:52,702 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:10:52,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 140 treesize of output 99 [2021-12-17 09:10:52,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,714 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:10:52,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2021-12-17 09:10:52,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 09:10:52,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:52,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:52,918 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-17 09:10:52,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 136 treesize of output 76 [2021-12-17 09:10:52,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:52,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-17 09:10:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:52,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:52,954 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array Int Int))) (<= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_750) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2021-12-17 09:10:52,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array Int Int))) (<= (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_750) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2021-12-17 09:11:07,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_737 Int) (v_ArrVal_736 Int) (v_ArrVal_725 Int) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| v_ArrVal_717 1) v_ArrVal_736))) (<= (let ((.cse4 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_717 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_717) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_725)))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse9 v_ArrVal_736 (store (store (select .cse9 v_ArrVal_736) 4 0) 0 v_ArrVal_741))))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_717 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_717) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_730)))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_717))))) (store .cse7 v_ArrVal_736 (store (store (select .cse7 v_ArrVal_736) 4 v_ArrVal_717) 0 v_ArrVal_737)))) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_736) 4)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_736)) v_ArrVal_736) 4)) (.cse3 (+ .cse6 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_717 v_ArrVal_720) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_724) v_ArrVal_736 v_ArrVal_732) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_750) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) .cse2) .cse3)) (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse2) .cse3)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99)) (<= |c_#StackHeapBarrier| v_ArrVal_717) (not (= 0 (select |c_#valid| v_ArrVal_717))) (<= |c_#StackHeapBarrier| v_ArrVal_736))) is different from false [2021-12-17 09:11:22,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_737 Int) (v_ArrVal_736 Int) (v_ArrVal_725 Int) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| v_ArrVal_717 1) v_ArrVal_736))) (<= |c_#StackHeapBarrier| v_ArrVal_717) (not (= 0 (select |c_#valid| v_ArrVal_717))) (<= (let ((.cse4 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_717 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_717) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_725)))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse9 v_ArrVal_736 (store (store (select .cse9 v_ArrVal_736) 4 0) 0 v_ArrVal_741))))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_717 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_717) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_730)))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_717))))) (store .cse7 v_ArrVal_736 (store (store (select .cse7 v_ArrVal_736) 4 v_ArrVal_717) 0 v_ArrVal_737)))) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_736) 4)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_736)) v_ArrVal_736) 4)) (.cse3 (+ .cse6 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_717 v_ArrVal_720) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_724) v_ArrVal_736 v_ArrVal_732) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_750) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) .cse2) .cse3)) (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse2) .cse3)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99)) (<= |c_#StackHeapBarrier| v_ArrVal_736))) is different from false [2021-12-17 09:11:22,760 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:22,760 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 2290 treesize of output 2291 [2021-12-17 09:11:22,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:22,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:22,776 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 562150 treesize of output 558694 [2021-12-17 09:11:22,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:22,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:22,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:23,654 INFO L354 Elim1Store]: treesize reduction 20468, result has 0.4 percent of original size [2021-12-17 09:11:23,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 488021686 treesize of output 470783022 [2021-12-17 09:11:49,725 WARN L227 SmtUtils]: Spent 26.07s on a formula simplification that was a NOOP. DAG size: 2289 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 09:16:10,268 WARN L227 SmtUtils]: Spent 4.34m on a formula simplification. DAG size of input: 2258 DAG size of output: 2202 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 09:16:10,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:10,375 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 3534 treesize of output 3326 [2021-12-17 09:16:10,392 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 3326 treesize of output 3246 [2021-12-17 09:16:10,409 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 3246 treesize of output 3166 [2021-12-17 09:16:10,427 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 1525 treesize of output 1493 [2021-12-17 09:16:10,451 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:16:10,452 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 22 treesize of output 18 [2021-12-17 09:16:10,485 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 09:16:10,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:16:10,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-12-17 09:16:10,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427733855] [2021-12-17 09:16:10,486 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 09:16:10,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:16:10,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:16:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:16:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=254, Unknown=4, NotChecked=140, Total=462 [2021-12-17 09:16:10,487 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:16:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:16:10,932 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2021-12-17 09:16:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 09:16:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-12-17 09:16:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:16:10,933 INFO L225 Difference]: With dead ends: 52 [2021-12-17 09:16:10,933 INFO L226 Difference]: Without dead ends: 50 [2021-12-17 09:16:10,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=173, Invalid=595, Unknown=4, NotChecked=220, Total=992 [2021-12-17 09:16:10,935 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:16:10,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 115 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:16:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-17 09:16:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2021-12-17 09:16:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:16:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2021-12-17 09:16:10,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 37 [2021-12-17 09:16:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:16:10,940 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2021-12-17 09:16:10,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:16:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2021-12-17 09:16:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 09:16:10,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:16:10,941 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-17 09:16:10,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-17 09:16:11,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:16:11,156 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:16:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:16:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -212278168, now seen corresponding path program 2 times [2021-12-17 09:16:11,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:16:11,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699681701] [2021-12-17 09:16:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:16:11,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:16:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:16:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:16:11,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:16:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699681701] [2021-12-17 09:16:11,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699681701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:16:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818208854] [2021-12-17 09:16:11,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:16:11,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:16:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:16:11,407 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-17 09:16:11,409 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-17 09:16:11,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:16:11,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:16:11,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 131 conjunts are in the unsatisfiable core [2021-12-17 09:16:11,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:16:11,585 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-17 09:16:11,591 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:16:11,594 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-17 09:16:11,597 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 10 treesize of output 9 [2021-12-17 09:16:11,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,600 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-17 09:16:11,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 37 [2021-12-17 09:16:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2021-12-17 09:16:11,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:16:11,744 INFO L354 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2021-12-17 09:16:11,744 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 33 treesize of output 45 [2021-12-17 09:16:11,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2021-12-17 09:16:11,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,963 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:16:11,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 70 [2021-12-17 09:16:11,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 51 [2021-12-17 09:16:11,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:11,997 INFO L354 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2021-12-17 09:16:11,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2021-12-17 09:16:12,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:12,242 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-17 09:16:12,243 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 106 [2021-12-17 09:16:12,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,252 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:16:12,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2021-12-17 09:16:12,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 09:16:12,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:12,438 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:16:12,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 97 [2021-12-17 09:16:12,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,448 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:16:12,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2021-12-17 09:16:12,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 09:16:12,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:12,569 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:16:12,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 65 [2021-12-17 09:16:12,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:12,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 09:16:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:16:12,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:16:12,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_944 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_944) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) is different from false [2021-12-17 09:16:12,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_944 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_944) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))))) is different from false [2021-12-17 09:16:27,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_928 Int) (v_ArrVal_916 Int) (v_ArrVal_936 Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_910 Int) (v_ArrVal_932 Int) (v_ArrVal_920 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_916))) (not (= 0 (select (store |c_#valid| v_ArrVal_916 1) v_ArrVal_936))) (<= |c_#StackHeapBarrier| v_ArrVal_916) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse4 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_920)))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse9 v_ArrVal_936 (store (store (select .cse9 v_ArrVal_936) 4 0) 0 v_ArrVal_932))))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_910)))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_916))))) (store .cse7 v_ArrVal_936 (store (store (select .cse7 v_ArrVal_936) 4 v_ArrVal_916) 0 v_ArrVal_928)))) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_936) 4)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_936)) v_ArrVal_936) 4)) (.cse3 (+ .cse6 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_916 v_ArrVal_919) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_923) v_ArrVal_936 v_ArrVal_927) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_944) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) .cse2) .cse3)) (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse2) .cse3))))))) (<= |c_#StackHeapBarrier| v_ArrVal_936))) is different from false [2021-12-17 09:16:28,109 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:16:28,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2292 treesize of output 2293 [2021-12-17 09:16:28,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:28,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:28,119 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 233974 treesize of output 232534 [2021-12-17 09:16:28,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:28,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:28,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:28,927 INFO L354 Elim1Store]: treesize reduction 20468, result has 0.4 percent of original size [2021-12-17 09:16:28,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 233847730 treesize of output 225610002 [2021-12-17 09:16:41,575 WARN L227 SmtUtils]: Spent 12.64s on a formula simplification that was a NOOP. DAG size: 2704 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 09:18:32,039 WARN L227 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 2642 DAG size of output: 2598 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 09:18:32,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:18:32,148 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 970 treesize of output 918 [2021-12-17 09:18:32,158 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 918 treesize of output 898 [2021-12-17 09:18:32,167 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 898 treesize of output 878 [2021-12-17 09:18:32,183 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:18:32,184 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 22 treesize of output 18 [2021-12-17 09:18:32,207 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 421 treesize of output 413 [2021-12-17 09:18:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2021-12-17 09:18:33,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818208854] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:18:33,845 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:18:33,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2021-12-17 09:18:33,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354450519] [2021-12-17 09:18:33,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:18:33,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-17 09:18:33,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:18:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-17 09:18:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=281, Unknown=3, NotChecked=108, Total=462 [2021-12-17 09:18:33,847 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 22 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:18:48,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (< .cse0 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#list~0#1.offset|) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse0) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_928 Int) (v_ArrVal_916 Int) (v_ArrVal_936 Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_910 Int) (v_ArrVal_932 Int) (v_ArrVal_920 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_916))) (not (= 0 (select (store |c_#valid| v_ArrVal_916 1) v_ArrVal_936))) (<= |c_#StackHeapBarrier| v_ArrVal_916) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse5 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_920)))) (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse10 v_ArrVal_936 (store (store (select .cse10 v_ArrVal_936) 4 0) 0 v_ArrVal_932))))) (let ((.cse1 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_910)))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_916))))) (store .cse8 v_ArrVal_936 (store (store (select .cse8 v_ArrVal_936) 4 v_ArrVal_916) 0 v_ArrVal_928)))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_936) 4)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_936)) v_ArrVal_936) 4)) (.cse4 (+ .cse7 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_916 v_ArrVal_919) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_923) v_ArrVal_936 v_ArrVal_927) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_944) (select (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse3)) .cse3) .cse4)) (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse3) .cse4))))))) (<= |c_#StackHeapBarrier| v_ArrVal_936))))) is different from false [2021-12-17 09:19:02,470 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (< .cse0 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= .cse0 .cse1)) (= (select |c_#valid| .cse1) 1) (= 0 |c_ULTIMATE.start_main_~#list~0#1.offset|) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse0) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_928 Int) (v_ArrVal_916 Int) (v_ArrVal_936 Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_910 Int) (v_ArrVal_932 Int) (v_ArrVal_920 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_916))) (not (= 0 (select (store |c_#valid| v_ArrVal_916 1) v_ArrVal_936))) (<= |c_#StackHeapBarrier| v_ArrVal_916) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse6 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.offset| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_920)))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse11 v_ArrVal_936 (store (store (select .cse11 v_ArrVal_936) 4 0) 0 v_ArrVal_932))))) (let ((.cse2 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_910)))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_916))))) (store .cse9 v_ArrVal_936 (store (store (select .cse9 v_ArrVal_936) 4 v_ArrVal_916) 0 v_ArrVal_928)))) (.cse7 (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_936) 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_936)) v_ArrVal_936) 4)) (.cse5 (+ .cse8 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_916 v_ArrVal_919) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_923) v_ArrVal_936 v_ArrVal_927) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_944) (select (select (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse4) .cse5)) (select (select (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse8)) .cse4) .cse5))))))) (<= |c_#StackHeapBarrier| v_ArrVal_936))) (< .cse1 |c_#StackHeapBarrier|)))) is different from false [2021-12-17 09:19:16,782 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (forall ((v_ArrVal_944 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_944) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))))) (< (+ .cse7 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= .cse8 .cse9)) (not (= .cse7 .cse9)) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse9) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) 4) 0) (= 0 |c_ULTIMATE.start_main_~#list~0#1.offset|) (< (+ .cse9 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse8) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_928 Int) (v_ArrVal_916 Int) (v_ArrVal_936 Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_910 Int) (v_ArrVal_932 Int) (v_ArrVal_920 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_916))) (not (= 0 (select (store |c_#valid| v_ArrVal_916 1) v_ArrVal_936))) (<= |c_#StackHeapBarrier| v_ArrVal_916) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse14 (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.offset| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_920)))) (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse19 v_ArrVal_936 (store (store (select .cse19 v_ArrVal_936) 4 0) 0 v_ArrVal_932))))) (let ((.cse10 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| v_ArrVal_916 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_916) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_910)))) (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_916))))) (store .cse17 v_ArrVal_936 (store (store (select .cse17 v_ArrVal_936) 4 v_ArrVal_916) 0 v_ArrVal_928)))) (.cse15 (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse16 (select (select (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_936) 4)) (.cse11 (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse12 (select (select (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_936)) v_ArrVal_936) 4)) (.cse13 (+ .cse16 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_916 v_ArrVal_919) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_923) v_ArrVal_936 v_ArrVal_927) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_944) (select (select (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse12)) .cse12) .cse13)) (select (select (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse16)) .cse12) .cse13))))))) (<= |c_#StackHeapBarrier| v_ArrVal_936))) (< (+ .cse8 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select |c_#valid| .cse8) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (< .cse8 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse7) 4) 0))))) is different from false [2021-12-17 09:19:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:19:18,474 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2021-12-17 09:19:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 09:19:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 22 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 09:19:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:19:18,475 INFO L225 Difference]: With dead ends: 103 [2021-12-17 09:19:18,475 INFO L226 Difference]: Without dead ends: 96 [2021-12-17 09:19:18,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=130, Invalid=486, Unknown=8, NotChecked=306, Total=930 [2021-12-17 09:19:18,476 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:19:18,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 373 Unchecked, 0.1s Time] [2021-12-17 09:19:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-17 09:19:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2021-12-17 09:19:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:19:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2021-12-17 09:19:18,490 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 37 [2021-12-17 09:19:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:19:18,490 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2021-12-17 09:19:18,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 22 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:19:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2021-12-17 09:19:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 09:19:18,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:19:18,492 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:19:18,511 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-17 09:19:18,699 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,SelfDestructingSolverStorable9 [2021-12-17 09:19:18,700 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:19:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:19:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1785672598, now seen corresponding path program 1 times [2021-12-17 09:19:18,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:19:18,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137364944] [2021-12-17 09:19:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:19:18,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:19:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:19:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-17 09:19:18,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:19:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137364944] [2021-12-17 09:19:18,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137364944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:19:18,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:19:18,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:19:18,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121306809] [2021-12-17 09:19:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:19:18,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:19:18,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:19:18,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:19:18,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:19:18,745 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:19:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:19:18,766 INFO L93 Difference]: Finished difference Result 223 states and 280 transitions. [2021-12-17 09:19:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:19:18,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-17 09:19:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:19:18,767 INFO L225 Difference]: With dead ends: 223 [2021-12-17 09:19:18,767 INFO L226 Difference]: Without dead ends: 128 [2021-12-17 09:19:18,768 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-17 09:19:18,768 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:19:18,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:19:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-17 09:19:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2021-12-17 09:19:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 93 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-17 09:19:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2021-12-17 09:19:18,792 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 40 [2021-12-17 09:19:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:19:18,792 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2021-12-17 09:19:18,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:19:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2021-12-17 09:19:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:19:18,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:19:18,798 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2021-12-17 09:19:18,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 09:19:18,798 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:19:18,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:19:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash 879523840, now seen corresponding path program 5 times [2021-12-17 09:19:18,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:19:18,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773608324] [2021-12-17 09:19:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:19:18,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:19:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:19:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:19:19,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:19:19,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773608324] [2021-12-17 09:19:19,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773608324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:19:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590184589] [2021-12-17 09:19:19,144 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 09:19:19,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:19:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:19:19,145 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-17 09:19:19,146 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-17 09:19:19,698 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-17 09:19:19,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:19:19,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 133 conjunts are in the unsatisfiable core [2021-12-17 09:19:19,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:19:19,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:19,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:19:19,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:19,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:19:19,787 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 10 treesize of output 9 [2021-12-17 09:19:19,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:19,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:19,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:19,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2021-12-17 09:19:19,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:19,949 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:19:19,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 50 [2021-12-17 09:19:19,963 INFO L354 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2021-12-17 09:19:19,963 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 33 treesize of output 45 [2021-12-17 09:19:20,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,193 INFO L354 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2021-12-17 09:19:20,193 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 85 [2021-12-17 09:19:20,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 79 [2021-12-17 09:19:20,231 INFO L354 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2021-12-17 09:19:20,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 58 [2021-12-17 09:19:20,519 INFO L354 Elim1Store]: treesize reduction 105, result has 11.0 percent of original size [2021-12-17 09:19:20,520 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 7 new quantified variables, introduced 7 case distinctions, treesize of input 274 treesize of output 122 [2021-12-17 09:19:20,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,527 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-17 09:19:20,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 205 treesize of output 165 [2021-12-17 09:19:20,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,857 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:19:20,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 90 [2021-12-17 09:19:20,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:20,866 INFO L354 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2021-12-17 09:19:20,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 145 treesize of output 98 [2021-12-17 09:19:21,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,302 INFO L354 Elim1Store]: treesize reduction 157, result has 1.9 percent of original size [2021-12-17 09:19:21,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 180 treesize of output 115 [2021-12-17 09:19:21,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,314 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:19:21,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 73 [2021-12-17 09:19:21,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,406 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-17 09:19:21,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 63 [2021-12-17 09:19:21,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:21,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2021-12-17 09:19:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:19:21,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:19:30,059 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:19:30,060 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 22 treesize of output 18 [2021-12-17 09:19:33,856 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 Int) (v_ArrVal_1210 Int) (v_ArrVal_1202 Int)) (or (= v_ArrVal_1210 v_ArrVal_1202) (= v_ArrVal_1210 v_ArrVal_1189) (and (forall ((v_ArrVal_1209 Int) (v_ArrVal_1198 Int) (v_ArrVal_1188 Int) (v_ArrVal_1201 Int) (v_ArrVal_1203 Int) (v_ArrVal_1190 Int) (v_ArrVal_1207 Int)) (= (let ((.cse8 (+ v_ArrVal_1209 4))) (let ((.cse5 (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$.offset| v_ArrVal_1189 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_1189) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1190)))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse15 v_ArrVal_1202 (store (store (select .cse15 v_ArrVal_1202) 4 0) 0 v_ArrVal_1198))))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse13 v_ArrVal_1210 (store (store (select .cse13 v_ArrVal_1210) .cse8 0) v_ArrVal_1209 v_ArrVal_1203))))) (let ((.cse0 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| v_ArrVal_1189 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_1189) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1188)))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1189))))) (store .cse11 v_ArrVal_1202 (store (store (select .cse11 v_ArrVal_1202) 4 v_ArrVal_1189) 0 v_ArrVal_1201))))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1202))))) (store .cse9 v_ArrVal_1210 (store (store (select .cse9 v_ArrVal_1210) .cse8 v_ArrVal_1202) v_ArrVal_1209 v_ArrVal_1207)))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1209)) v_ArrVal_1210) .cse8)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1210)) v_ArrVal_1210) .cse8)) (.cse4 (+ .cse7 4))) (select (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse3)) .cse3) .cse4))) (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) .cse2)) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse3) .cse4) 4))))))) 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1198 Int) (v_ArrVal_1188 Int) (v_ArrVal_1201 Int) (v_ArrVal_1203 Int) (v_ArrVal_1190 Int) (v_ArrVal_1207 Int)) (= (let ((.cse25 (+ v_ArrVal_1209 4))) (let ((.cse17 (let ((.cse30 (let ((.cse31 (let ((.cse32 (let ((.cse33 (store |c_#memory_$Pointer$.offset| v_ArrVal_1189 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_1189) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1190)))) (store .cse33 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse32 v_ArrVal_1202 (store (store (select .cse32 v_ArrVal_1202) 4 0) 0 v_ArrVal_1198))))) (store .cse31 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse30 v_ArrVal_1210 (store (store (select .cse30 v_ArrVal_1210) .cse25 0) v_ArrVal_1209 v_ArrVal_1203))))) (let ((.cse20 (let ((.cse26 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$.base| v_ArrVal_1189 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_1189) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1188)))) (store .cse29 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1189))))) (store .cse28 v_ArrVal_1202 (store (store (select .cse28 v_ArrVal_1202) 4 v_ArrVal_1189) 0 v_ArrVal_1201))))) (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1202))))) (store .cse26 v_ArrVal_1210 (store (store (select .cse26 v_ArrVal_1210) .cse25 v_ArrVal_1202) v_ArrVal_1209 v_ArrVal_1207)))) (.cse18 (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse24 (select (select (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1209)) v_ArrVal_1210) .cse25)) (.cse21 (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1210)) v_ArrVal_1210) .cse25)) (.cse23 (+ .cse24 4))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse24)) .cse22) .cse23))) (select (select (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse19)) (select (select (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse22)) .cse22) .cse23)) (+ .cse19 4)))))))) 0))) (<= |c_#StackHeapBarrier| v_ArrVal_1210) (<= |c_#StackHeapBarrier| v_ArrVal_1189) (= v_ArrVal_1202 v_ArrVal_1189) (<= |c_#StackHeapBarrier| v_ArrVal_1202))) is different from false [2021-12-17 09:19:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-17 09:19:39,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590184589] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:19:39,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:19:39,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2021-12-17 09:19:39,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775741738] [2021-12-17 09:19:39,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:19:39,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 09:19:39,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:19:39,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 09:19:39,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=395, Unknown=2, NotChecked=40, Total=506 [2021-12-17 09:19:39,408 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 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-17 09:19:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:19:40,874 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2021-12-17 09:19:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 09:19:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 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 42 [2021-12-17 09:19:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:19:40,875 INFO L225 Difference]: With dead ends: 152 [2021-12-17 09:19:40,875 INFO L226 Difference]: Without dead ends: 125 [2021-12-17 09:19:40,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=79, Invalid=475, Unknown=2, NotChecked=44, Total=600 [2021-12-17 09:19:40,876 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:19:40,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 322 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 130 Unchecked, 0.2s Time] [2021-12-17 09:19:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-17 09:19:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2021-12-17 09:19:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.221311475409836) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:19:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2021-12-17 09:19:40,890 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 42 [2021-12-17 09:19:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:19:40,890 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2021-12-17 09:19:40,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 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-17 09:19:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2021-12-17 09:19:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:19:40,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:19:40,892 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:19:40,920 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-17 09:19:41,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:19:41,108 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:19:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:19:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash 189925921, now seen corresponding path program 1 times [2021-12-17 09:19:41,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:19:41,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815306469] [2021-12-17 09:19:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:19:41,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:19:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:19:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:19:41,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:19:41,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815306469] [2021-12-17 09:19:41,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815306469] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:19:41,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814021716] [2021-12-17 09:19:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:19:41,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:19:41,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:19:41,354 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-17 09:19:41,355 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-17 09:19:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:19:41,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 136 conjunts are in the unsatisfiable core [2021-12-17 09:19:41,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:19:41,512 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-17 09:19:41,564 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:19:41,567 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-17 09:19:41,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:41,570 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-17 09:19:41,582 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-17 09:19:41,582 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 25 treesize of output 29 [2021-12-17 09:19:41,592 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-17 09:19:41,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:41,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:41,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2021-12-17 09:19:41,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:41,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2021-12-17 09:19:41,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:41,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:19:41,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:41,731 INFO L354 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2021-12-17 09:19:41,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2021-12-17 09:19:42,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2021-12-17 09:19:42,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,119 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:19:42,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 69 [2021-12-17 09:19:42,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 51 [2021-12-17 09:19:42,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,135 INFO L354 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2021-12-17 09:19:42,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2021-12-17 09:19:42,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:42,353 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-17 09:19:42,354 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 105 [2021-12-17 09:19:42,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,368 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:19:42,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2021-12-17 09:19:42,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 09:19:42,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:42,590 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:19:42,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 96 [2021-12-17 09:19:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,602 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:19:42,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2021-12-17 09:19:42,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 09:19:42,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:19:42,749 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:19:42,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 64 [2021-12-17 09:19:42,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:42,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 09:19:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:19:42,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:19:42,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1418 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1418) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) is different from false [2021-12-17 09:19:42,807 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1418 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1418) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))))) is different from false [2021-12-17 09:19:57,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 Int) (v_ArrVal_1393 Int) (v_ArrVal_1395 Int) (v_ArrVal_1389 Int) (v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1404 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1406 Int) (v_ArrVal_1418 (Array Int Int))) (or (<= |c_#StackHeapBarrier| v_ArrVal_1404) (not (= 0 (select (store |c_#valid| v_ArrVal_1389 1) v_ArrVal_1404))) (<= |c_#StackHeapBarrier| v_ArrVal_1389) (not (= 0 (select |c_#valid| v_ArrVal_1389))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse4 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_1389 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_1389) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1395)))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse9 v_ArrVal_1404 (store (store (select .cse9 v_ArrVal_1404) 4 0) 0 v_ArrVal_1406))))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_1389 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_1389) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1393)))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1389))))) (store .cse7 v_ArrVal_1404 (store (store (select .cse7 v_ArrVal_1404) 4 v_ArrVal_1389) 0 v_ArrVal_1408)))) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1404) 4)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1404)) v_ArrVal_1404) 4)) (.cse3 (+ .cse6 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_1389 v_ArrVal_1386) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1383) v_ArrVal_1404 v_ArrVal_1396) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1418) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) .cse2) .cse3)) (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse2) .cse3))))))))) is different from false [2021-12-17 09:19:58,609 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:19:58,609 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 2292 treesize of output 2293 [2021-12-17 09:19:58,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:58,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:58,622 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 280838 treesize of output 279110 [2021-12-17 09:19:58,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:58,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:58,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:19:59,063 INFO L354 Elim1Store]: treesize reduction 20468, result has 0.4 percent of original size [2021-12-17 09:19:59,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 12651294 treesize of output 12215366 [2021-12-17 09:20:05,433 WARN L227 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 886 DAG size of output: 834 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 09:20:05,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:20:05,482 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 2394 treesize of output 2338 [2021-12-17 09:20:05,502 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 2338 treesize of output 2282 [2021-12-17 09:20:05,522 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 2282 treesize of output 2150 [2021-12-17 09:20:05,542 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 1333 treesize of output 1317 [2021-12-17 09:20:05,553 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 09:20:05,553 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:20:05,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-12-17 09:20:05,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029600833] [2021-12-17 09:20:05,553 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 09:20:05,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:20:05,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:20:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:20:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=253, Unknown=3, NotChecked=102, Total=420 [2021-12-17 09:20:05,554 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-17 09:20:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:20:06,004 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2021-12-17 09:20:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 09:20:06,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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 42 [2021-12-17 09:20:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:20:06,005 INFO L225 Difference]: With dead ends: 131 [2021-12-17 09:20:06,005 INFO L226 Difference]: Without dead ends: 107 [2021-12-17 09:20:06,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=171, Invalid=594, Unknown=3, NotChecked=162, Total=930 [2021-12-17 09:20:06,007 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:20:06,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 115 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:20:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-17 09:20:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 55. [2021-12-17 09:20:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:20:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-12-17 09:20:06,012 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 42 [2021-12-17 09:20:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:20:06,013 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-17 09:20:06,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-17 09:20:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2021-12-17 09:20:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 09:20:06,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:20:06,014 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2021-12-17 09:20:06,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-17 09:20:06,227 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,SelfDestructingSolverStorable12 [2021-12-17 09:20:06,228 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:20:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:20:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1055590647, now seen corresponding path program 6 times [2021-12-17 09:20:06,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:20:06,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297651746] [2021-12-17 09:20:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:20:06,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:20:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:20:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:20:06,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:20:06,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297651746] [2021-12-17 09:20:06,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297651746] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:20:06,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547941985] [2021-12-17 09:20:06,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 09:20:06,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:20:06,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:20:06,700 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-17 09:20:06,702 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-17 09:20:07,548 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-17 09:20:07,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:20:07,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 188 conjunts are in the unsatisfiable core [2021-12-17 09:20:07,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:20:07,566 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-17 09:20:07,620 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:20:07,623 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-17 09:20:07,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,626 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-17 09:20:07,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,638 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 20 treesize of output 22 [2021-12-17 09:20:07,648 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-17 09:20:07,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 27 [2021-12-17 09:20:07,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 49 [2021-12-17 09:20:07,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2021-12-17 09:20:07,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,796 INFO L354 Elim1Store]: treesize reduction 68, result has 38.2 percent of original size [2021-12-17 09:20:07,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2021-12-17 09:20:07,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2021-12-17 09:20:07,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:07,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 106 [2021-12-17 09:20:08,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,026 INFO L354 Elim1Store]: treesize reduction 182, result has 6.7 percent of original size [2021-12-17 09:20:08,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 80 [2021-12-17 09:20:08,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,054 INFO L354 Elim1Store]: treesize reduction 142, result has 38.0 percent of original size [2021-12-17 09:20:08,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 113 [2021-12-17 09:20:08,363 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2021-12-17 09:20:08,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2021-12-17 09:20:08,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,418 INFO L354 Elim1Store]: treesize reduction 131, result has 10.3 percent of original size [2021-12-17 09:20:08,418 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 276 treesize of output 115 [2021-12-17 09:20:08,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 212 [2021-12-17 09:20:08,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,449 INFO L354 Elim1Store]: treesize reduction 8, result has 88.1 percent of original size [2021-12-17 09:20:08,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 74 [2021-12-17 09:20:08,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:20:08,888 INFO L354 Elim1Store]: treesize reduction 98, result has 6.7 percent of original size [2021-12-17 09:20:08,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 378 treesize of output 150 [2021-12-17 09:20:08,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,901 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:20:08,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 188 [2021-12-17 09:20:08,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:08,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2021-12-17 09:20:09,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:20:09,199 INFO L354 Elim1Store]: treesize reduction 103, result has 6.4 percent of original size [2021-12-17 09:20:09,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 285 treesize of output 141 [2021-12-17 09:20:09,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,219 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:20:09,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 196 [2021-12-17 09:20:09,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2021-12-17 09:20:09,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,508 INFO L354 Elim1Store]: treesize reduction 186, result has 8.4 percent of original size [2021-12-17 09:20:09,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 304 treesize of output 148 [2021-12-17 09:20:09,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,519 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:20:09,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 96 [2021-12-17 09:20:09,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-17 09:20:09,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:20:09,789 INFO L354 Elim1Store]: treesize reduction 41, result has 8.9 percent of original size [2021-12-17 09:20:09,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 207 treesize of output 108 [2021-12-17 09:20:09,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:20:09,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-17 09:20:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:20:09,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:20:09,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1686 (Array Int Int))) (<= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1686) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2021-12-17 09:20:09,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1686 (Array Int Int))) (<= (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1686) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2021-12-17 09:20:09,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1686 (Array Int Int))) (<= (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse8 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse9 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse6 (+ .cse7 4))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse5) .cse6))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5) .cse6)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1686) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2021-12-17 09:20:09,932 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:20:09,932 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1126 treesize of output 1130 [2021-12-17 09:21:53,263 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-17 09:21:53,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-12-17 09:21:53,264 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-12-17 09:21:53,264 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:21:53,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-12-17 09:21:53,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600772121] [2021-12-17 09:21:53,265 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 09:21:53,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 09:21:53,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:21:53,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 09:21:53,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=404, Unknown=3, NotChecked=126, Total=600 [2021-12-17 09:21:53,266 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:21:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 09:21:53,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=67, Invalid=404, Unknown=3, NotChecked=126, Total=600 [2021-12-17 09:21:53,266 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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-17 09:21:53,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:21:53,285 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-17 09:21:53,467 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,SelfDestructingSolverStorable13 [2021-12-17 09:21:53,468 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@663cac8e at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-17 09:21:53,472 INFO L158 Benchmark]: Toolchain (without parser) took 681954.36ms. Allocated memory was 94.4MB in the beginning and 1.1GB in the end (delta: 992.0MB). Free memory was 54.6MB in the beginning and 699.7MB in the end (delta: -645.1MB). Peak memory consumption was 347.6MB. Max. memory is 16.1GB. [2021-12-17 09:21:53,472 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 71.9MB in the beginning and 71.8MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:21:53,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.06ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 63.5MB in the end (delta: -9.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 09:21:53,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.37ms. Allocated memory is still 94.4MB. Free memory was 63.5MB in the beginning and 61.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:21:53,472 INFO L158 Benchmark]: Boogie Preprocessor took 46.82ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 60.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:21:53,473 INFO L158 Benchmark]: RCFGBuilder took 349.09ms. Allocated memory is still 94.4MB. Free memory was 60.0MB in the beginning and 48.1MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 09:21:53,473 INFO L158 Benchmark]: TraceAbstraction took 681092.02ms. Allocated memory was 94.4MB in the beginning and 1.1GB in the end (delta: 992.0MB). Free memory was 47.6MB in the beginning and 699.7MB in the end (delta: -652.1MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. [2021-12-17 09:21:53,474 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 71.9MB in the beginning and 71.8MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.06ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 63.5MB in the end (delta: -9.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.37ms. Allocated memory is still 94.4MB. Free memory was 63.5MB in the beginning and 61.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.82ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 60.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 349.09ms. Allocated memory is still 94.4MB. Free memory was 60.0MB in the beginning and 48.1MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 681092.02ms. Allocated memory was 94.4MB in the beginning and 1.1GB in the end (delta: 992.0MB). Free memory was 47.6MB in the beginning and 699.7MB in the end (delta: -652.1MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@663cac8e de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@663cac8e: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/hash_fun.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:21:55,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:21:55,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:21:55,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:21:55,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:21:55,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:21:55,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:21:55,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:21:55,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:21:55,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:21:55,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:21:55,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:21:55,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:21:55,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:21:55,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:21:55,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:21:55,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:21:55,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:21:55,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:21:55,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:21:55,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:21:55,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:21:55,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:21:55,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:21:55,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:21:55,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:21:55,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:21:55,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:21:55,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:21:55,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:21:55,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:21:55,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:21:55,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:21:55,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:21:55,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:21:55,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:21:55,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:21:55,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:21:55,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:21:55,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:21:55,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:21:55,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 09:21:55,369 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:21:55,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:21:55,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:21:55,370 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:21:55,371 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:21:55,371 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:21:55,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:21:55,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:21:55,373 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:21:55,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:21:55,374 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:21:55,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:21:55,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:21:55,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:21:55,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:21:55,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:21:55,375 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 09:21:55,375 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 09:21:55,375 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 09:21:55,376 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:21:55,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:21:55,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:21:55,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:21:55,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:21:55,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:21:55,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:21:55,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:21:55,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:21:55,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:21:55,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:21:55,386 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 09:21:55,386 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 09:21:55,387 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:21:55,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:21:55,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:21:55,387 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:21:55,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 09:21:55,388 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b [2021-12-17 09:21:55,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:21:55,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:21:55,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:21:55,707 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:21:55,707 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:21:55,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/hash_fun.i [2021-12-17 09:21:55,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f8d2793/595bd61eeb5b4ed7bd567608d03e738a/FLAGb292c0aff [2021-12-17 09:21:56,272 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:21:56,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i [2021-12-17 09:21:56,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f8d2793/595bd61eeb5b4ed7bd567608d03e738a/FLAGb292c0aff [2021-12-17 09:21:56,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f8d2793/595bd61eeb5b4ed7bd567608d03e738a [2021-12-17 09:21:56,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:21:56,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:21:56,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:21:56,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:21:56,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:21:56,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:21:56" (1/1) ... [2021-12-17 09:21:56,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7394d8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:56, skipping insertion in model container [2021-12-17 09:21:56,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:21:56" (1/1) ... [2021-12-17 09:21:56,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:21:56,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:21:57,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i[23732,23745] [2021-12-17 09:21:57,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:21:57,050 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:21:57,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i[23732,23745] [2021-12-17 09:21:57,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:21:57,132 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:21:57,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57 WrapperNode [2021-12-17 09:21:57,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:21:57,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:21:57,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:21:57,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:21:57,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,199 INFO L137 Inliner]: procedures = 128, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2021-12-17 09:21:57,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:21:57,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:21:57,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:21:57,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:21:57,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:21:57,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:21:57,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:21:57,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:21:57,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (1/1) ... [2021-12-17 09:21:57,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:21:57,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:21:57,280 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-17 09:21:57,304 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-17 09:21:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 09:21:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 09:21:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:21:57,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 09:21:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 09:21:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 09:21:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:21:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 09:21:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 09:21:57,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 09:21:57,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:21:57,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:21:57,478 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:21:57,479 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:21:57,695 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:21:57,700 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:21:57,700 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 09:21:57,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:21:57 BoogieIcfgContainer [2021-12-17 09:21:57,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:21:57,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:21:57,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:21:57,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:21:57,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:21:56" (1/3) ... [2021-12-17 09:21:57,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c709d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:21:57, skipping insertion in model container [2021-12-17 09:21:57,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:21:57" (2/3) ... [2021-12-17 09:21:57,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c709d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:21:57, skipping insertion in model container [2021-12-17 09:21:57,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:21:57" (3/3) ... [2021-12-17 09:21:57,711 INFO L111 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2021-12-17 09:21:57,715 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:21:57,715 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:21:57,771 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:21:57,781 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-17 09:21:57,782 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:21:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:21:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 09:21:57,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:21:57,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:21:57,800 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:21:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:21:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash 257818720, now seen corresponding path program 1 times [2021-12-17 09:21:57,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:21:57,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433396660] [2021-12-17 09:21:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:21:57,818 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:21:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:21:57,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:21:57,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 09:21:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:21:57,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:21:57,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:21:58,054 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-17 09:21:58,061 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-17 09:21:58,087 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-17 09:21:58,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:21:58,088 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:21:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433396660] [2021-12-17 09:21:58,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433396660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:21:58,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:21:58,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 09:21:58,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414086314] [2021-12-17 09:21:58,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:21:58,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 09:21:58,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:21:58,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 09:21:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 09:21:58,132 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:21:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:21:58,260 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2021-12-17 09:21:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:21:58,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-17 09:21:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:21:58,268 INFO L225 Difference]: With dead ends: 36 [2021-12-17 09:21:58,268 INFO L226 Difference]: Without dead ends: 18 [2021-12-17 09:21:58,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 09:21:58,273 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:21:58,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:21:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-17 09:21:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-17 09:21:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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-17 09:21:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-12-17 09:21:58,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 8 [2021-12-17 09:21:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:21:58,298 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-17 09:21:58,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:21:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2021-12-17 09:21:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 09:21:58,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:21:58,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:21:58,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 09:21:58,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:21:58,508 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:21:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:21:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash 356920873, now seen corresponding path program 1 times [2021-12-17 09:21:58,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:21:58,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663343656] [2021-12-17 09:21:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:21:58,510 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:21:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:21:58,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:21:58,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 09:21:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:21:58,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 09:21:58,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:21:58,623 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-17 09:21:58,715 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:21:58,725 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-17 09:21:58,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:21:58,735 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 27 [2021-12-17 09:21:58,755 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:21:58,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 09:21:58,765 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-17 09:21:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:21:58,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:21:59,035 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:21:59,036 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 20 treesize of output 21 [2021-12-17 09:21:59,042 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 44 treesize of output 32 [2021-12-17 09:21:59,050 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 7 treesize of output 5 [2021-12-17 09:21:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:21:59,166 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:21:59,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663343656] [2021-12-17 09:21:59,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663343656] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:21:59,167 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:21:59,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-17 09:21:59,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774835897] [2021-12-17 09:21:59,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:21:59,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 09:21:59,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:21:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 09:21:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:21:59,175 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:21:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:21:59,520 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2021-12-17 09:21:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:21:59,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-17 09:21:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:21:59,521 INFO L225 Difference]: With dead ends: 46 [2021-12-17 09:21:59,521 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 09:21:59,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-17 09:21:59,522 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:21:59,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2021-12-17 09:21:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 09:21:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-12-17 09:21:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:21:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-17 09:21:59,527 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 13 [2021-12-17 09:21:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:21:59,527 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-17 09:21:59,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:21:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-17 09:21:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 09:21:59,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:21:59,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:21:59,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 09:21:59,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:21:59,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:21:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:21:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -378541860, now seen corresponding path program 1 times [2021-12-17 09:21:59,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:21:59,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937212890] [2021-12-17 09:21:59,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:21:59,731 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:21:59,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:21:59,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:21:59,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 09:21:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:21:59,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-17 09:21:59,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:21:59,859 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-17 09:21:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:21:59,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:21:59,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:21:59,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:21:59,982 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:21:59,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 09:22:00,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:22:00,143 INFO L354 Elim1Store]: treesize reduction 103, result has 14.2 percent of original size [2021-12-17 09:22:00,144 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 5 case distinctions, treesize of input 81 treesize of output 62 [2021-12-17 09:22:00,155 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:22:00,156 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2021-12-17 09:22:00,207 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 26 treesize of output 10 [2021-12-17 09:22:00,212 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 26 treesize of output 10 [2021-12-17 09:22:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:22:00,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:22:02,869 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:02,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937212890] [2021-12-17 09:22:02,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937212890] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:02,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:02,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-17 09:22:02,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704377537] [2021-12-17 09:22:02,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:02,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 09:22:02,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 09:22:02,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=52, Unknown=1, NotChecked=0, Total=72 [2021-12-17 09:22:02,871 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:03,142 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2021-12-17 09:22:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:22:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-17 09:22:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:03,144 INFO L225 Difference]: With dead ends: 39 [2021-12-17 09:22:03,144 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 09:22:03,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=19, Invalid=52, Unknown=1, NotChecked=0, Total=72 [2021-12-17 09:22:03,146 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:03,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 84 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 24 Unchecked, 0.3s Time] [2021-12-17 09:22:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 09:22:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-17 09:22:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 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-17 09:22:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-12-17 09:22:03,151 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2021-12-17 09:22:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:03,151 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-12-17 09:22:03,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-12-17 09:22:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 09:22:03,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:03,152 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:03,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 09:22:03,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:03,366 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1586481664, now seen corresponding path program 2 times [2021-12-17 09:22:03,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:03,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462797073] [2021-12-17 09:22:03,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:22:03,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:03,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:03,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:03,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 09:22:03,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:22:03,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:22:03,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-17 09:22:03,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:03,667 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:03,681 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-17 09:22:03,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:03,697 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 31 [2021-12-17 09:22:03,708 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-17 09:22:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 09:22:03,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:04,058 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:04,058 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 20 treesize of output 21 [2021-12-17 09:22:04,066 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 44 treesize of output 32 [2021-12-17 09:22:04,084 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 7 treesize of output 5 [2021-12-17 09:22:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:22:04,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:04,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462797073] [2021-12-17 09:22:04,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462797073] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:04,311 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:04,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-12-17 09:22:04,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184071119] [2021-12-17 09:22:04,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:04,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:22:04,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:22:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:22:04,313 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-17 09:22:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:04,468 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2021-12-17 09:22:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:22:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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 18 [2021-12-17 09:22:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:04,471 INFO L225 Difference]: With dead ends: 53 [2021-12-17 09:22:04,471 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 09:22:04,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:22:04,472 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:04,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2021-12-17 09:22:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 09:22:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2021-12-17 09:22:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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-17 09:22:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2021-12-17 09:22:04,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2021-12-17 09:22:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:04,479 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2021-12-17 09:22:04,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-17 09:22:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2021-12-17 09:22:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 09:22:04,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:04,480 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:04,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-17 09:22:04,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:04,688 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1586479742, now seen corresponding path program 1 times [2021-12-17 09:22:04,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:04,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170612063] [2021-12-17 09:22:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:04,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:04,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:04,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:04,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 09:22:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:04,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-17 09:22:04,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:04,913 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:04,924 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-17 09:22:04,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:04,938 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 27 [2021-12-17 09:22:04,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-17 09:22:05,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2021-12-17 09:22:05,141 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 54 treesize of output 38 [2021-12-17 09:22:05,148 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 38 treesize of output 22 [2021-12-17 09:22:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 09:22:05,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:05,278 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:05,278 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 18 treesize of output 19 [2021-12-17 09:22:05,283 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 40 treesize of output 28 [2021-12-17 09:22:05,300 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 9 treesize of output 7 [2021-12-17 09:22:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:22:05,577 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:05,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170612063] [2021-12-17 09:22:05,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170612063] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:05,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:05,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-12-17 09:22:05,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766712440] [2021-12-17 09:22:05,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:05,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:22:05,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:05,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:22:05,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:22:05,579 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:05,796 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2021-12-17 09:22:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:22:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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-17 09:22:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:05,798 INFO L225 Difference]: With dead ends: 45 [2021-12-17 09:22:05,798 INFO L226 Difference]: Without dead ends: 38 [2021-12-17 09:22:05,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:22:05,799 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:05,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2021-12-17 09:22:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-17 09:22:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2021-12-17 09:22:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2021-12-17 09:22:05,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2021-12-17 09:22:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:05,805 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2021-12-17 09:22:05,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2021-12-17 09:22:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 09:22:05,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:05,806 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:05,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-17 09:22:06,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:06,018 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash -81466513, now seen corresponding path program 1 times [2021-12-17 09:22:06,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:06,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763231640] [2021-12-17 09:22:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:06,020 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:06,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:06,020 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:06,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 09:22:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:06,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:22:06,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:22:06,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:22:06,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:06,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763231640] [2021-12-17 09:22:06,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763231640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:22:06,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:22:06,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:22:06,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491499107] [2021-12-17 09:22:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:22:06,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:22:06,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:22:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:22:06,193 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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-17 09:22:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:06,282 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2021-12-17 09:22:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:22:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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 20 [2021-12-17 09:22:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:06,283 INFO L225 Difference]: With dead ends: 53 [2021-12-17 09:22:06,283 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 09:22:06,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:22:06,284 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:06,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:22:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 09:22:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-12-17 09:22:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-17 09:22:06,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 20 [2021-12-17 09:22:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:06,292 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-17 09:22:06,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-17 09:22:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-12-17 09:22:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 09:22:06,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:06,293 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:06,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 09:22:06,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:06,494 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:06,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:06,494 INFO L85 PathProgramCache]: Analyzing trace with hash 805305258, now seen corresponding path program 1 times [2021-12-17 09:22:06,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:06,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704316437] [2021-12-17 09:22:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:06,495 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:06,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:06,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:06,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 09:22:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:06,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-17 09:22:06,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:06,765 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:06,774 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-17 09:22:06,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:06,784 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 31 [2021-12-17 09:22:06,795 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-17 09:22:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:22:07,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:07,312 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:07,312 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 20 treesize of output 21 [2021-12-17 09:22:07,324 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 44 treesize of output 32 [2021-12-17 09:22:07,333 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 7 treesize of output 5 [2021-12-17 09:22:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 09:22:07,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:07,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704316437] [2021-12-17 09:22:07,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704316437] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:07,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:07,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-12-17 09:22:07,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771992784] [2021-12-17 09:22:07,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:07,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:22:07,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:07,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:22:07,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:22:07,491 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 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-17 09:22:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:07,685 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2021-12-17 09:22:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:22:07,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 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 22 [2021-12-17 09:22:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:07,686 INFO L225 Difference]: With dead ends: 40 [2021-12-17 09:22:07,686 INFO L226 Difference]: Without dead ends: 38 [2021-12-17 09:22:07,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:22:07,687 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:07,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 39 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2021-12-17 09:22:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-17 09:22:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2021-12-17 09:22:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-17 09:22:07,698 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2021-12-17 09:22:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:07,698 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-17 09:22:07,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 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-17 09:22:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-17 09:22:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 09:22:07,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:07,701 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:07,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 09:22:07,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:07,913 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash 805307180, now seen corresponding path program 1 times [2021-12-17 09:22:07,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:07,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304321126] [2021-12-17 09:22:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:07,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:07,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:07,915 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:07,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 09:22:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:08,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-17 09:22:08,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:08,148 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:08,160 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-17 09:22:08,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:08,175 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 31 [2021-12-17 09:22:08,183 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-17 09:22:08,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 77 treesize of output 57 [2021-12-17 09:22:08,492 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 54 treesize of output 38 [2021-12-17 09:22:08,499 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 38 treesize of output 22 [2021-12-17 09:22:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:22:08,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:08,688 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:08,689 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 18 treesize of output 19 [2021-12-17 09:22:08,694 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 40 treesize of output 28 [2021-12-17 09:22:08,707 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 9 treesize of output 7 [2021-12-17 09:22:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 09:22:08,944 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:08,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304321126] [2021-12-17 09:22:08,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304321126] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:08,944 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:08,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-12-17 09:22:08,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058989589] [2021-12-17 09:22:08,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:08,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:22:08,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:22:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:22:08,945 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-17 09:22:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:09,105 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2021-12-17 09:22:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:22:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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 22 [2021-12-17 09:22:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:09,106 INFO L225 Difference]: With dead ends: 40 [2021-12-17 09:22:09,106 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 09:22:09,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:22:09,107 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:09,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 9 Unchecked, 0.1s Time] [2021-12-17 09:22:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 09:22:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-17 09:22:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 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-17 09:22:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-12-17 09:22:09,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2021-12-17 09:22:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:09,111 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-17 09:22:09,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-17 09:22:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-12-17 09:22:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 09:22:09,112 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:09,112 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:09,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 09:22:09,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:09,313 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:09,313 INFO L85 PathProgramCache]: Analyzing trace with hash -934006939, now seen corresponding path program 2 times [2021-12-17 09:22:09,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791537910] [2021-12-17 09:22:09,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:22:09,314 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:09,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:09,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 09:22:09,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:22:09,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:22:09,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-17 09:22:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:09,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:22:09,577 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-17 09:22:09,592 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:09,604 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-17 09:22:09,643 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-17 09:22:09,643 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 28 treesize of output 35 [2021-12-17 09:22:09,652 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 27 [2021-12-17 09:22:09,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:09,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:09,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-17 09:22:10,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:10,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:22:10,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:10,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 50 [2021-12-17 09:22:10,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:10,044 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:22:10,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-12-17 09:22:10,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:22:10,477 INFO L354 Elim1Store]: treesize reduction 103, result has 14.2 percent of original size [2021-12-17 09:22:10,477 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 5 case distinctions, treesize of input 129 treesize of output 82 [2021-12-17 09:22:10,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:10,495 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:22:10,495 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 94 [2021-12-17 09:22:10,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-12-17 09:22:11,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:11,008 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 93 treesize of output 61 [2021-12-17 09:22:11,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:11,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 52 treesize of output 32 [2021-12-17 09:22:11,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 26 [2021-12-17 09:22:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:22:11,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:11,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_394 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_394) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (bvadd |c_ULTIMATE.start_main_~base~0#1| (_ bv100 32)))) is different from false [2021-12-17 09:22:14,415 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:14,415 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 158 treesize of output 159 [2021-12-17 09:22:14,611 INFO L354 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2021-12-17 09:22:14,612 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 7028 treesize of output 6550 [2021-12-17 09:22:14,726 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 1301 treesize of output 1285 [2021-12-17 09:22:14,755 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 1285 treesize of output 1253 [2021-12-17 09:22:14,773 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 1253 treesize of output 1245 [2021-12-17 09:22:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2021-12-17 09:22:23,653 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791537910] [2021-12-17 09:22:23,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791537910] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:23,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:23,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-12-17 09:22:23,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909034861] [2021-12-17 09:22:23,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:23,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 09:22:23,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:23,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 09:22:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=111, Unknown=9, NotChecked=22, Total=182 [2021-12-17 09:22:23,656 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:24,527 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2021-12-17 09:22:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:22:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 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-17 09:22:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:24,528 INFO L225 Difference]: With dead ends: 46 [2021-12-17 09:22:24,528 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 09:22:24,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=67, Invalid=198, Unknown=11, NotChecked=30, Total=306 [2021-12-17 09:22:24,529 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:24,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 70 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 58 Unchecked, 0.2s Time] [2021-12-17 09:22:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 09:22:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2021-12-17 09:22:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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-17 09:22:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-12-17 09:22:24,534 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 23 [2021-12-17 09:22:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:24,534 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-12-17 09:22:24,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-12-17 09:22:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 09:22:24,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:24,536 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:24,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-17 09:22:24,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:24,750 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash -934005017, now seen corresponding path program 1 times [2021-12-17 09:22:24,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:24,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975737651] [2021-12-17 09:22:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:24,752 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:24,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:24,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:24,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 09:22:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:24,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-17 09:22:24,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:24,919 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-17 09:22:25,000 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:25,010 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-17 09:22:25,044 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-17 09:22:25,045 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 28 treesize of output 35 [2021-12-17 09:22:25,049 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 27 [2021-12-17 09:22:25,075 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-17 09:22:25,419 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2021-12-17 09:22:25,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:25,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 50 [2021-12-17 09:22:25,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:25,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:25,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2021-12-17 09:22:25,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:25,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:22:25,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:25,510 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:22:25,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-12-17 09:22:25,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:22:25,920 INFO L354 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2021-12-17 09:22:25,921 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 5 case distinctions, treesize of input 129 treesize of output 86 [2021-12-17 09:22:25,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:25,937 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:22:25,937 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 1 case distinctions, treesize of input 53 treesize of output 46 [2021-12-17 09:22:25,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-12-17 09:22:26,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:26,313 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 89 treesize of output 57 [2021-12-17 09:22:26,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:26,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 48 treesize of output 28 [2021-12-17 09:22:26,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 38 treesize of output 22 [2021-12-17 09:22:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:22:26,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:26,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_474) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_ULTIMATE.start_main_~base~0#1|)) is different from false [2021-12-17 09:22:26,568 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:26,568 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 104 [2021-12-17 09:22:29,795 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:29,795 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 156 treesize of output 157 [2021-12-17 09:22:30,181 INFO L354 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2021-12-17 09:22:30,181 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 28228 treesize of output 26118 [2021-12-17 09:22:30,555 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 5053 treesize of output 5021 [2021-12-17 09:22:30,596 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 5021 treesize of output 4957 [2021-12-17 09:22:30,640 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 4957 treesize of output 4829 [2021-12-17 09:22:30,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:30,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975737651] [2021-12-17 09:22:30,667 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 09:22:30,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [747275819] [2021-12-17 09:22:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:30,668 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:22:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:22:30,671 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:22:30,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2021-12-17 09:22:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:30,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-17 09:22:30,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:31,089 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-17 09:22:31,103 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:31,111 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-17 09:22:31,118 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 10 treesize of output 9 [2021-12-17 09:22:31,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:31,131 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 27 [2021-12-17 09:22:31,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:31,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:31,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:31,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-17 09:22:31,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22: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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2021-12-17 09:22:31,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:31,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:22:31,637 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:22:31,637 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 26 treesize of output 26 [2021-12-17 09:22:32,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:32,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:22:32,310 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-17 09:22:32,310 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 85 [2021-12-17 09:22:32,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:32,372 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:22:32,372 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2021-12-17 09:22:32,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:32,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-12-17 09:22:33,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:33,086 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 88 treesize of output 56 [2021-12-17 09:22:33,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:22:33,102 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 46 treesize of output 22 [2021-12-17 09:22:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:22:33,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:33,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_551) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_ULTIMATE.start_main_~base~0#1|)) is different from false [2021-12-17 09:22:34,594 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:34,595 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 156 treesize of output 157 [2021-12-17 09:22:34,759 INFO L354 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2021-12-17 09:22:34,759 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 1648 treesize of output 1578 [2021-12-17 09:22:34,795 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 283 treesize of output 275 [2021-12-17 09:22:34,808 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 133 treesize of output 131 [2021-12-17 09:22:34,816 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 273 treesize of output 269 [2021-12-17 09:22:34,836 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-17 09:22:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 7 not checked. [2021-12-17 09:22:36,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [747275819] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:36,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:36,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-17 09:22:36,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371788000] [2021-12-17 09:22:36,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:36,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 09:22:36,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 09:22:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=265, Unknown=13, NotChecked=70, Total=420 [2021-12-17 09:22:36,395 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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-17 09:22:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:37,591 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-12-17 09:22:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:22:37,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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 23 [2021-12-17 09:22:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:37,592 INFO L225 Difference]: With dead ends: 46 [2021-12-17 09:22:37,592 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 09:22:37,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=96, Invalid=360, Unknown=14, NotChecked=82, Total=552 [2021-12-17 09:22:37,593 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:37,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 74 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 45 Unchecked, 0.4s Time] [2021-12-17 09:22:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 09:22:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-12-17 09:22:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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-17 09:22:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2021-12-17 09:22:37,598 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 23 [2021-12-17 09:22:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:37,598 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2021-12-17 09:22:37,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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-17 09:22:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2021-12-17 09:22:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 09:22:37,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:37,599 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:37,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-17 09:22:37,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2021-12-17 09:22:38,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:22:38,004 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1206871035, now seen corresponding path program 1 times [2021-12-17 09:22:38,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:38,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887743592] [2021-12-17 09:22:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:38,005 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:38,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:38,006 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:38,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-17 09:22:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:38,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-17 09:22:38,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:38,195 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-17 09:22:38,264 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-17 09:22:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:38,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-17 09:22:38,337 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-17 09:22:38,338 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 28 treesize of output 35 [2021-12-17 09:22:38,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 31 treesize of output 27 [2021-12-17 09:22:38,599 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2021-12-17 09:22:38,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:38,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 50 [2021-12-17 09:22:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:38,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:38,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2021-12-17 09:22:38,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:38,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:22:38,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:38,656 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:22:38,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-12-17 09:22:39,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:22:39,306 INFO L354 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2021-12-17 09:22:39,307 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 5 case distinctions, treesize of input 129 treesize of output 76 [2021-12-17 09:22:39,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:39,334 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:22:39,334 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 1 case distinctions, treesize of input 36 treesize of output 33 [2021-12-17 09:22:39,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-12-17 09:22:39,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:39,871 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 93 treesize of output 61 [2021-12-17 09:22:39,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:39,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 52 treesize of output 32 [2021-12-17 09:22:39,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 26 [2021-12-17 09:22:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:22:39,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:40,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_628) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (bvadd |c_ULTIMATE.start_main_~base~0#1| (_ bv100 32)))) is different from false [2021-12-17 09:22:40,183 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:40,183 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 106 [2021-12-17 09:22:43,320 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:43,320 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 158 treesize of output 159 [2021-12-17 09:22:43,527 INFO L354 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2021-12-17 09:22:43,528 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 3452 treesize of output 3246 [2021-12-17 09:22:43,576 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 633 treesize of output 617 [2021-12-17 09:22:43,585 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 617 treesize of output 609 [2021-12-17 09:22:43,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 609 treesize of output 605 [2021-12-17 09:22:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-17 09:22:49,113 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:22:49,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887743592] [2021-12-17 09:22:49,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887743592] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:22:49,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:22:49,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-12-17 09:22:49,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514869085] [2021-12-17 09:22:49,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:22:49,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 09:22:49,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:22:49,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 09:22:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=114, Unknown=7, NotChecked=22, Total=182 [2021-12-17 09:22:49,116 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:22:50,339 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2021-12-17 09:22:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 09:22:50,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 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-17 09:22:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:22:50,340 INFO L225 Difference]: With dead ends: 50 [2021-12-17 09:22:50,340 INFO L226 Difference]: Without dead ends: 48 [2021-12-17 09:22:50,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 4 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=102, Invalid=275, Unknown=7, NotChecked=36, Total=420 [2021-12-17 09:22:50,341 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:22:50,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2021-12-17 09:22:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-17 09:22:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2021-12-17 09:22:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2021-12-17 09:22:50,350 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2021-12-17 09:22:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:22:50,352 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2021-12-17 09:22:50,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:22:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2021-12-17 09:22:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 09:22:50,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:22:50,353 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:22:50,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-17 09:22:50,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:22:50,563 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:22:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:22:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1206872957, now seen corresponding path program 1 times [2021-12-17 09:22:50,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:22:50,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049555169] [2021-12-17 09:22:50,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:22:50,565 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:22:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:22:50,566 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:22:50,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 09:22:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:22:50,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-17 09:22:50,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:22:50,791 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-17 09:22:50,889 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:22:50,895 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-17 09:22:50,921 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-17 09:22:50,921 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 28 treesize of output 35 [2021-12-17 09:22:50,926 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 27 [2021-12-17 09:22:50,958 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-17 09:22:51,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:51,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:51,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-17 09:22:51,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:51,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 50 [2021-12-17 09:22:51,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:51,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2021-12-17 09:22:51,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:51,274 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:22:51,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-12-17 09:22:51,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:22:51,849 INFO L354 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2021-12-17 09:22:51,849 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 5 case distinctions, treesize of input 129 treesize of output 86 [2021-12-17 09:22:51,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:51,864 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:22:51,865 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 1 case distinctions, treesize of input 53 treesize of output 46 [2021-12-17 09:22:51,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-12-17 09:22:52,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:52,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 57 [2021-12-17 09:22:52,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:22:52,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 48 treesize of output 28 [2021-12-17 09:22:52,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2021-12-17 09:22:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:22:52,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:22:52,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_708) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_ULTIMATE.start_main_~base~0#1|)) is different from false [2021-12-17 09:22:53,622 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:22:53,622 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 156 treesize of output 157 [2021-12-17 09:22:53,964 INFO L354 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2021-12-17 09:22:53,964 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 14052 treesize of output 13030 [2021-12-17 09:22:54,119 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 2509 treesize of output 2477 [2021-12-17 09:22:54,148 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 2477 treesize of output 2413 [2021-12-17 09:22:54,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 2413 treesize of output 2397 [2021-12-17 09:24:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-17 09:24:03,809 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:24:03,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049555169] [2021-12-17 09:24:03,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049555169] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:24:03,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:24:03,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-12-17 09:24:03,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131283939] [2021-12-17 09:24:03,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:24:03,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 09:24:03,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:24:03,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 09:24:03,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=135, Unknown=9, NotChecked=24, Total=210 [2021-12-17 09:24:03,811 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:24:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:24:04,404 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2021-12-17 09:24:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 09:24:04,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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-17 09:24:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:24:04,405 INFO L225 Difference]: With dead ends: 50 [2021-12-17 09:24:04,405 INFO L226 Difference]: Without dead ends: 43 [2021-12-17 09:24:04,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=65, Invalid=202, Unknown=9, NotChecked=30, Total=306 [2021-12-17 09:24:04,405 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:24:04,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2021-12-17 09:24:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-17 09:24:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-12-17 09:24:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:24:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-12-17 09:24:04,409 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2021-12-17 09:24:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:24:04,410 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-17 09:24:04,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:24:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2021-12-17 09:24:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 09:24:04,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:24:04,411 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 09:24:04,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-17 09:24:04,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:24:04,620 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:24:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:24:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash 173886752, now seen corresponding path program 3 times [2021-12-17 09:24:04,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:24:04,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655670260] [2021-12-17 09:24:04,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:24:04,621 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:24:04,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:24:04,622 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:24:04,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-17 09:24:04,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 09:24:04,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:24:04,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-17 09:24:04,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:24:04,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:24:04,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:04,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:24:04,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:04,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:24:04,974 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-17 09:24:04,975 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 28 treesize of output 35 [2021-12-17 09:24:05,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2021-12-17 09:24:05,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,164 INFO L354 Elim1Store]: treesize reduction 59, result has 10.6 percent of original size [2021-12-17 09:24:05,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 54 [2021-12-17 09:24:05,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,183 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-17 09:24:05,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-12-17 09:24:05,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:24:05,470 INFO L354 Elim1Store]: treesize reduction 155, result has 13.4 percent of original size [2021-12-17 09:24:05,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 127 treesize of output 86 [2021-12-17 09:24:05,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,483 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:24:05,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2021-12-17 09:24:05,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:24:05,858 INFO L354 Elim1Store]: treesize reduction 115, result has 15.4 percent of original size [2021-12-17 09:24:05,858 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 80 [2021-12-17 09:24:05,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,874 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:24:05,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2021-12-17 09:24:05,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:05,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:24:06,008 INFO L354 Elim1Store]: treesize reduction 47, result has 6.0 percent of original size [2021-12-17 09:24:06,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 48 [2021-12-17 09:24:06,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:06,025 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:24:06,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2021-12-17 09:24:06,053 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-17 09:24:06,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:24:21,925 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-17 09:24:21,925 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:24:21,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655670260] [2021-12-17 09:24:21,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655670260] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:24:21,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:24:21,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-17 09:24:21,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114582915] [2021-12-17 09:24:21,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:24:21,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 09:24:21,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:24:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 09:24:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=125, Unknown=1, NotChecked=0, Total=156 [2021-12-17 09:24:21,927 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:24:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:24:22,148 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-12-17 09:24:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 09:24:22,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 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-17 09:24:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:24:22,152 INFO L225 Difference]: With dead ends: 58 [2021-12-17 09:24:22,153 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 09:24:22,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=30, Invalid=125, Unknown=1, NotChecked=0, Total=156 [2021-12-17 09:24:22,153 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:24:22,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 185 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2021-12-17 09:24:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 09:24:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-17 09:24:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 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-17 09:24:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-17 09:24:22,160 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 28 [2021-12-17 09:24:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:24:22,160 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-17 09:24:22,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:24:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2021-12-17 09:24:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 09:24:22,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:24:22,161 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 09:24:22,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-17 09:24:22,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:24:22,362 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:24:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:24:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash -746210199, now seen corresponding path program 4 times [2021-12-17 09:24:22,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:24:22,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773003160] [2021-12-17 09:24:22,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:24:22,363 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:24:22,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:24:22,364 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:24:22,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-17 09:24:22,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:24:22,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:24:22,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 101 conjunts are in the unsatisfiable core [2021-12-17 09:24:22,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:24:22,706 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-17 09:24:22,773 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 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:24:22,782 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-17 09:24:22,808 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-17 09:24:22,808 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 28 treesize of output 35 [2021-12-17 09:24:22,814 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 27 [2021-12-17 09:24:22,835 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-17 09:24:23,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-17 09:24:23,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2021-12-17 09:24:23,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 50 [2021-12-17 09:24:23,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,159 INFO L354 Elim1Store]: treesize reduction 47, result has 41.3 percent of original size [2021-12-17 09:24:23,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 63 [2021-12-17 09:24:23,639 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2021-12-17 09:24:23,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2021-12-17 09:24:23,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2021-12-17 09:24:23,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,736 INFO L354 Elim1Store]: treesize reduction 59, result has 10.6 percent of original size [2021-12-17 09:24:23,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 83 [2021-12-17 09:24:23,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:23,773 INFO L354 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2021-12-17 09:24:23,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44 [2021-12-17 09:24:24,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:24:24,493 INFO L354 Elim1Store]: treesize reduction 151, result has 15.6 percent of original size [2021-12-17 09:24:24,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 195 treesize of output 110 [2021-12-17 09:24:24,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:24,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:24,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:24,517 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:24:24,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2021-12-17 09:24:24,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-12-17 09:24:25,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:25,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:24:25,891 INFO L354 Elim1Store]: treesize reduction 124, result has 12.1 percent of original size [2021-12-17 09:24:25,891 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 99 [2021-12-17 09:24:25,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:25,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:25,918 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 09:24:25,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 68 [2021-12-17 09:24:25,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-12-17 09:24:26,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:26,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:24:26,515 INFO L354 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2021-12-17 09:24:26,515 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 99 [2021-12-17 09:24:26,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:26,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:24:26,549 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:24:26,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-17 09:24:26,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-12-17 09:24:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:24:26,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:24:26,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (bvadd |c_ULTIMATE.start_main_~base~0#1| (_ bv100 32)))) is different from false [2021-12-17 09:24:26,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (bvadd (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (bvadd .cse4 (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_915) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))) (bvadd |c_ULTIMATE.start_main_~base~0#1| (_ bv100 32)))) is different from false [2021-12-17 09:24:26,826 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:24:26,826 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 362 Killed by 15